@incollection{Morawietz:2002,
  abstract = {In this paper, parsing as deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based (chart) parsers. Extending the proposal in Shieber (1995) which provides a meta interpreter for several deduction systems, we show how to directly realize the inference rules for chart parsers as Constraint Handling Rules ({Fr\"{u}hwirth}, 1998) by viewing the items of a conventional chart parser as constraints and the constraint base as a chart. This allows the direct use of the constraint resolution process to parse sentences in diverse natural language formalisms such as minimalist grammars (Stabler, 1997; Stabler, 2001) or property grammars (Blache, 2000; Balfourier et al., 2002).},
  added-at = {2007-12-14T02:44:13.000+0100},
  author = {Morawietz, Frank and Blache, Philippe},
  biburl = {http://www.bibsonomy.org/bibtex/2348569bda05ddec27946b010eaf281a2/diego_ma},
  booktitle = {Theory and Practice of Logic Programming},
  interhash = {e73e8ff57d9e960b6c29027699fdfadd},
  intrahash = {348569bda05ddec27946b010eaf281a2},
  keywords = {costraint_programming robust_parsing prolog property_grammar},
  timestamp = {2007-12-14T02:44:13.000+0100},
  title = {Parsing Natural Languages with {CHR}},
  url = {http://tcl.sfs.uni-tuebingen.de/\~{}frank/papers/abstracts/tplp.html},
  year = {Submitted}
}

@techreport{Blache:2000b,
  abstract = {Most of modern linguistic theories rely on the notion of constraints. However, only few applications try to implement the parsing process directly with constraint programming: in most cases, constraints are interpreted in a passive sense, the parsing itself being no different to that of classical derivational approaches...},
  added-at = {2007-12-14T02:36:11.000+0100},
  author = {Blache, Philippe and Morawietz, Frank},
  biburl = {http://www.bibsonomy.org/bibtex/2a114f15ff339338377fce71287b0b38f/diego_ma},
  institution = {LPL},
  interhash = {028dafee4be9bc4912b4fae5f348ed5d},
  intrahash = {a114f15ff339338377fce71287b0b38f},
  keywords = {property_grammar},
  timestamp = {2007-12-14T02:36:11.000+0100},
  title = {A Non-Generative Constraint-Based Formalism},
  url = {http://www.lpl.univ-aix.fr/~blache/publis.html},
  year = 2000
}

@inproceedings{Blache:2006,
  abstract = {We propose in this paper a method for quantifying sentence grammaticality. The approach based on Property Grammars, a constraint-based syntactic formalism, makes it possible to evaluate a grammaticality index for any kind of sentence, including ill-formed ones. We compare on a sample of sentences the grammaticality indices obtained from PG formalism and the acceptability judgements measured by means of a psycholinguistic analysis. The results show that the derived grammaticality index is a fairly good tracer of acceptability scores.},
  added-at = {2007-12-14T02:36:10.000+0100},
  author = {Blache, Philippe and Hemforth, Barbara and Rauzy, St\'{e}phane},
  biburl = {http://www.bibsonomy.org/bibtex/21efbed9bf5e631cb29663be6a3f10d43/diego_ma},
  booktitle = {Proceedings ACL 2006},
  interhash = {67477751f5e2e2197cd4b23e809fa95d},
  intrahash = {1efbed9bf5e631cb29663be6a3f10d43},
  keywords = {property_grammar},
  timestamp = {2007-12-14T02:36:10.000+0100},
  title = {Acceptability Prediction by Means of Grammaticality Quantification},
  year = 2006
}

@incollection{Blache:2002,
  abstract = {We present in this paper a constraint-based account of robust parsing. More precisely, we propose a parsing technique relying on constraint satisfaction and its implementation by means of graphs...},
  added-at = {2007-12-14T02:36:09.000+0100},
  author = {Blache, Philippe and Azylay, David-Olivier},
  biburl = {http://www.bibsonomy.org/bibtex/2041c635f1a26dfd2ec6827394eaa39d1/diego_ma},
  booktitle = {Intelligent Text Processing and Computational Linguistics},
  editor = {Gelbukh, A.},
  interhash = {10413280bc7e897768962c75c3fe9a1e},
  intrahash = {041c635f1a26dfd2ec6827394eaa39d1},
  keywords = {robust_parsing property_grammar},
  publisher = {Springer Verlag},
  series = {Lecture Notes in Computer Science},
  timestamp = {2007-12-14T02:36:09.000+0100},
  title = {Parsing Ill-formed Inputs with Constraint Graphs },
  url = {http://www.lpl.univ-aix.fr/~blache/publis.html},
  year = 2002
}

@incollection{Blache:2000,
  abstract = {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...},
  added-at = {2007-12-14T02:36:08.000+0100},
  author = {Blache, Philippe},
  biburl = {http://www.bibsonomy.org/bibtex/2bdf5fc52cfaafa710ed3c58f744c1063/diego_ma},
  booktitle = {Natural Language Processing},
  editor = {Christodoulakis, D.},
  interhash = {9d81751f96a6133894c88798d02bca86},
  intrahash = {bdf5fc52cfaafa710ed3c58f744c1063},
  keywords = {constraint_programming property_grammar},
  publisher = {Springer Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  timestamp = {2007-12-14T02:36:08.000+0100},
  title = {Constraints, Linguistic Theories and Natural Language Processing},
  url = {http://www.lpl.univ-aix.fr/~blache/publis.html},
  year = 2000
}