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 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.

Download full text files

Export metadata

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
GND Keyword:Textanalyse; Linguistische Datenverarbeitung; Computerlinguistik
Page Number: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 und Mathematik / Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):License LogoDeutsches Urheberrecht