String Generating Hypergraph Grammars with Word Order Restrictions

Riedl, Martin; Seifert, Sebastian; Fischer, Ingrid

String Generating Hypergraph Grammars with Word Order Restrictions

Files

String_Generating_Hypergraph_Grammars_with_Word_Order_Restrictions.pdf(192.85 KB)

Date

2006

Authors

Riedl, Martin

Seifert, Sebastian

Fischer, Ingrid

Publication type

Contribution to a conference collection

Published in

Graph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006 / Corradini, Andrea et al. (ed.). - Berlin, Heidelberg : Springer, 2006. - (Lecture notes in computer science ; 4178). - pp. 138-152. - ISBN 978-3-540-38870-8

Abstract

Discontinuous constituents and free word order pose constant problems in natural language parsing. String generating hypergraph grammars have been proven useful for handling discontinuous constituents. In this paper we describe a new notation for hypergraph productions that allows on-the-fly interconnection of graph parts with regard to user-defined constraints. These constraints handle the order of nodes within the string hypergraph. The HyperEarley parser for string generating hypergraph grammars [1] is adapted to the new formalism. A German example is used for the explanation of the new notation and algorithms.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

RIEDL, Martin, Sebastian SEIFERT, Ingrid FISCHER, 2006. String Generating Hypergraph Grammars with Word Order Restrictions. In: CORRADINI, Andrea, ed. and others. Graph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006. Berlin, Heidelberg:Springer, pp. 138-152. ISBN 978-3-540-38870-8

BibTex

@inproceedings{Riedl2006Strin-5426,
  year={2006},
  title={String Generating Hypergraph Grammars with Word Order Restrictions},
  number={4178},
  isbn={978-3-540-38870-8},
  publisher={Springer},
  address={Berlin, Heidelberg},
  series={Lecture notes in computer science},
  booktitle={Graph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006},
  pages={138--152},
  editor={Corradini, Andrea},
  author={Riedl, Martin and Seifert, Sebastian and Fischer, Ingrid}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5426">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5426"/>
    <dc:creator>Riedl, Martin</dc:creator>
    <dcterms:title>String Generating Hypergraph Grammars with Word Order Restrictions</dcterms:title>
    <dc:format>application/pdf</dc:format>
    <dc:contributor>Riedl, Martin</dc:contributor>
    <dc:contributor>Fischer, Ingrid</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:17Z</dc:date>
    <dc:creator>Fischer, Ingrid</dc:creator>
    <dcterms:bibliographicCitation>First. publ. in: Lecture notes in computer science, No. 4178 (2006), pp. 138-152</dcterms:bibliographicCitation>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5426/1/String_Generating_Hypergraph_Grammars_with_Word_Order_Restrictions.pdf"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Seifert, Sebastian</dc:contributor>
    <dcterms:issued>2006</dcterms:issued>
    <dcterms:abstract xml:lang="eng">Discontinuous constituents and free word order pose constant problems in natural language parsing. String generating hypergraph grammars have been proven useful for handling discontinuous constituents. In this paper we describe a new notation for hypergraph productions that allows on-the-fly interconnection of graph parts with regard to user-defined constraints. These constraints handle the order of nodes within the string hypergraph. The HyperEarley parser for string generating hypergraph grammars [1] is adapted to the new formalism. A German example is used for the explanation of the new notation and algorithms.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5426/1/String_Generating_Hypergraph_Grammars_with_Word_Order_Restrictions.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:17Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Seifert, Sebastian</dc:creator>
  </rdf:Description>
</rdf:RDF>