An algorithm for pronominal anaphora resolution
Computational Linguistics
A New, Fully Automatic Version of Mitkov's Knowledge-Poor Pronoun Resolution Method
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
The mathematics of statistical machine translation: parameter estimation
Computational Linguistics - Special issue on using large corpora: II
A corpus-based evaluation of centering and pronoun resolution
Computational Linguistics - Special issue on computational anaphora resolution
A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
A corpus-based investigation of definite description use
Computational Linguistics
Evaluating discourse processing algorithms
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Resolving pronominal reference to abstract entities
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Tagging text with a probabilistic model
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Improving pronoun resolution by incorporating coreferential information of candidates
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Coarse-to-fine n-best parsing and MaxEnt discriminative reranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Kernel-based pronoun resolution with structured syntactic knowledge
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
BART: a modular toolkit for coreference resolution
HLT-Demonstrations '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Demo Session
Competitive self-trained pronoun interpretation
HLT-NAACL-Short '04 Proceedings of HLT-NAACL 2004: Short Papers
An expectation maximization approach to pronoun resolution
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
Glen, Glenda or Glendale: unsupervised and semi-supervised learning of English noun gender
CoNLL '09 Proceedings of the Thirteenth Conference on Computational Natural Language Learning
Structured generative models for unsupervised named-entity clustering
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Comparison of classification and ranking approaches to pronominal anaphora resolution in Czech
SIGDIAL '09 Proceedings of the SIGDIAL 2009 Conference: The 10th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Automatic evaluation of linguistic quality in multi-document summarization
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Supervised noun phrase coreference research: the first fifteen years
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
The same-head heuristic for coreference
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Using anaphora resolution to improve opinion target identification in movie reviews
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Antelogue: pronoun resolution for text and dialogue
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Demonstrations
A pronoun anaphora resolution system based on factorial hidden Markov models
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Disentangling chat with local coherence models
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Extending the entity grid with entity-specific features
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Narrowing the modeling gap: a cluster-ranking approach to coreference resolution
Journal of Artificial Intelligence Research
Journal of Biomedical Informatics
Structured relation discovery using generative models
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
NADA: a robust system for non-referential pronoun detection
DAARC'11 Proceedings of the 8th international conference on Anaphora Processing and Applications
A generalised hybrid architecture for NLP
HYBRID '12 Proceedings of the Workshop on Innovative Hybrid Approaches to the Processing of Textual Data
Modeling coherence in ESOL learner texts
Proceedings of the Seventh Workshop on Building Educational Applications Using NLP
Discourse structure and computation: past, present and future
ACL '12 Proceedings of the ACL-2012 Special Workshop on Rediscovering 50 Years of Discoveries
Resolving complex cases of definite pronouns: the winograd schema challenge
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Towards unsupervised learning of temporal relations between events
Journal of Artificial Intelligence Research
Rule-based opinion target and aspect extraction to acquire affective knowledge
Proceedings of the 22nd international conference on World Wide Web companion
| Hi-index | 0.00 |
We present an algorithm for pronoun-anaphora (in English) that uses Expectation Maximization (EM) to learn virtually all of its parameters in an unsupervised fashion. While EM frequently fails to find good models for the tasks to which it is set, in this case it works quite well. We have compared it to several systems available on the web (all we have found so far). Our program significantly outperforms all of them. The algorithm is fast and robust, and has been made publically available for downloading.