@misc{Rose:xxxx,
  added-at = {2007-12-14T02:46:01.000+0100},
  author = {Ros{\'e}, Carolyn Penstein and Lavie, Alon},
  biburl = {http://www.bibsonomy.org/bibtex/29188151c7e44f57783d6eeb3051e1a94/diego_ma},
  howpublished = {Rose's homepage},
  interhash = {0d6657be8dd37647196ef1a1f151a428},
  intrahash = {9188151c7e44f57783d6eeb3051e1a94},
  keywords = {robust_parsing},
  timestamp = {2007-12-14T02:46:01.000+0100},
  title = {An Efficient Distribution of Labor in a Two Stage Robust Interpretation Process},
  year = {XXXX}
}

@phdthesis{Rose:1997,
  added-at = {2007-12-14T02:46:00.000+0100},
  author = {Ros{\'e}, Carolyn Penstein},
  biburl = {http://www.bibsonomy.org/bibtex/2aabbd1d1fe9408cbe006f86d12ad87ff/diego_ma},
  interhash = {1c6d594cc662383f9375007df880fbf2},
  intrahash = {aabbd1d1fe9408cbe006f86d12ad87ff},
  keywords = {robust_parsing},
  school = {Carnegie Mellon University},
  timestamp = {2007-12-14T02:46:00.000+0100},
  title = {Robust Interactive Dialogue Interpretation},
  year = 1997
}

@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}
}

@inproceedings{Menzel:1998,
  added-at = {2007-12-14T02:43:17.000+0100},
  address = {Montreal, Canada},
  author = {Menzel, Wolfgang and Schr{\"o}der, Ingo},
  biburl = {http://www.bibsonomy.org/bibtex/290aceb6dd29d718bc4d76a1ea66ada5d/diego_ma},
  booktitle = {Proc. Coling-ACL'98 Workshop on Processing of Dependency Grammars},
  interhash = {2b7ed5c812ab8592ca90bcd6911c6ccd},
  intrahash = {90aceb6dd29d718bc4d76a1ea66ada5d},
  keywords = {DG robust_parsing},
  pages = {78-87},
  timestamp = {2007-12-14T02:43:17.000+0100},
  title = {Decision Procedures for Dependency Parsing Using Graded Constraints},
  url = {http://nats-www.informatik.uni-hamburg.de/{\~{}}wolfgang},
  year = 1998
}

@phdthesis{Lavie:1996,
  added-at = {2007-12-14T02:42:05.000+0100},
  address = {Pittsburgh, PA},
  author = {Lavie, Alon},
  biburl = {http://www.bibsonomy.org/bibtex/240e76210bb2738b5b8c17c63b40d9805/diego_ma},
  howpublished = {Technical Report CMU-CS-96-126},
  interhash = {0b7d3aa466e8cfd30d3bf7807aad4908},
  intrahash = {40e76210bb2738b5b8c17c63b40d9805},
  keywords = {robust_parsing},
  school = {Carnegie Mellon University},
  timestamp = {2007-12-14T02:42:05.000+0100},
  title = {GLR*: A robust grammar-focused parser for spontaneously spoken language},
  year = 1996
}

@misc{Lavie:xxxx,
  added-at = {2007-12-14T02:42:04.000+0100},
  author = {Lavie, Alon},
  biburl = {http://www.bibsonomy.org/bibtex/2210c6368e3a08c4ad0d93cc1fbc561f1/diego_ma},
  howpublished = {Alon Lavie's homepage?},
  interhash = {55bf08b02232cc9c614a2bee854b1e0c},
  intrahash = {210c6368e3a08c4ad0d93cc1fbc561f1},
  keywords = {robust_parsing},
  timestamp = {2007-12-14T02:42:04.000+0100},
  title = {GLR*: A robust parser for spontaneously spoken language},
  year = {XXXX}
}

@techreport{Grinberg:1995,
  added-at = {2007-12-14T02:39:36.000+0100},
  author = {Grinberg, Dennis and Lafferty, John and Sleator, Daniel},
  biburl = {http://www.bibsonomy.org/bibtex/2c2cbc595f64f6dc0345e93977e003ecc/diego_ma},
  institution = {Carnegie Mellon University},
  interhash = {a90ff69c29a019185c3f57a0b2bc284d},
  intrahash = {c2cbc595f64f6dc0345e93977e003ecc},
  keywords = {link_grammar robust_parsing},
  note = {Available at \myurl{http://bobo.link.cs.cmu.edu/grammar/html/bibliography.html}},
  number = {CMU-CS-95-125},
  timestamp = {2007-12-14T02:39:36.000+0100},
  title = {A Robust Parsing Algorithm for Link Grammars},
  url = {http://bobo.link.cs.cmu.edu/grammar/html/bibliography.html},
  year = 1995
}

@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
}

@inproceedings{Ait:1997,
  abstract = {This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at the sentence level in an incremental way, depending on the contextual information available at a given stage. This approach overcomes the inefficiency of previous fully reductionist constraint-based systems, while maintaining broad coverage and linguistic granularity. The implementation relies on a sequence of networks built with the replace operator. Given the high level of modularity, the core grammar is easily augmented with corpus-specific sub-grammars. The current system is implemented for French and is being expanded to new languages.},
  added-at = {2007-12-14T02:35:39.000+0100},
  address = {Washington},
  author = {A{\"\i}t-Mokhtar, Salah and Chanod, Jean-Pierre},
  biburl = {http://www.bibsonomy.org/bibtex/2fceef20ad1ff90c4b63e51b3d20cd07e/diego_ma},
  booktitle = {Proc. Applied Natural Language Processing},
  interhash = {b1bae85df1c5cb859bbbafbc70875c12},
  intrahash = {fceef20ad1ff90c4b63e51b3d20cd07e},
  keywords = {shallow_parsing robust_parsing},
  timestamp = {2007-12-14T02:35:39.000+0100},
  title = {Incremental Finite-State Parsing},
  year = 1997
}

@inproceedings{Atserias:2001,
  abstract = {This work explores a new robust approach for Semantic Parsing of unrestricted texts. Our approach considers Semantic Parsing as a Consistent Labelling Problem (CLP), allowing the integration of several knowledge types (syntactic and semantic) obtained from different sources (linguistic and statistic). The current implementation obtains 95\% accuracy in model identification and 72\% in case-role filling.},
  added-at = {2007-12-14T02:35:37.000+0100},
  author = {Atserias, Jordi and Padr{\'o}, Llu{\'\i}s and Rigau, German},
  biburl = {http://www.bibsonomy.org/bibtex/24ea0c4e4133992911ca9e67b51f866a4/diego_ma},
  interhash = {96358f96e9412d27e5aa0188526c7a0a},
  intrahash = {4ea0c4e4133992911ca9e67b51f866a4},
  keywords = {NLP robust_parsing},
  note = {Also available at arXiv:cs.CL/0109023},
  timestamp = {2007-12-14T02:35:37.000+0100},
  title = {Integrating Multiple Knowledge Sources for Robust Semantic Parsing},
  year = 2001
}