Year: 1996
Type: conference-paper
Abstract: An anaphor resolution algorithm is presented which relies on a combination of strategies for narrowing down and selecting from antecedent sets for reflexive pronouns, nonreflexive pronouns, and common nouns. The work focuses on syntactic restrictions which are derived from Chomsky's Binding Theory. It is discussed how these constraints can be incorporated adequately in an anaphor resolution algorithm. Moreover, by showing that pragmatic inferences may be necessary, the limits of syntactic restrictions are elucidated.
Author: Roland Stuckardt
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1966989951