A polynomial algorithm for the inference of context free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5278 LNAI, Issue , 2008, Pages 29-42

  Clark, Alexander ^a   Eyraud, Rémi ^b   Habrard, Amaury ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FEATURES; CONTEXT DISTRIBUTIONS; CONTEXT FREE; DISTRIBUTIONAL LEARNINGS; GENERALISATION; INDUCTIVE INFERENCES; LANGUAGE ACQUISITIONS; NATURAL LANGUAGES; POLYNOMIAL ALGORITHMS; POLYNOMIAL TIMES; POSITIVE DATUMS; REGULAR LANGUAGES;

ALGORITHMS; COMPUTATIONAL GRAMMARS; CONTEXT SENSITIVE LANGUAGES; INFERENCE ENGINES; LEARNING ALGORITHMS; LEARNING SYSTEMS; LINGUISTICS; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 56649121801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88009-7_3     Document Type: Conference Paper

References (15)

1. Higuera, C.D.L., Oncina, J.: Inferring deterministic linear languages. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNGS (LNAI), vol. 2375, pp. 185-200. Springer, Heidelberg (2002)
2. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298(1), 179-206 (2003)
3. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725-1745 (2007)
4. Marcus, S.: Algebraic Linguistics; Analytical Models. Academic Press, N. Y (1967)
5. Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalised Phrase Structure Grammar. Basil Blackwell, Maiden (1985)
6. Boullier, P.: A Cubic Time Extension of Context-Free Grammars. Grammars 3, 111-131 (2000)
7. Asveld, P.: Generating all permutations by context-free grammars in Chomsky normal form. Theoretical Computer Science 354(1), 118-130 (2006)
8. Gold, E.M.: Language identification in the limit. Information and Control 10, 447-474 (1967)
9. Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319-342 (1988)
10. Pitt, L.: Inductive inference, dfa's, and computational complexity. LNCS (LNAI), pp. 8-14. Springer, Heidelberg (1989)
11. de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27(2), 125-138 (1997)
12. Adriaans, P.: Learning shallow context-free languages under simple distributions. Algebras, Diagrams and Decisions in Language, Logic and Computation 127 (2002)
13. Horning, J.J.: A Study of Grammatical Inference. PhD thesis, Stanford University, Computer Science Department, California (1969)
14. Clark, A.: PAC-learning unambiguous NTS languages. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 59-71. Springer, Heidelberg (2006)
15. Klein, D., Manning, C.: Corpus-based induction of syntactic structure: models of dependency and constituency. In: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, pp. 478-485 (2004)