To the top

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

Tell a friend about this page
Print version

From Tree Adjoining Gramm… - University of Gothenburg, Sweden Till startsida
Sitemap
To content Read more about how we use cookies on gu.se

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

Chapter in book
Authors Rasmus Blanck
Aleksandre Maskharashvili
Published in Studies in Computational Intelligence
Pages 67-93
ISBN 978-3-030-30076-0
ISSN 1860-949X
Publisher Springer Nature Switzerland AG
Place of publication Cham
Publication year 2020
Published at Department of Philosophy, Linguistics and Theory of Science
Pages 67-93
Language en
Links https://doi.org/10.1007%2F978-3-030...
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

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.

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

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?