Abstract
An all-path parsing algorithm for a constraint-based dependency grammar of context-free power is presented. The grammar specifies possible dependencies between words together with a number of constraints. The algorithm builds a packed representation of ambiguous syntactic structure in the form of a dependency graph. For certain types of ambiguities the graph grows slower than the chart or parse forest.
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
Barbero, C., Lombardo, V.: Dependency graphs in natural language processing. In: Gori, M., Soda, G. (eds.) Topics in Artificial Intelligence. LNCS, vol. 992, pp. 115–126. Springer, Heidelberg (1995)
Covington, M.: A dependency parser for variable–word–order languages. Technical Report AI-1990-01, The University of Georgia, Athens, Georgia 30602 (1990)
Kay, M.: Algorithm schemata and data structures in syntactic processing. In: Grosz, B., et al. (ed.) Readings in Natural Language Processing, Morgan Kaufmann, Los Altos, CA (2000)
Obrębski, T., Graliński, F.: Some notes on generative capacity of dependency grammars. In: Proceedings of COLING 2004 Workshop Recent Advances in Dependency Grammar, Geneve, pp. 65–71 (2004)
Obrębski, T., Stolarski, M.: UAM Text Tools — a flexible NLP architecture. In: Proceedings of LREC 2006, Genoa, pp. 2259–2262 (2006)
Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic, Boston, MA (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Obrêbski, T. (2007). An All-Path Parsing Algorithm for Constraint-Based Dependency Grammars of CF-Power. In: Matoušek, V., Mautner, P. (eds) Text, Speech and Dialogue. TSD 2007. Lecture Notes in Computer Science(), vol 4629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74628-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-74628-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74627-0
Online ISBN: 978-3-540-74628-7
eBook Packages: Computer ScienceComputer Science (R0)