Multi-dimensional graph configuration for natural language processing

Authors:
Ralph Debusmann;Denys Duchier;Marco Kuhlmann
Affiliations:
Programming Systems Lab, Saarland University, Saarbrücken, Germany;Équipe Calligramme, LORIA, Nancy, France;Programming Systems Lab, Saarland University, Saarbrücken, Germany
Venue:
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Year:
2004

Citing 5
Cited 0

The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Topological dependency trees: a constraint-based account of linear precedence

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generation as dependency parsing

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Towards a generic model of configuraton tasks

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.