3 search results - page 1 / 1 » Learning Context Free Grammars in the Limit Aided by the Sam... |
ECML
2003
Springer
13 years 10 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
ICGI
2010
Springer
13 years 2 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...
ICGI
2010
Springer
13 years 5 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...