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. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1007/11424574_7 | CSLP |
Keywords | Field | DocType |
multi-dimensional graph configuration,configuration problem,extensible dependency grammar,natural language processing,constraint satisfaction problem,dimensional configuration problem,linguistic configuration problem,linguistic resource,art constraint programming technology,linguistic application,computational linguistics,lexicalised multi,dependency grammar,syntactic analysis | Constraint satisfaction,Programming language,Computer science,Lexical item,Computational linguistics,Constraint programming,Constraint satisfaction problem,Dependency grammar,Grammar,Natural language,Natural language processing,Artificial intelligence | Conference |
Volume | ISSN | ISBN |
3438 | 0302-9743 | 3-540-26165-6 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ralph Debusmann | 1 | 64 | 8.63 |
Denys Duchier | 2 | 181 | 23.61 |
Marco Kuhlmann | 3 | 309 | 23.06 |