umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Approximating Parikh images for generating deterministic graph parsers
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Foundations of Language Processing)ORCID iD: 0000-0001-7349-7693
2016 (English)In: Software Technologies: Applications and Foundations: STAF 2016 Collocated Workshops: DataMod, GCM, HOFM, MELO, SEMS, VeryComp, Vienna Austria, July 4-8, 2016, Revised Selected Papers / [ed] Paolo Milazzo, Dániel Varró, Manuel Wimmer, Springer, 2016, p. 112-128Conference paper, Published paper (Refereed)
Abstract [en]

The Parikh image of a word abstracts from the order of its letters. Parikh’s famous theorem states that the set of Parikh images of a context-free string language forms a semilinear set that can be effectively computed from its grammar. In this paper we study the computation of Parikh images for graph grammars defined by contextual hyperedge replacement (CHR). Our motivation is to generate efficient predictive top-down (PTD) parsers for a subclass of CHR grammars. We illustrate this by describing the subtask that identifies the nodes of the input graph that parsing starts with.

Place, publisher, year, edition, pages
Springer, 2016. p. 112-128
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 9946
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-121079DOI: 10.1007/978-3-319-50230-4_9ISI: 000406381300009ISBN: 978-3-319-50230-4 (electronic)ISBN: 978-3-319-50229-8 (print)OAI: oai:DiVA.org:umu-121079DiVA, id: diva2:930933
Conference
STAF 2016 Collocated Workshops: DataMod, GCM, HOFM, MELO, SEMS, VeryComp. Vienna, Austria, July 4-8, 2016
Available from: 2016-05-25 Created: 2016-05-25 Last updated: 2018-03-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 146 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf