Anaphor resolution and the scope of syntactic constraints

An anaphor resolution algorithm is presented which relies on a combination of strategies for narrowing down and selecting from antecedent sets for re exive pronouns, nonre exive pronouns, and common nouns. The work focus
An anaphor resolution algorithm is presented which relies on a combination of strategies for narrowing down and selecting from antecedent sets for re exive pronouns, nonre exive 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.
show moreshow less

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

    Share in Twitter Search Google Scholar
Metadaten
Author:Roland Stuckardt
URN:urn:nbn:de:hebis:30-12912
URL:http://www.stuckardt.de/index.php/component/docman/doc_download/3-coling96.html
Document Type:Conference Proceeding
Language:English
Date of Publication (online):2005/07/26
Year of first Publication:1996
Publishing Institution:Universitätsbibliothek Johann Christian Senckenberg
Release Date:2005/07/26
SWD-Keyword:Computerlinguistik; Linguistische Datenverarbeitung ; Textanalyse
Pagenumber:6
Note:
auch in: Proceedings of the 16th International Conference on Computational Linguistics (COLING), Vol. II, August 1996, Kopenhagen, S. 932-937
Source:Publ. in: Proceedings of the 16th International Conference on Computational Linguistics (COLING), Vol. II, August 1996, Kopenhagen, 932-937 , http://www.stuckardt.de/index.php/component/docman/doc_download/3-coling96.html
HeBIS PPN:224860267
Institutes:Informatik
Dewey Decimal Classification:004 Datenverarbeitung; Informatik
Sammlungen:Universitätspublikationen
Licence (German):License Logo Veröffentlichungsvertrag für Publikationen

$Rev: 11761 $