BibSonomy publications for /user/diego_ma/robust_parsingFri Dec 14 02:46:01 CET 2007Rose's homepageAn Efficient Distribution of Labor in a Two Stage Robust Interpretation ProcessXXXXrobust_parsing Fri Dec 14 02:46:00 CET 2007Robust Interactive Dialogue Interpretation1997robust_parsing Fri Dec 14 02:44:13 CET 2007Theory and Practice of Logic ProgrammingParsing Natural Languages with {CHR}Submittedcostraint_programming robust_parsing prolog property_grammar 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).Fri Dec 14 02:43:17 CET 2007Montreal, CanadaProc. Coling-ACL'98 Workshop on Processing of Dependency Grammars78-87Decision Procedures for Dependency Parsing Using Graded Constraints1998DG robust_parsing Fri Dec 14 02:42:05 CET 2007Pittsburgh, PATechnical Report CMU-CS-96-126GLR*: A robust grammar-focused parser for spontaneously spoken language1996robust_parsing Fri Dec 14 02:42:04 CET 2007Alon Lavie's homepage?GLR*: A robust parser for spontaneously spoken languageXXXXrobust_parsing Fri Dec 14 02:39:36 CET 2007Available at \myurl{http://bobo.link.cs.cmu.edu/grammar/html/bibliography.html}CMU-CS-95-125A Robust Parsing Algorithm for Link Grammars1995link_grammar robust_parsing Fri Dec 14 02:36:09 CET 2007Intelligent Text Processing and Computational LinguisticsLecture Notes in Computer ScienceParsing Ill-formed Inputs with Constraint Graphs 2002robust_parsing property_grammar 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...Fri Dec 14 02:35:39 CET 2007WashingtonProc. Applied Natural Language ProcessingIncremental Finite-State Parsing1997shallow_parsing robust_parsing 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.Fri Dec 14 02:35:37 CET 2007Also available at arXiv:cs.CL/0109023Integrating Multiple Knowledge Sources for Robust Semantic Parsing2001NLP robust_parsing 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.