论文信息 - A Polynomial Time Algorithm for Inferring Grammars for Mildly Context Sensitive Languages

A Polynomial Time Algorithm for Inferring Grammars for Mildly Context Sensitive Languages

Natural languages are largely context-sensitive, yet context-sensitive grammars cannot be identified in the limit from positive examples [Gold, 1967]. Mildly context-sensitive languages are able to express the most common context-sensitive structures found in natural language. We restrict our view to a class of mildly context-sensitive languages which can be described by simple external contextual grammars. We present the first polynomialtime algorithm for inferring these grammars from positive data.

T. Oates | T. Armstrong | Mike Atamas | L. Becerra-Bonache

[1] Willard Van Orman Quine,et al. Word and Object , 1960 .

[2] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[3] Noam Chomsky. Reflections on Language. , 1977 .

[4] Erkki Mäkinen. On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars , 1992, Inf. Process. Lett..

[5] G. Marcus. Negative evidence in language acquisition , 1993, Cognition.

[6] Tim Oates,et al. Learning k-Reversible Context-Free Grammars from Positive Structural Examples , 2002, ICML.

[7] A. Mateescu,et al. Contexts and the Concept of Mild Context-Sensitivity , 2003 .

[8] Leonor Becerra-Bonache,et al. Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning , 2004, ICGI.

[9] Tom Armstrong,et al. On the Relationship between Lexical Semantics and Syntax for the Inference of Context-Free Grammars , 2004, AAAI.

[10] Information Processing Letters 108 (2008) 45–49 Contents lists available at ScienceDirect Information Processing Letters , .