2014/01/31 by Justyna Grudzińska, Grudzinska, Justyna, Marek Zawadowski +1
Arts and Humanities · Computer Science · #03B65 #91F20 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Natural Language Processing Techniques #Syntax, Semantics, Linguistic Variation #Topic Modeling
paper · pdf · doi:10.48550/arxiv.1402.0033
openalex publication_date 2014/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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'.