A Tableau Calculus for Pronoun Resolution
Christof Monz, Maarten de Rijke

TL;DR
This paper introduces a tableau calculus that integrates pronoun resolution into logical deduction, improving natural language reasoning by handling pronouns contextually and efficiently, reducing combinatorial complexity.
Contribution
It proposes a novel tableau calculus that explicitly incorporates contextual information for pronoun resolution during deduction, advancing automated reasoning in natural language processing.
Findings
Effective integration of pronoun resolution with deduction.
Reduces combinatorial complexity in pronoun disambiguation.
Enables interleaved reasoning and resolution processes.
Abstract
We present a tableau calculus for reasoning in fragments of natural language. We focus on the problem of pronoun resolution and the way in which it complicates automated theorem proving for natural language processing. A method for explicitly manipulating contextual information during deduction is proposed, where pronouns are resolved against this context during deduction. As a result, pronoun resolution and deduction can be interleaved in such a way that pronouns are only resolved if this is licensed by a deduction rule; this helps us to avoid the combinatorial complexity of total pronoun disambiguation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Logic, programming, and type systems · Algorithms and Data Compression
