Learning deterministic context free grammars: The Omphalos competition

Machine Learning

Volumn 66, Issue 1, 2007, Pages 93-110

  Clark, Alexander ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Context Free Languages; Grammatical inference; NTS languages

Indexed keywords

DETERMINISTIC GRAMMARS; NON TERMINALLY SEPARATED (NTS) GRAMMARS; THEORETIC CONSTITUENT LIKELIHOOD;

ALGORITHMS; CONTEXT SENSITIVE LANGUAGES; HEURISTIC METHODS; LEARNING SYSTEMS; MAXIMUM LIKELIHOOD ESTIMATION;

CONTEXT FREE GRAMMARS;

EID: 33845212445     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-9592-9     Document Type: Article

References (29)

1. Abe, N., & Warmuth, M. K. (1992). On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9, 205-260.
2. Adriaans, P., Trautwein, M., & Vervoort, M. (2000). Towards high speed grammar induction on large text corpora. In V. Hlavac, K. G. Jeffery, & J. Wiedermann (Eds.), SOFSEM 2000: Theory and practice of informatics (pp. 173-186). Springer Verlag.
3. Boasson, L., & Senizergues, S. (1985). NTS languages are deterministic and congruential. J. Comput. Syst. Sci., 37(3), 332-342.
4. Book, R., & Otto, F. (1993). String rewriting systems. Springer Verlag.
5. Book, R. V. (1981). NTS grammars and Church-Rosser systems. Information Processing Letters, 13(2), 73-76.
6. Carrasco, R. C., & Oncina, J. (1999). Learning deterministic regular grammars from stochastic samples in polynomial time. Theoretical Informatics and Applications, 33(1), 1-20.
7. Clark, A. (2001). Unsupervised induction of stochastic context free grammars with distributional clustering. In Proc. of Conference on Computational Natural Language Learning (pp. 105-112). Toulouse, France.
8. Clark, A., & Thollard, F. (2004a). PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research, 5, 473-497.
9. Clark, A., & Thollard, F. (2004b). Partially distribution-free learning of regular languages from positive samples. In Proceedings of COLING. Geneva, Switzerland.
10. Eyraud, R., de la Higuera, C., & Janodet, J.-C. (2004). Representing languages by learnable rewriting systems. In. International Colloquium on Grammatical Inference, vol. 3264 of LNAI(pp. 139-150). Athens, Greece.
11. Gazdar, G., Klein, E., Pullum, G., & Sag, I. (1985). Generalised phrase structure grammar. Basil Blackwell.
12. Gusfield, D. (1997). Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press.
13. Harris, Z. (1954). Distributional structure. In J. A. Fodor & J. J. Katz (Eds.), The structure of language (pp. 33-49). Prentice-Hall.
14. Harrison, M. A. (1978). Introduction to formal language theory. Addison Wesley.
15. Kearns, M., & Valiant, G. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. JACM, 41(1), 67-95.
16. Keller, B., & Lutz, R. (2005). Evolutionary induction of stochastic context free grammars. Pattern Recognition. to appear.
17. Klein, D., & Manning, C. (2001). Distributional phrase structure induction. In Proceedings of CoNLL 2001 (pp. 113-121).
18. Lamb, S. M. (1961). On the mechanisation of syntactic analysis. In 1961 Conference on Machine Translation of Languages and Applied Language Analysis, vol. 2 of National Physical Laboratory Symposium No. 13 (pp. 674-685). London: Her Majesty's Stationery Office.
19. Lari, K., & Young, S. J. (1990). The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4, 35-56.
20. McNaughton, R., Narendran, P., & Otto, F. (1988). Church-Rosser Thue systems and formal languages. J. ACM, 35(2), 324-344.
21. Nevill-Manning, C. G., & Witten, I. H. (1997). Identifying hierarchical structure in sequences. Journal of Artificial Intelligence Research, 7, 67-82.
22. Ron, D., Singer, Y., & Tishby, N. (1995). On the learnability and usage of acyclic probabilistic finite automata. In COLT 1995 (pp. 31-40). Santa Cruz CA USA.
23. Sakakibara, Y (1992). Efficient learning of context free grammars from positive structural samples. Inf Computing, 97(1), 23-60.
24. Solan, Z., Horn, D., Ruppin, E., & Edelman, S. (2003). Unsupervised context sensitive language acquisition from a large corpus. In Proceedings of NIPS-2003.
25. Starkie, B., Coste, F., & van Zaanen, M. (2004). The Omphalos context-free grammar learning competition. In International Colloquium on Grammatical Inference, vol. 3264 of LNAI (pp. 16-27). Athens, Greece.
26. Stolz, W. (1965). A probabilistic procedure for grouping words into phrases. Language and Speech, 8(4), 219-235.
27. Thatcher, J. W. (1967). Characterizing derivation trees of context free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 7(4), 317-322.
28. van Zaanen, M. (2000). ABL: Alignment-based learning. In COLING 2000-Proceedings of the 18th International Conference on Computational Linguistics.
29. Yuval, G. (1979). How to swindle Rabin. Cryptologia, 3, 187-189.