4 search results - page 1 / 1 » Polynomial-Time Identification of Multiple Context-Free Lang... |
118
click to vote
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
106
click to vote
COLT
1992
Springer
15 years 4 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
109
Voted
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
121
Voted
ICGI
2010
Springer
14 years 10 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...