umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. (Foundations of Language Processing)ORCID-id: 0000-0001-7349-7693
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. (Foundations of Language Processing)
2017 (Engelska)Ingår i: Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms / [ed] M. Kuhlmann, T. Scheffler, Association for Computational Linguistics, 2017, s. 102-111Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

We show how contextual hyperedge replacement grammars can be used to generate abstract meaning representations (AMRs), and argue that they are more suitable for this purpose than hyperedge replacement grammars. Contextual hyperedge replacement turns out to have two advantages over plain hyperedge replacement: it can completely cover the language of all AMRs over a given domain of concepts, and at the same time its grammars become both smaller and simpler.

Ort, förlag, år, upplaga, sidor
Association for Computational Linguistics, 2017. s. 102-111
Nyckelord [en]
Abstract Meaning Representation, DAG Language, Contextual Hyperedge-Replacement
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:umu:diva-137921OAI: oai:DiVA.org:umu-137921DiVA, id: diva2:1128885
Konferens
13th International Workshop on Tree-Adjoining Grammar and Related Formalisms (TAG+13), Umeå, Sweden, September 4-6, 2017
Tillgänglig från: 2017-07-31 Skapad: 2017-07-31 Senast uppdaterad: 2018-11-29Bibliografiskt granskad
Ingår i avhandling
1. Towards semantic language processing
Öppna denna publikation i ny flik eller fönster >>Towards semantic language processing
2018 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
Alternativ titel[sv]
Mot semantisk språkbearbetning
Abstract [en]

The overall goal of the field of natural language processing is to facilitate the communication between humans and computers, and to help humans with natural language problems such as translation. In this thesis, we focus on semantic language processing. Modelling semantics – the meaning of natural language – requires both a structure to hold the semantic information and a device that can enforce rules on the structure to ensure well-formed semantics while not being too computationally heavy. The devices used in natural language processing are preferably weighted to allow for comparison of the alternative semantic interpretations outputted by a device.

The structure employed here is the abstract meaning representation (AMR). We show that AMRs representing well-formed semantics can be generated while leaving out AMRs that are not semantically well-formed. For this purpose, we use a type of graph grammar called contextual hyperedge replacement grammar (CHRG). Moreover, we argue that a more well-known subclass of CHRG – the hyperedge replacement grammar (HRG) – is not powerful enough for AMR generation. This is due to the limitation of HRG when it comes to handling co-references, which in its turn depends on the fact that HRGs only generate graphs of bounded treewidth.

Furthermore, we also address the N best problem, which is as follows: Given a weighted device, return the N best (here: smallest-weighted, or more intuitively, smallest-errored) structures. Our goal is to solve the N best problem for devices capable of expressing sophisticated forms of semantic representations such as CHRGs. Here, however, we merely take a first step consisting in developing methods for solving the N best problem for weighted tree automata and some types of weighted acyclic hypergraphs.

Ort, förlag, år, upplaga, sidor
Umeå: Department of Computing Science, Umeå University, 2018. s. 16
Serie
Report / UMINF, ISSN 0348-0542 ; 18.12
Nyckelord
Weighted tree automata, abstract meaning representation, contextual hyperedge replacement grammar, hyperedge replacement grammar, semantic modelling, the N best problem
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
datalogi; datorlingvistik
Identifikatorer
urn:nbn:se:umu:diva-153738 (URN)978-91-7601-964-1 (ISBN)
Presentation
2018-12-07, MC413, Umeå, 10:00 (Engelska)
Opponent
Handledare
Tillgänglig från: 2018-11-29 Skapad: 2018-11-28 Senast uppdaterad: 2018-11-29Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

URL

Personposter BETA

Drewes, FrankJonsson, Anna

Sök vidare i DiVA

Av författaren/redaktören
Drewes, FrankJonsson, Anna
Av organisationen
Institutionen för datavetenskap
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 186 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf