BibSonomy publications for /user/diego_ma/constraint_programmingFri Dec 14 02:45:19 CET 2007Berlin HeidelbergProceedings LACL 200117-43Lecture Notes in Artificial IntelligenceOn the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks2001grammar constraint_programming Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES)an d model-theoretic syntax (MTS). They are based on very different mathematics. GES developed in the 1950s out of Post's work on the syntactic side of logic. MTS arose somewhat later out of the semantic side of logic. We identify some distinguishing theoretical features of these frameworks, relating to cardinality of the set of expressions, size of individual expressions, and �transderivational constraints�. We then turn to three kinds of linguistic phenomena: partial grammaticality, the syntactic properties of expression fragments, and the fact that the lexicon of any natural language is in constant flux, and conclude that MTS has some major advantages for linguistic description that have been overlooked. We briefly consider the issue of what natural languages in MTS terms, and touch on implications for parsing and acquisition.Fri Dec 14 02:43:03 CET 2007Proceedings of the 28th conference on Association for Computational Linguistics31--38Structural disambiguation with constraint propagation1990constraint_programming underspecification Fri Dec 14 02:41:42 CET 2007Proc. LLC8Constraint Programming Technology in Computational Linguistics1999underspecification constraint_programming DG 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.Fri Dec 14 02:39:05 CET 2007The Journal of Logic Programming1-395-138Theory and Practice of Constraint Handling Rules371994constraint_programming Constraing Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints...Fri Dec 14 02:37:23 CET 2007\myurl{http://www.dat.ruc.dk/\~{}henning/chrg/CHRGusersGuide.html}NovemberVisited 28 August 2003User's Guide to CHR Grammars2002constraint_programming grammar prolog This document explains how to use CHRG which is a grammar notation implemented on top of the CHR language of Constraint Handling Rules. CHR is an extension to Prolog with committed choice multiple-headed rules. You need to have a recent version of SICSTUS Prolog installed on your computer that supports the CHR library.Fri Dec 14 02:37:22 CET 2007Submitted to journal Theory and Practice of Logic ProgrammingCHR Grammmars2002constraint_programming grammar prolog A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena...Fri Dec 14 02:36:08 CET 2007Natural Language ProcessingLecture Notes in Artificial IntelligenceConstraints, Linguistic Theories and Natural Language Processing2000constraint_programming property_grammar The notion of constraints is generally used in modern linguistics (in particular in syntax and phonology) for representing properties the an object must satisfy. Constraints can be general (or universal), valid for different languages, or at the opposite very specific, representing for example the variability of a given language. In all cases, the idea consists of stipulating properties ruling out structures which don't belong to the language...