TY - GEN
T1 - From Tree Adjoining Grammars to Higher Order Representations of Abstract Meaning Representations via Abstract Categorial Grammars
AU - Blanck, Rasmus
AU - Maskharashvili, Aleksandre
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85075573051&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85075573051&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-30077-7_4
DO - 10.1007/978-3-030-30077-7_4
M3 - Conference contribution
AN - SCOPUS:85075573051
SN - 9783030300760
SN - 9783030300791
T3 - Studies in Computational Intelligence
SP - 67
EP - 93
BT - Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018)
A2 - Loukanova, Roussanka
PB - Springer
T2 - Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2018
Y2 - 28 August 2018 through 31 August 2018
ER -