Sciweavers

4 search results - page 1 / 1
» Identification in the Limit of Substitutable Context-Free La...
Sort
View
ICGI
2010
Springer
15 years 3 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
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...
Ryo Yoshinaka
ICGI
2010
Springer
14 years 11 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
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...
Alexander Clark
JMLR
2010
192views more  JMLR 2010»
14 years 8 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater