Abstract
The paper formulates projective dependency grammars in terms of constraints on a string based encoding of dependency trees and develops an approach to obtain a regular approximation for these grammars. In the approach, dependency analyses are encoded with balanced bracketing that encodes dependency relations among the words of the analyzed sentence. The brackets, thus, indicate dependencies rather than delimit phrases. The encoding allows expressing dependency rules (in the sense of Hays and Gaifman) using a semi-Dyck language and a so-called context restriction operation. When the semi-Dyck language in the representation is replaced with a regular restriction of it, we obtain an approximation for the original dependency grammar.
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
Nivre, J.: An efficient algorithm for projective dependency parsing. In: 8th Int’l Workshop on Parsing Technologies (IWPT 2003), Nancy, France (2003)
Oflazer, K.: Dependency parsing with an extended finite-state approach. Computational Linguistics 29 (2003)
Mel’čuk, I.A.: Dependency Syntax: Theory and Practice. State University of New York Press, Albany (1988)
Sleator, D., Temperley, D.: Parsing English with a link grammar. In: 3rd International Workshop on Parsing Technologies, pp. 277–291 (1993)
Ihm, P., Lecerf, Y.: Éléments pour une grammaire générale des langues projectives. Technical Report EUR 210.f, Centre de Traitement de l’Information Scientifique – CETIS (1963)
Marcus, S.: Algebraic Linguistics; Analytical Models. Academic Press, New York (1967)
Höfler, S.: Link2tree: A dependency-constituency converter. Lizentiatsarbeit, Institute of Computational Linguistics, University of Zürich (2002)
Hays, D.G.: Dependency theory: A formalism and some observations. Language 40, 511–525 (1964)
Gaifman, H.: Dependency systems and phrase-structure systems. Information and Control 8, 304–337 (1965)
Robinson, J.J.: Dependency structures and transformational rules. Language 46, 259–285 (1970)
Debusmann, R.: An introduction to dependency grammar. Hausarbeit für das Hauptseminar Dependenzgrammatik SoSe 99. Univeristät des Saarlandes (2000)
Lai, T.B.Y., Huang, C.: Functional constraints in dependency grammar. In: GLDV 1999. Multilinguale Corpora: Codierung, Structurierung, Analyse. 11. Jahrestagung der Gesellschaft für Linguistische Daten Verarbeitung, 8.-10.7.1999, Frankfurt a/M, pp. 235–244 (1999)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. In: Brafford, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118–161. North-Holland, Amsterdam (1963)
Roche, E., Schabes, Y. (eds.): Finite-state language processing. A Bradford Book. MIT Press, Cambridge (1997)
Lombardo, V., Lesmo, L.: An Earley-type recognizer for dependency grammar. In: 16th COLING, Copenhagen, vol. 2, pp. 723–728 (1996)
Elworthy, D.: A finite state parser with dependency structure output. In: Proceedings of International Workshop on Parsing Technologies (2000)
Maruyama, H.: Structural disambiguation with constraint propagation. In: Proceedings of the 28th ACL (ACL 1990), Pittsburgh, PA, pp. 31–38 (1990)
Duchier, D.: Lexicalized syntax and topology for non-projective dependency grammar. In: Joint Conference on Formal Grammars and Mathematics of Language FGMOL 2001, Helsinki (2001)
Tesnière, L.: Éléments de Syntaxe Structurale. Editions Klincksieck, Paris (1959)
Yli-Jyrä, A., Koskenniemi, K.: Compiling contextual restrictions on strings into finite-state automata. In: The Eindhoven FASTAR Days, Technische Universiteit Eindhoven, Eindhoven, The Netherlands (2004)
Wrathall, C.: Characterizations of the Dyck sets. R.A.I.R.O. Informatique théorique/Theoretical Computer Science 11, 53–62 (1977)
Yli-Jyrá, A.: Simplification of intermediate results during intersection of multiple weighted automata. In: Droste, M., Vogler, H. (eds.) Weighted Automata — Theory and Applications, Dresden, Germany, pp. 46–48 (2004)
Kromann, M.T., Mikkelsen, L., Lynge, S.K.: The Danish Dependency Treebank Website. Dept. of Computational Linguistics, Copenhagen Business School (2003), http://www.id.cbs.dk/~mtk/treebank
Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)
Yli-Jyrä, A.: Axiomatization of restricted non-projective dependency trees through finite-state constraints that analyse crossing bracketings. In: Kruijff, G.J.M., Duchier, D. (eds.) Proceedings of the Workshop of Recent Advances in Dependency Grammar, COLING 2004 Workshop, pp. 33–40 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yli-Jyrä, A. (2005). Approximating Dependency Grammars Through Intersection of Regular Languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds) Implementation and Application of Automata. CIAA 2004. Lecture Notes in Computer Science, vol 3317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30500-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-30500-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24318-2
Online ISBN: 978-3-540-30500-2
eBook Packages: Computer ScienceComputer Science (R0)