Learning left-to-right and right-to-left iterative languages

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

Volumn 5278 LNAI, Issue , 2008, Pages 84-97

  Heinz, Jeffrey ^a  

^a UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; CONFORMAL MAPPING; INFERENCE ENGINES; KETONES; LEARNING ALGORITHMS; MERGING; QUERY LANGUAGES;

FINAL STATES; INITIAL STATES; MERGING ALGORITHMS; NATURAL LANGUAGES; OBSERVED SAMPLES; POSITIVE DATUMS; PREFIX TREES; REGULAR LANGUAGES; SUFFIX TREES;

LINGUISTICS;

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

References (35)

1. Gold, E.: Language identification in the limit. Information and Control 10, 447-474 (1967)
2. Marcus, G.: Negative evidence in language acquisition. Cognition 46, 53-85 (1993)
3. Angluin, D.: Finding patterns common to a, set of strings. Journal of Computer and System Sciences 21, 46-62 (1980)
4. Angluin, D.: Inductive inference of formal languages from positive data. Information Control 45, 117-135 (1980)
5. Angluin, D.: Inference of reversible languages. Journal for the Association of Computing Machinery 29(3), 741-765 (1982)
6. Garcia, P., Vidal, E., Oncina, J.: Learning locally testable languages in the strict sense. In: Proceedings of the Workshop on Algorithmic Learning Theory, pp. 325-338 (1990)
7. Muggleton, S.: Inductive Acquisition of Expert Knowledge. Addison-Wesley, Reading (1990)
8. Kanazawa, M.: Identification in the limit of categorical grammars. Journal of Logic, Language, and Information 5, 115-155 (1996)
9. Denis, F., Lemay, A., Terlutte, A.: Some classes of regular languages identifiable in the limit from positive data. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 63-76. Springer, Heidelberg (2002)
10. Fernau, H.: Identification of function distinguishable languages. Theoretical Computer Science 290, 1679-1711 (2003)
11. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298(1), 179-206 (2003)
12. Oates, T., Armstrong, T., Bonache, L.B.: Inferring grammars for mildly context-sensitive languages in polynomial-time. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 137-147. Springer, Heidelberg (2006)
13. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725-1745 (2007)
14. Greenberg, J.: Some universals of grammar with particular reference to the order of meaningful elements. In: Universals of Language, pp. 73-113. MIT Press, Cambridge (1963)
15. Mairal, R., Gil, J. (eds.): Linguistic Universals. Cambridge University Press, Cambridge (2006)
16. Stabler, E.P.: Computational models ol language universale: Expressiveness, learnability and consequences. In: Cornell Symposium on Language Universals (2007)
17. Shieber, S.: Evidence against the context-lreeness ol natural language. Linguistics and Philosophy 8, 333-343 (1985)
18. Kobele, G.: Generating Copies: An Investigation into Structural Identity in Language and Grammar. PhD thesis, University of California, Los Angeles (2006)
19. Johnson, C.D.: Formal Aspects ol Phonological Description. Mouton, The Hague (1972)
20. Kaplan, R., Kay, M.: Regular models ol phonological rule systems. Computational Linguistics 20(3), 331-378 (1994)
21. Heinz, J.: The Inductive Learning ol Phonotactic Patterns. PhD thesis, University of California, Los Angeles (2007)
22. Pullum, G., Rogers, J.: Aural pattern recognition experiments and the subregular hierarchy. In: Kracht, M. (ed.) Proceedings ol 10th Mathematics ol Language Conference, pp. 1-7. University ol California, Los Angeles (2007)
23. Jusczyk, P., Cutler, A., R.edanz, N.: Inlants' preference lor the predominant stress patterns of english words. Child Development 64, 675-687 (1993)
24. Jusczyk, P., Luce, P., Charles-Luce, J.: Inlants' sensitivity to phonotactic patterns in the native language. Journal ol Memory and Language 33, 630-645 (1994)
25. Mattys, S., Jusczyk, P.: Phonotactic cues lor segmentation ol fluent speech by inlants. Cognition 78, 91-121 (2001)
26. McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
27. Kracht, M.: The Mathematics ol Language. Mouton de Gruyter, Berlin (2003)
28. Hansson, G.: Theoretical and typological issues in consonant harmony. PhD thesis, University ol California, Berkeley (2001)
29. Hayes, B.: Metrical Stress Theory. Chicago University Press (1995)
30. Heinz, J.: Learning quantity insensitive stress systems via local inference. In: Proceedings ol the Eighth Meeting of the ACL Special Interest Group in Computational Phonology at HLT-NAACL, New York City, USA, pp. 21-30 (2006)
31. Heinz, J.: On the role ol locality in learning stress patterns. Phonology (to appear)
32. Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems That Learn: An Introduction to Learning Theory, 2nd edn. The MIT Press, Cambridge (1999)
33. Case, J., Moelius, S.: Parallelism increases iterative learning power. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 49-63. Springer, Heidelberg (2007)
34. Hopcrolt, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)
35. de la Higuera, C.: Characteristic sets lor polynomial grammatical inference. Machine Learning 27, 125-138 (1997)