SciDok

Eingang zum Volltext in SciDok

Hinweis zum Urheberrecht

InBuch (Kapitel / Teil einer Monographie) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-2883
URL: http://scidok.sulb.uni-saarland.de/volltexte/2004/288/


Constraint programming in computational linguistics

Koller, Alexander ; Niehren, Joachim

Quelle: (2002) Barker-Plummer, Dave (ed.): Words, proofs and diagrams.- Stanford: CSLI Publ., 2002. (CSLI Lecture Notes) pp. 95-123
pdf-Format:
Dokument 1.pdf (315 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
SWD-Schlagwörter: Linguistische Datenverarbeitung ; Constraint-Programmierung
Institut 1: Fachrichtung 4.7 - Allgemeine Linguistik
Institut 2: Fachrichtung 6.2 - Informatik
DDC-Sachgruppe: Informatik
Dokumentart: InBuch (Kapitel / Teil einer Monographie)
Sprache: Englisch
Erstellungsjahr: 2002
Publikationsdatum: 06.07.2004
Kurzfassung auf Englisch: 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.

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English