Type Reconstruction for λ-DRT Applied to Pronoun Resolution

Leiß, Hans und Wu, Shuqian (2016): Type Reconstruction for λ-DRT Applied to Pronoun Resolution. In: Amblard, Maxime; Groote, Philippe de; Pogodalla, Sylvain und Retoré, Christian (Hrsg.): Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016); 9th International Conference, LACL 2016, Nancy, France, December 5-7, 2016, Proceedings. Lecture Notes in Computer Science, Bd. 10054. Berlin, Heidelberg: Springer. S. 149-174

Abstract

lambda-DRT is a typed theory combining simply typed lambda-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 lambda-DRT with automatic type reconstruction. We show a principal types theorem for lambda-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.

• Dokumententyp: Buchbeitrag
• Fakultät: Sprach- und Literaturwissenschaften > Department 2
• Themengebiete: 400 Sprache > 400 Sprache
• ISBN: 978-3-662-53825-8
• Ort: Berlin, Heidelberg
• Sprache: Englisch