4 search results - page 1 / 1 » Polynomial-Time Identification of Multiple Context-Free Lang... |
137
Voted
ICGI
2010
Springer
15 years 4 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...
126
Voted
COLT
1992
Springer
15 years 7 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...
130
Voted
ICGI
2010
Springer
15 years 4 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...
149
Voted
ICGI
2010
Springer
15 years 28 days 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...