A constrained graph algebra for semantic parsing with AMRs

Jonas Groschwitz, Meaghan Fowlie, Mark Johnson, Alexander Koller

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

When learning grammars that map from sentences to abstract meaning representations (AMRs), one faces the challenge that an AMR can be described in a huge number of different ways using traditional graph algebras. We introduce a new algebra for building graphs from smaller parts, using linguistically motivated operations for combining a head with a complement or a modifier. Using this algebra, we can reduce the number of analyses per AMR graph dramatically; at the same time, we show that challenging linguistic constructions can still be handled correctly.
Original languageEnglish
Title of host publicationIWCS 2017 - 12th International Conference on Computational Semantics - Long papers
Publication statusPublished - 2017
Externally publishedYes

Publication series

Name12th International Conference on Computational Semantics (IWCS 2017)
PublisherAssociation for Computational Linguistics (ACL)

Fingerprint

Dive into the research topics of 'A constrained graph algebra for semantic parsing with AMRs'. Together they form a unique fingerprint.

Cite this