String Generating Hypergraph Grammars with Word Order Restrictions

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:c351f39322bc963695efc35ffe53f991

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

@inproceedings{Riedl2006Strin-5426, title={String Generating Hypergraph Grammars with Word Order Restrictions}, year={2006}, number={4178}, isbn={978-3-540-38870-8}, address={Berlin, Heidelberg}, publisher={Springer}, 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 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/rdf/resource/123456789/5426"> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5426/1/String_Generating_Hypergraph_Grammars_with_Word_Order_Restrictions.pdf"/> <dc:rights>deposit-license</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Riedl, Martin</dc:contributor> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5426"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:17Z</dcterms:available> <dc:creator>Fischer, Ingrid</dc:creator> <dcterms:title>String Generating Hypergraph Grammars with Word Order Restrictions</dcterms:title> <dc:creator>Seifert, Sebastian</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:bibliographicCitation>First. publ. in: Lecture notes in computer science, No. 4178 (2006), pp. 138-152</dcterms:bibliographicCitation> <dc:contributor>Fischer, Ingrid</dc:contributor> <dc:contributor>Seifert, Sebastian</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:17Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <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> <dc:creator>Riedl, Martin</dc:creator> <dc:format>application/pdf</dc:format> <dcterms:issued>2006</dcterms:issued> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5426/1/String_Generating_Hypergraph_Grammars_with_Word_Order_Restrictions.pdf"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

String_Generating_Hypergraph_Grammars_with_Word_Order_Restrictions.pdf 74

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto