2014 | OriginalPaper | Buchkapitel
Representing Anaphora with Dependent Types
verfasst von : Daisuke Bekki
Erschienen in: Logical Aspects of Computational Linguistics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Discourse semantics based on dependent type theory, such as Ranta’s Type Theoretical Grammar, is expected to serve as a proof-theoretic alternative to standard, model-theoretic discourse semantics such as DRT and DPL. Its compositionality, however, with respect to anaphora and presupposition, has been left as an open problem, toward which several different approaches have been proposed. In this paper, I will point out that four problems still remain to be solved in the previous approaches, and present a compositional discourse theory that remedies this enterprise, by the combination of the following settings: 1) the context-passing mechanism, 2) @-operators for representing anaphora/presupposition triggers, 3) (bottom-up) semantic composition with raw terms, and 4) (top-down) anaphora resolution as type checking.