Abstract
Categorial Dependency Grammars (CDG) studied in this paper are categorial grammars expressing projective and discontinuous dependencies, stronger than cf-grammars and presumably nonequivalent to mild context-sensitive grammars. We define a normal form of CDG similar to Greibach normal form for cf-grammars and propose an effective algorithm which transforms any CDG into an equivalent CDG in the normal form. A class of push-down automata with independent counters is defined and it is proved that they accept the class of CDG-languages. We present algorithms that transform any CDG into an automaton and vice versa.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling. Parsing, vol. 1. Prentice-Hall, Inc., Englewood Cliffs (1972)
Bar-Hillel, Y., Gaifman, H., Shamir, E.: On categorial and phrase structure grammars. Bull. Res. Council Israel 9F, 1–16 (1960)
Blum, N., Koch, R.: Greibach Normal Form Transformation, Revisited. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 47–54. Springer, Heidelberg (1997)
Dekhtyar, M., Dikovsky, A.: Categorial Dependency Grammars. In: Moortgat, M., Prince, V. (eds.) Proc. of Int. Conf. on Categorial Grammars, Montpellier, pp. 76–91 (2004)
Dekhtyar, M., Dikovsky, A.: Generalized Categorial Dependency Grammars. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Trakhtenbrot/Festschrift. LNCS, vol. 4800, pp. 230–255. Springer, Heidelberg (2008)
Dekhtyar, M., Dikovsky, A., Karlov, B.: Iterated dependencies and Kleene iteration. In: Proc. of the 15th Conference on Formal Grammar (FG 2010), Copenhagen, Denmark. LNCS (2010) (to appear), http://www.angl.hu-berlin.de/FG10/fg10_list_of_papers
Dikovsky, A.: Grammars for Local and Long Dependencies. In: Proc. of the Intern. Conf. ACL 2001, Toulouse, France, pp. 156–163. ACL & Morgan Kaufman (2001)
Gladkij, A.V.: Formal Grammars and Languages, Moscow, “Nauka” (1973) (in Russian)
Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. J. Assoc. Computing Machinery 12(1), 42–52 (1965)
Tesnière, L.: Éléments de syntaxe structurale. Librairie C. Klincksieck, Paris (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karlov, B. (2012). Abstract Automata and a Normal Form for Categorial Dependency Grammars. In: Béchet, D., Dikovsky, A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31262-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-31262-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31261-8
Online ISBN: 978-3-642-31262-5
eBook Packages: Computer ScienceComputer Science (R0)