Representing anaphora with dependent types

DOI10.1007/978-3-662-43742-1_2MaRDI QIDQ4981265zbMATH OpenOpenAlexFDO

Authors Daisuke Bekki

Publication date 24 June 2014

Published in Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43742-1_2

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Recommendations

• A model-theoretic reconstruction of type-theoretic semantics for anaphora
• A higher-order theory of presupposition
• Discourse interpretation based on dynamic constraints
• A dynamic categorial grammar
• Type reconstruction for -DRT applied to pronoun resolution

Cited in

(13)

• Dependent event types
• A model-theoretic reconstruction of type-theoretic semantics for anaphora
• Handling verb phrase anaphora with dependent types and events
• Inverse linking, possessive weak definites and Haddock descriptions: a unified dependent type account
• Variable handling and compositionality: comparing DRT and DTS
• Implementing variable vectors in a CCG parser
• Proof assistants for natural language semantics
• Type reconstruction for -DRT applied to pronoun resolution
• A type reduction from proof-conditional to dynamic semantics
• Propositional forms of judgemental interpretations
• A higher-order theory of presupposition
• A dependently-typed calculus of event telicity and culminativity
• Mathematical structures in natural language semantics: Zawadowski's contribution to linguistics

This page was built for publication: Representing anaphora with dependent types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981265)