Please use this identifier to cite or link to this item:
doi:10.22028/D291-25772
Title: | Constraint programming in computational linguistics |
Author(s): | Koller, Alexander Niehren, Joachim |
Language: | English |
Year of Publication: | 2002 |
OPUS Source: | Barker-Plummer, Dave (ed.): Words, proofs and diagrams.- Stanford: CSLI Publ., 2002. (CSLI Lecture Notes) pp. 95-123 |
SWD key words: | Linguistische Datenverarbeitung ; Constraint-Programmierung |
DDC notations: | 004 Computer science, internet |
Publikation type: | Book Chapter |
Abstract: | Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatorial explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing. |
Link to this record: | urn:nbn:de:bsz:291-scidok-2883 hdl:20.500.11880/25828 http://dx.doi.org/10.22028/D291-25772 |
Date of registration: | 6-Jul-2004 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik P - Sprachwissenschaft und Sprachtechnologie |
Former Department: | bis SS 2016: Fachrichtung 4.7 - Allgemeine Linguistik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.