Umeå University's logo

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
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0001-8503-0118
University of Edinburgh, United Kingdom.
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0001-7349-7693
University of Padova, Italy.
2021 (English)In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 870, p. 3-28Article in journal (Refereed) Published
Abstract [en]

We develop a finite-state transducer for translating unranked trees into general graphs. This work is motivated by recent progress in semantic parsing for natural language, where sentences are first mapped into tree-shaped syntactic representations, and then these trees are translated into graph semantic representations. We investigate formal properties of our tree-to-graph transducers and develop a polynomial time algorithm for translating a weighted language of input trees into a packed representation, from which best-score graphs can be efficiently recovered.

Place, publisher, year, edition, pages
Elsevier, 2021. Vol. 870, p. 3-28
Keywords [en]
Semantic graph, Semantic parsing, Tree-to-graph transduction, Weighted automaton
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-213424DOI: 10.1016/j.tcs.2020.12.012Scopus ID: 2-s2.0-85099124542OAI: oai:DiVA.org:umu-213424DiVA, id: diva2:1791352
Available from: 2023-08-25 Created: 2023-08-25 Last updated: 2023-08-25Bibliographically approved

Open Access in DiVA

fulltext(740 kB)50 downloads
File information
File name FULLTEXT01.pdfFile size 740 kBChecksum SHA-512
03692628f4de03880715f58523f1024fc1de578d911f4a39349072b64a50aa281cfa8652caac0a5337eec3ccd3eb672a28830c079308de9a8a35abcb8b7943f7
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Björklund, JohannaDrewes, Frank

Search in DiVA

By author/editor
Björklund, JohannaDrewes, Frank
By organisation
Department of Computing Science
In the same journal
Theoretical Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 54 downloads
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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 149 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