Skip to main content
Conference ProceedingsOPEN ACCESS

Type reconstruction for λ-DRT applied to pronoun resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 10054 LNCS 149-174
DOI: 10.1007/978-3-662-53826-5_10
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

λ-DRT is a typed theory combining simply typed λ-calculus with discourse representation theory, used for modelling the semantics of natural language. With the aim of type-checking natural language texts in the same vein as is familiar from type-checking programs, we propose untyped λ-DRT with automatic type reconstruction. We show a principal types theorem for λ-DRT and how type reconstruction can be used to make pronoun resolution type-correct, i.e. the inferred types of a pronoun occurrence and its antecedent noun phrase have to be compatible, thereby reducing the number of possible antecedents.

Author supplied keywords

Cite

CITATION STYLE

APA

Leiß, H., & Wu, S. (2016). Type reconstruction for λ-DRT applied to pronoun resolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10054 LNCS, pp. 149–174). Springer Verlag. https://doi.org/10.1007/978-3-662-53826-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free