Sciweavers

4743 search results - page 21 / 949
» The PlusCal Algorithm Language
Sort
View
CORR
1999
Springer
61views Education» more  CORR 1999»
13 years 9 months ago
Language Identification With Confidence Limits
A statistical classification algorithm and its application to language identification from noisy input are described. The main innovation is to compute confidence limits on the cl...
David Elworthy
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
14 years 1 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...
AWPN
2008
232views Algorithms» more  AWPN 2008»
13 years 11 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
AAAI
1994
13 years 11 months ago
L* Parsing: A General Framework for Syntactic Analysis of Natural Language
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Eric K. Jones, Linton M. Miller
ICALP
1997
Springer
14 years 2 months ago
Constructive Linear Time Algorithms for Branchwidth
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
Hans L. Bodlaender, Dimitrios M. Thilikos