1996 AnaphoraForEveryone
- (Kennedy & Boguraev, 1996) ⇒ Christopher Kennedy, and Branimir Boguraev. (1996). “Anaphora for Everyone: Pronominal Anaphora Resolution without a Parser.” In: Proceedings of the 16th conference on Computational Linguistics. doi:10.3115/992628.992651
Subject Headings: Anaphora Resolution Algorithm.
Notes
- It presents an Anaphora Resolution Algorithm.
- It extends (Lapping and Leass, 1994).
- A C implementation can be found at http://www.cl.cam.ac.uk/~jp233/software/
Cited By
1999
- (Strube and Hahn, 1999) ⇒ Michael Strube, and Udo Hahn. (1999). “Functional Centering Grounding Referential Coherence in Information Structure.” In: Computational Linguistics.
Quotes
Abstract
We present an algorithm for anaphora resolution which is a modified and extended version of that developed by (Lappin and Leass, 1994). In contrast to that work, our algorithm does not require in-depth, full, syntactic parsing of text. Instead, with minimal compromise in output quality, the modifications enable the resolution process to work from the output of a part of speech tagger, enriched only with annotations of grammatical function of lexical items in the input text stream. Evaluation of the results of our implementation demonstrates that accurate anaphora resolution can be realized within natural language processing frameworks which do not---or cannot--- employ robust and reliable parsing components.
Bibliography
- 1 Marti A. Hearst, Multi-paragraph segmentation of expository text, Proceedings of the 32nd annual meeting on Association for Computational Linguistics, p.9-16, June 27-30, 1994, Las Cruces, New Mexico doi:10.3115/981732.981734
- 2 Irene Heim. (1982). The Semantics of Definite and Indefinite Noun Phrases. Doctoral dissertation, University of Massachusetts, Amherst.
- 3 Hans Kamp. (1981). A theory of truth and semantic representation. In J. Groenedijk, T. Janssen, and M. Stokhof (eds.), Formal Methods in the Study of Language. Mathematisch Centrum Tracts, Amsterdam.
- 4 Fred Karlsson, Atro Voutilainen, Juha Heikkila, Arto Anttila, Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text, Mouton de Gruyter, 1995
- 5 Edward Keenan and Bernard Comrie. 1977. Noun phrase accessibility and universal grammar. Linguistic Inquiry, 8:62--100.
- 6 Christopher Kennedy and Branimir Boguraev. (1996). Anaphora in a wider context: Tracking discourse referents. In W. Wahlster (ed.), 12th European Conference on Artificial Intelligence. John Wiley and Sons, Ltd. London/New York.
- 7 (Lapping and Leass, 1994) ⇒ Shalom Lappin, and Herbert J. Leass. (1994). “An Algorithm for Pronominal Anaphora Resolution.” In: Computational Linguistics, v.20 n.4, p.535-561, December 1994
- 8 Atro Voutilainen, Juha Heikkila, and Arto Antilla. (1992). A constraint grammar of English: A performance oriented approach. University of Helsinki, Publication No. 21, Helsinki, Finland.
,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1996 AnaphoraForEveryone | Christopher Kennedy Branimir Boguraev | Anaphora for Everyone: Pronominal Anaphora Resolution without a Parser | http://acl.ldc.upenn.edu/C/C96/C96-1021.pdf | 10.3115/992628.992651 |