TY  - CONF
A1  - Stuckardt, Roland
T1  - Anaphor resolution and the scope of syntactic constraints
N2  - 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.
KW  - Textanalyse
KW  - Linguistische Datenverarbeitung
KW  - Computerlinguistik
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4193
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12912
UR  - http://www.stuckardt.de/index.php/component/docman/doc_download/3-coling96.html
N1  - auch in: Proceedings of the 16th International Conference on Computational Linguistics (COLING), Vol. II, August 1996, Kopenhagen, S. 932-937
ER  -