Reinterpreting DCG for free word order languages

• Autorzy: Vetulani Z. , Graliński F.
• Konferencja: Human Language Technologies as a challenge for Computer Science and Linguistics (2; 21-23.04.2005; Poznań, Poland)
• Języki publikacji: EN

Abstrakty

EN

The DCG rules are context-free rules with non-terminal symbols allowing arbitrary terms as parameters. Because of that the DCG-like formalisms are considered particularly well suited to encode NL grammars. This observation is however only partially true for languages withfree word and possibilities of discontinuous constructions, e.g. for Slavonic and Germanic languages. What seems interesting is that a minor formal modification in The DCG formalism makes it flexible enough to cover word-order related problems. What we explore here is the idea of reinterpretation of the concept of defference list. This implies a non-standard interpretation of DCG rules, in which the ordering of the right-hand-side symbols does not necessarily correspond to the surface ordering of corresponding expressions and the non-terminals may represent discontinuous categories. In this paper we propose a solution in which both non-standard interpretations of DCG rules co-exist.

Słowa kluczowe

EN

natural language processing; DCG like formalisms; free word order

• Wydawca: Polish Academy of Sciences, Committee of Automatic Control and Robotics
• Czasopismo: Archives of Control Sciences
• Rocznik: 2005
• Tom: Vol. 15, no. 4
• Strony: 691--702
• Opis fizyczny: Bibliogr. 16 poz., rys.

Twórcy

autor

Vetulani Z.

• Adam Mickiewicz University, Umultowska 87, 61-614 Poznań

autor

Graliński F.

• Adam Mickiewicz University, Umultowska 87, 61-614 Poznań

Bibliografia

• [1] G. E. Barton Jr.: On the complexity of ID/LP parsing. Computational Linguistics. 11(4), (1985), 205-218.
• [2] G. E. Barton Jr., R. Barwick and E. S. Ristad: The complexity of ID/LP parsing, chapter 7, pages 187-213. The MIT Press, Cambridge MA, 1987.
• [3] I. Bratko: PROLOG programming for artificial intelligence. Addison-Wesley, 2001.
• [4] A. Colmerauer: Methamorphosis grammars. In Leonard Bole. (Ed.). Natural Language Communication with Computers, vol. 63 of Lecture Notes in Computer Science. Springer. New York. N.Y., 1978.
• [5] V. Dahl: Discontinuous grammars. Computational Intelligence, 5 (1989). 161-179.
• [6] V. Dahl, Paul Tarau and R. Li: Assumption grammars for processing natural language. In Lee Naish. (Ed). Proceedings of the Fourteenth international Conference on Logic Programming, pages 256-270. MIT Press, 1997.
• [7] M. Derwojedowa: Porządek linearny składników zdania elementarnego w języku polskim. Elipsa. 2000, (in Polish).
• [8] G. Gazdar, E. Klein, G. Pullum and I. Sag: Generalized phrase structure grammar. Harward University Press, 1985.
• [9] M. Johnson: Parsing with discontinuous constitents. In Proc. 23rd Conf. On Association for Computational Linguistics. (1985), 127-132.
• [10] F. Pereira: Extraposition grammars. American J. for Computational Linguistics, 7(1981), 243-256.
• [11] F. Pereira and D. Warren: Definite clause grammars for language analysis - a survey of the formalism and a comparision with transition networks. Artificial Intelligence. 13(1980), 231-278.
• [12] C. Pollard: Generalized context-free grammars, head grammars, and natural language. PhD thesis. Stanford. 1984.
• [13] M. Reape: A logical treatment of semi-free word order and bounded discontinuous constituency. In Fourth Conf European Chapter of the Association for Computational Linguistics. UMIST Manchester, 1989.
• [14] O. Suhre: Computational Aspects of a Grammar Formalism for Languages with Freer Word Order. Diploma thesis, Universität Tübingen, 2000.
• [15] G. Van Noord: Head corner parsing. 1998. URL: http://odur.let.rug.nirannoord/papers/lugano/lugano.html.
• [16] Z. Vetulani: Free Order DCG (FROG) in application to formal description of semi-free word order languages. In Sztuczna Inteligencja. Materiały V Konferencji Naukowej, Siedlce. Poland. 2002. 59-72, (in Polish).