Efficient, correct, unsupervised learning of context-sensitive languages

CoNLL 2010 - Fourteenth Conference on Computational Natural Language Learning, Proceedings of the Conference

Volumn , Issue , 2010, Pages 28-37

  Clark, Alexander ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRAL PROBLEMS; DISTRIBUTIONAL LEARNING; GENERALISATION; GRAMMAR INDUCTION; NATURAL LANGUAGES; SIMPLE ALGORITHM;

CONTEXT SENSITIVE LANGUAGES; LEARNING ALGORITHMS;

UNSUPERVISED LEARNING;

EID: 84862285522     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. N. Abe and M. K. Warmuth. 1992. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9:205-260.
2. D. Angluin and M. Kharitonov. 1995. When won't membership queries help? J. Comput. Syst. Sci., 50:336-355.
3. D. Angluin. 1987. Learning regular sets from queries and counterexamples. Information and Computa tion, 75(2):87-106.
4. James P. Blevins and Juliette Blevins. 2009. Analogy in grammar: Form and acquisition. Oxford University Press.
5. A. Carnie. 2008. Constituent structure. Oxford Uni versity Press, USA.
6. Noam Chomsky. 2006. Language and mind. Cambridge University Press, 3rd edition.
7. Alexander Clark and Shalom Lappin. 2009. Another look at indirect negative evidence. In Proceedings of the EACL Workshop on Cognitive Aspects of Computational Language Acquisition, Athens, March.
8. Alexander Clark, Rémi Eyraud, and Amaury Habrard. 2008. A polynomial algorithm for the inference of context free languages. In Proceedings of International Colloquium on Grammatical Inference, pages 29-42. Springer, September.
9. Alexander Clark. 2009. A learnable representation for syntax using residuated lattices. In Proceedings of the 14th Conference on Formal Grammar, Bordeaux, France.
10. J.R. Curran. 2003. From distributional to semantic similarity. Ph.D. thesis, University of Edinburgh.
11. B. A. Davey and H. A. Priestley. 2002. Introduction to Lattices and Order. Cambridge University Press.
12. B. Ganter and R. Wille. 1997. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag.
13. E. M. Gold. 1967. Language identification in the limit. Information and control, 10(5):447-474.
14. Zellig Harris. 1954. Distributional structure. Word, 10(2-3):146-162.
15. J. J. Horning. 1969. A Study of Grammatical Inference. Ph.D. thesis, Stanford University, Computer Science Department, California.
16. M. Johnson. 2008. Using adaptor grammars to identify synergies in the unsupervised acquisition of linguistic structure. In 46th Annual Meeting of the ACL, pages 398-406.
17. Dan Klein and Chris Manning. 2001. Distributional phrase structure induction. In Proceedings of CoNLL 2001, pages 113-121.
18. Dan Klein and Chris Manning. 2004. Corpus-based induction of syntactic structure: Models of dependency and constituency. In Proceedings of the 42nd Annual Meeting of the ACL.
19. K. Lari and S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4:35-56.
20. L. Pitt. 1989. Inductive inference, dfa's, and computational complexity. In K. P. Jantke, editor, Analogical and Inductive Inference, number 397 in LNAI, pages 18-44. Springer-Verglag.
21. J. R. Saffran, R. N. Aslin, and E. L. Newport. 1996. Statistical learning by eight month old infants. Science, 274:1926-1928.
22. Hinrich Schütze. 1993. Part of speech induction from scratch. In Proceedings of the 31st annual meeting of the Association for Computational Linguistics, pages 251-258.