To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

From TAG to HOL Represent… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

From TAG to HOL Representations of AMRs via ACGs

Conference paper
Authors Rasmus Blanck
Aleksandre Maskharashvili
Published in Proceedings of the Symposium on Logic and Algorithms in Computational Linguistics 2018. Stockholm, 28–31 August 2018 / Krasimir Angelov, Kristina Liefke, Roussanka Loukanova, Michael Moortgat, Satoshi Tojo (eds.)
Publisher Stockholm University, DiVA portal for digital publications
Place of publication Stockholm
Publication year 2018
Published at Department of Philosophy, Linguistics and Theory of Science
Language en
Keywords Abstract Meaning Representations, Abstract Categorial Grammars, Tree Adjoining Grammars, Higher order logic, Montague semantics, neo-Davidsonian event semantics, natural language generation, natural language parsing
Subject categories Computational linguistics, Linguistics


We investigate the possibility of constructing an Abstract Categorial Grammar (ACG) that relates Tree Adjoining Grammar (TAG) and Higher Order Logic (HOL) formulas encoding Abstract Meaning Representations (AMRs). We also propose another ACG that relates TAG and HOL formulas expressing the 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 modeling AMR for free.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?