A simple CF formalism and free word order

• Autorzy: 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 first objective of this paper is to present a simple grammatical formalism named treegenerating Binary Grammar. The formalism is weakly equivqlent to CFGs, yet it is capable of generating various kinds of syntactic trees, including dependency trees. Its strong equivalence to some other grammatical formalisms is discussed. The second objective is to show how some free word order phenomena in Polish can be captured within the proposed formalism.

Słowa kluczowe

EN

grammatical formalisms; parsing; free word order; discontinuity

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

Twórcy

autor

Graliński F.

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

Bibliografia

• [1] J. D. Hopcroft and J. E. Ullman: Introduction to Automata Theory. Languages, and Computation. Addison-Wesley, 1979.
• [2] T. Holan, V. Kubon, K Oliva and M. Platek: Two Useful Measures of Word Order Complexity. Proc. Workshop on Processing of Dependency-Based Grammars, (1998).
• [3] Nasr Alexis and Rambow Owen: A Simple String-Rewriting Formalism for Dependency Grammar. COUNG 2004 Recent Advances in Dependency Grammar, Geert-Jan M. Kruijffand D. Duchier (Eds), (2004), 17-24.
• [4] M.-J. Nederhof, G. Satta and S. M. Shieber: Partially ordered multiset context-free grammars and free-word-order parsing. Proc. 8th int. Workshop on Parsing Technologies. Nancy. France. (2003). 171-182. http://www.coli.unisb.de/publikationen/softcopies/Nederhof:2003:POM.pdf