Abstract
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi”-dimensional configuration problems (lmcps). This class of problems both has a wide range of linguistic applications, and can be solved in a straightforward way using state”-of”-the”-art constraint programming technology. The paper falls into two main parts: We first present examples for linguistic configuration problems and show how to formalise them as constraint satisfaction problems. In the second part, we introduce Extensible Dependency Grammar (xdg), a framework for the development of linguistic resources in the context of lmcps.
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
Mittal, S., Frayman, F.: Towards a generic model of configuration tasks. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1395–1401. Morgan Kaufmann, San Francisco (1989)
Bos, J.: Predicate logic unplugged. In: Proceedings of the 10th Amsterdam Colloquium, pp. 133–143 (1996)
Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics. an introduction. Journal of Language and Computation (2004) (to appear)
Egg, M., Koller, A., Niehren, J.: The constraint language for lambda structures. Journal of Logic, Language, and Information (2001)
Abeillé, A., Rambow, O.: Tree Adjoining Grammar: An Overview. In: Tree Adjoining Grammars: Formalisms, Linguistic Analyses and Processing. CSLI Publications, Stanford (2000)
Koller, A., Striegnitz, K.: Generation as dependency parsing. In: Proceedings of ACL 2002, Philadelphia/USA (2002)
Duchier, D.: Configuration of labeled trees under lexicalized constraints and principles. Research on Language and Computation 1, 307–336 (2003)
Duchier, D., Debusmann, R.: Topological dependency trees: A constraint-based account of linear precedence. In: Proceedings of ACL 2001, Toulouse/FRA (2001)
Sadock, J.M.: Autolexical Syntax. University of Chicago Press, Chicago (1991)
Jackendoff, R.: Foundations of Language. Oxford University Press, Oxford (2002)
Bresnan, J., Kaplan, R.: Lexical-functional grammar: A formal system for grammatical representation. In: Bresnan, J. (ed.) The Mental Representation of Grammatical Relations, pp. 173–281. The MIT Press, Cambridge/USA (1982)
Mel’čuk, I.: Dependency Syntax: Theory and Practice. State Univ. Press of New York, Albany/USA (1988)
Pollard, C., Sag, I.A.: Head-Driven Phrase Structure Grammar. University of Chicago Press, Chicago/USA (1994)
Debusmann, R., Duchier, D., Koller, A., Kuhlmann, M., Smolka, G., Thater, S.: A relational syntax-semantics interface based on dependency grammar. In: Proceedings of COLING (2004)
Trujillo, I.A.: Lexicalist Machine Translation of Spatial Prepositions. PhD thesis, University of Cambridge, Cambridge/USA (1995)
Smolka, G.: The Oz Programming Model. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 324–343. Springer, Berlin (1995)
Mozart Consortium: The Mozart-Oz website (2004), http://www.mozart-oz.org/
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
Debusmann, R., Duchier, D., Kuhlmann, M. (2005). Multi-dimensional Graph Configuration for Natural Language Processing. In: Christiansen, H., Skadhauge, P.R., Villadsen, J. (eds) Constraint Solving and Language Processing. CSLP 2004. Lecture Notes in Computer Science(), vol 3438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424574_7
Download citation
DOI: https://doi.org/10.1007/11424574_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26165-0
Online ISBN: 978-3-540-31928-3
eBook Packages: Computer ScienceComputer Science (R0)