Generalized Quantifiers on Dependent Types: A System for Anaphora
Logic
2016-08-02 v2 Logic in Computer Science
Abstract
We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically, our system allows a uniform treatment of all types of unbound anaphora, including the notoriously difficult cases such as quantificational subordination, cumulative and branching continuations, and 'donkey anaphora'.
Cite
@article{arxiv.1402.0033,
title = {Generalized Quantifiers on Dependent Types: A System for Anaphora},
author = {Justyna Grudzinska and Marek Zawadowski},
journal= {arXiv preprint arXiv:1402.0033},
year = {2016}
}
Comments
40 pages; final version