<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/diego_ma/robust_parsing property_grammar"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/diego_ma/robust_parsing property_grammar</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2348569bda05ddec27946b010eaf281a2/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2348569bda05ddec27946b010eaf281a2/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InCollection"/><owl:sameAs rdf:resource="http://tcl.sfs.uni-tuebingen.de/\~{}frank/papers/abstracts/tplp.html"/><swrc:date>Fri Dec 14 02:44:13 CET 2007</swrc:date><swrc:booktitle>Theory and Practice of Logic Programming</swrc:booktitle><swrc:publisher><swrc:Organization swrc:name=" "/></swrc:publisher><swrc:title>Parsing Natural Languages with {CHR}</swrc:title><swrc:year>Submitted</swrc:year><swrc:keywords>costraint_programming robust_parsing prolog property_grammar </swrc:keywords><swrc: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\&#034;{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).</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Frank Morawietz"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Philippe Blache"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2041c635f1a26dfd2ec6827394eaa39d1/diego_ma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2041c635f1a26dfd2ec6827394eaa39d1/diego_ma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InCollection"/><owl:sameAs rdf:resource="http://www.lpl.univ-aix.fr/~blache/publis.html"/><swrc:date>Fri Dec 14 02:36:09 CET 2007</swrc:date><swrc:booktitle>Intelligent Text Processing and Computational Linguistics</swrc:booktitle><swrc:publisher><swrc:Organization swrc:name="Springer Verlag"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>Parsing Ill-formed Inputs with Constraint Graphs </swrc:title><swrc:year>2002</swrc:year><swrc:keywords>robust_parsing property_grammar </swrc:keywords><swrc: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...</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Philippe Blache"/></rdf:_1><rdf:_2><swrc:Person swrc:name="David-Olivier Azylay"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="A. Gelbukh"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description></rdf:RDF>
