BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:diego_ma

The blue social bookmark and publication sharing system.

entry of diego_ma:

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Constraint Programming Technology in Computational Linguistics

by: Alexander Koller, and Joachim Niehren

In: Proc. LLC8CSLI (1999) .

Resources (URL, PDF, PS...)

URL:	http://www.coli.uni-sb.de/~koller/papers/cpcl.html

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 combinatoric 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.

BibTeX record

@inproceedings{Koller:1999,
  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 combinatoric 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.},
  added-at = {2007-12-14T02:41:42.000+0100},
  author = {Koller, Alexander and Niehren, Joachim},
  biburl = {http://www.bibsonomy.org/bibtex/274a0d051119096eadc7c6ccda5f80e8a/diego_ma},
  booktitle = {Proc. LLC8},
  editor = {Beaver, David and van Benthem, Johan and di Luzio, P. Scotto},
  interhash = {e739dcb18e3df0fab94df120536391e7},
  intrahash = {74a0d051119096eadc7c6ccda5f80e8a},
  keywords = {underspecification constraint_programming DG},
  publisher = {CSLI},
  timestamp = {2007-12-14T02:41:42.000+0100},
  title = {Constraint Programming Technology in Computational Linguistics},
  url = {http://www.coli.uni-sb.de/~koller/papers/cpcl.html},
  year = 1999
}

Endnote record

%0 Conference Paper
%1 Koller:1999
%A Koller, Alexander
%A Niehren, Joachim
%B Proc. LLC8
%D 1999
%E Beaver, David
%E van Benthem, Johan
%E di Luzio, P. Scotto
%I CSLI
%K 
%T Constraint Programming Technology in Computational Linguistics
%U http://www.coli.uni-sb.de/~koller/papers/cpcl.html
%X 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 combinatoric 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.

BibSonomy :: publication ::

Constraint Programming Technology in Computational Linguistics

Resources (URL, PDF, PS...)

Abstract

BibTeX record

Endnote record