TY - GEN
T1 - Non-canonical coordination in the transformational approach
AU - Kiselyov, Oleg
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - Recently introduced Transformational Semantics (TS) formalizes, restraints and makes rigorous the transformational approach epitomized by QR and Transformational Grammars: deriving a meaning (in the form of a logical formula or a logical form) by a series of transformations from a suitably abstract (tecto-) form of a sentence. TS generalizes various ‘monad’ or ‘continuation-based’ computational approaches, abstracting away irrelevant details (such as monads, etc.) while overcoming their rigidity and brittleness. Unlike QR, each transformation in TS is rigorously and precisely defined, typed, and deterministic. The restraints of TS and the sparsity of the choice points (in the order of applying the deterministic transformation steps) make it easier to derive negative predictions and control over-generation. We apply TS to right-node raising (RNR), gapping and other instances of non-constituent coordination. Our analyses straightforwardly represent the intuition that coordinated phrases must in some sense be ‘parallel’, with a matching structure. Coordinated material is not necessarily constituent – even ‘below the surface’ – and we do not pretend it is. We answer the Kubota, Levine and Moot challenge (the KLM problem) of analyzing RNR and gapping without directional types, yet avoiding massive over-generation. We thus formalize the old idea of ‘coordination reduction’ and show how to make it work for generalized quantifiers.
AB - Recently introduced Transformational Semantics (TS) formalizes, restraints and makes rigorous the transformational approach epitomized by QR and Transformational Grammars: deriving a meaning (in the form of a logical formula or a logical form) by a series of transformations from a suitably abstract (tecto-) form of a sentence. TS generalizes various ‘monad’ or ‘continuation-based’ computational approaches, abstracting away irrelevant details (such as monads, etc.) while overcoming their rigidity and brittleness. Unlike QR, each transformation in TS is rigorously and precisely defined, typed, and deterministic. The restraints of TS and the sparsity of the choice points (in the order of applying the deterministic transformation steps) make it easier to derive negative predictions and control over-generation. We apply TS to right-node raising (RNR), gapping and other instances of non-constituent coordination. Our analyses straightforwardly represent the intuition that coordinated phrases must in some sense be ‘parallel’, with a matching structure. Coordinated material is not necessarily constituent – even ‘below the surface’ – and we do not pretend it is. We answer the Kubota, Levine and Moot challenge (the KLM problem) of analyzing RNR and gapping without directional types, yet avoiding massive over-generation. We thus formalize the old idea of ‘coordination reduction’ and show how to make it work for generalized quantifiers.
UR - http://www.scopus.com/inward/record.url?scp=85026367019&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85026367019&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-61572-1_3
DO - 10.1007/978-3-319-61572-1_3
M3 - Conference contribution
AN - SCOPUS:85026367019
SN - 9783319615714
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 33
EP - 44
BT - New Frontiers in Artificial Intelligence - JSAI-isAI 2016 Workshops, LENLS HAT-MASH, AI-Biz, JURISIN and SKL, 2016
A2 - Arai, Sachiyo
A2 - Satoh, Ken
A2 - Bekki, Daisuke
A2 - Kurahashi, Setsuya
A2 - Ohta, Yuiko
PB - Springer Verlag
T2 - 8th JSAI International Symposium on AI, JSAI-isAI 2016
Y2 - 14 November 2016 through 16 November 2016
ER -