Skip to Main content Skip to Navigation
New interface
Book sections

Constraint Programming in Computational Linguistics

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.
Document type :
Book sections
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:13:17 PM
Last modification on : Tuesday, October 31, 2017 - 2:22:18 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:18:34 AM


Files produced by the author(s)


  • HAL Id : inria-00536829, version 1


Alexander Koller, Joachim Niehren. Constraint Programming in Computational Linguistics. Dave Barker-Plummer and David I. Beaver and Johan van Benthem and Patrick Scotto di Luzio. Words, Proofs, and Dialog, 141, CSLI Press, pp.95-122, 2002. ⟨inria-00536829⟩



Record views


Files downloads