Type Reconstruction for \lambda -DRT Applied to Pronoun Resolution
From MaRDI portal
Publication:2964002
DOI10.1007/978-3-662-53826-5_10zbMATH Open1485.03068OpenAlexW2550045945MaRDI QIDQ2964002FDOQ2964002
Publication date: 22 February 2017
Published in: Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53826-5_10
Logic of natural languages (03B65) Combinatory logic and lambda calculus (03B40) Linguistics (91F20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Principal Type-Scheme of an Object in Combinatory Logic
- The language of mathematics. A linguistic and philosophical investigation
- A calculus for first order discourse representation structures
- Handbook of Linguistic Annotation
- Representing Anaphora with Dependent Types
- Resolving Plural Ambiguities by Type Reconstruction
Uses Software
This page was built for publication: Type Reconstruction for $$\lambda $$-DRT Applied to Pronoun Resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964002)