From Tree Adjoining Grammars to Higher Order Representations of Abstract Meaning Representations via Abstract Categorial Grammars

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We construct an Abstract Categorial Grammar (ACG) that interrelates Tree Adjoining Grammar (TAG) and Higher Order Logic (HOL) formulas encoding Abstract Meaning Representations (AMRs). We also propose another ACG that interrelates TAG and HOL formulas expressing neo-Davidsonian event semantics. Both of these encodings are based on the already existing ACG encoding of the syntax–semantics interface where TAG derivations are interpreted as HOL formulas representing Montague semantics. In particular, both of these encodings share the same abstract language coming from the ACG encoding of TAG with Montague semantics, which is second-order. For second-order ACGs, problems of parsing and generation are known to be of polynomial complexity. Thus we get the natural language generation and parsing with TAGs and HOL formulas modelling AMRs for free.

Original languageEnglish (US)
Title of host publicationLogic and Algorithms in Computational Linguistics 2018 (LACompLing2018)
EditorsRoussanka Loukanova
PublisherSpringer
Pages67-93
Number of pages27
ISBN (Electronic)9783030300777
ISBN (Print)9783030300760, 9783030300791
DOIs
StatePublished - 2020
Externally publishedYes
EventSymposium on Logic and Algorithms in Computational Linguistics, LACompLing 2018 - Stockhalm, Sweden
Duration: Aug 28 2018Aug 31 2018

Publication series

NameStudies in Computational Intelligence
Volume860
ISSN (Print)1860-949X
ISSN (Electronic)1860-9503

Conference

ConferenceSymposium on Logic and Algorithms in Computational Linguistics, LACompLing 2018
Country/TerritorySweden
CityStockhalm
Period8/28/188/31/18

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'From Tree Adjoining Grammars to Higher Order Representations of Abstract Meaning Representations via Abstract Categorial Grammars'. Together they form a unique fingerprint.

Cite this