umu.sePublications
Change search
ReferencesLink to record
Permanent link

Direct link
Between a Rock and a Hard Place: Parsing for Hyperege Replacement DAG Grammars
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0001-7349-7693
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)
2016 (English)In: Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016) / [ed] A.H. Dediu, J. Janoušek, C. Martín-Vide, and B. Truthe, Springer Publishing Company, 2016, Vol. 9618, 521-532 p.Conference paper (Refereed)
Abstract [en]

Motivated by applications in natural language processing, we study the uniform membership problem for hyperedge-replacement grammars that generate directed acyclic graphs. Our major result is a low-degree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions by two different NP-completeness results.

Place, publisher, year, edition, pages
Springer Publishing Company, 2016. Vol. 9618, 521-532 p.
Series
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 9618
Keyword [en]
Graph grammar, Hyperedge replacement, Abstract meaning representation, DAG grammar, Uniform membership problem, Parsing
National Category
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-111984DOI: 10.1007/978-3-319-30000-9_40ISI: 000378745100045ISBN: 978-3-319-30000-9ISBN: 978-3-319-29999-0OAI: oai:DiVA.org:umu-111984DiVA: diva2:874860
Conference
10th International Conference on Language and Automata Theory and Applications (LATA 2016), Prague, Czech Republic, March 14-18, 2016
Available from: 2015-11-29 Created: 2015-11-29 Last updated: 2016-08-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Björklund, HenrikDrewes, FrankEricson, Petter
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 108 hits
ReferencesLink to record
Permanent link

Direct link