Treffer: The anaphora problem
Title:
The anaphora problem
Authors:
Source:
Information and computation (Print). 105(1):105-131
Publisher Information:
San Diego, CA: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Calculabilité, Computability, Calculabilidad, Complexité calcul, Computing complexity, Complejidad cálculo, Langage naturel, Natural language, Lenguaje natural, Problème Anaphora, Anaphora problem, Représentation linguistique, Linguistic representation
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Princeton univ., dep. computer sci., Princeton NJ 08544-2087, United States
ISSN:
0890-5401
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4902402
Database:
PASCAL Archive
Weitere Informationen
Consider the computational problem of understanding the utterance of a human language that contain pronouns. In ordre to completely understand such utterances, the languae user must determine the intended reference of each pronoun in a given utterance. For example, in order to comprehend the English sentence «Jocasta lover her son», the hearer might determine that the possessive pronoun her and the proper noun Jocasta both refer to Jocasta, the Queen of Thebes. Using facts of linguistic knowledge, we develop a sophisticated formal model of this computational problem and prove that it is NP-complete. No knowledge of linguistic theory is needed to understand our analysis, only knowledge of English.