An algorithm for pronominal anaphora resolution
Computational Linguistics
WordNet: a lexical database for English
Communications of the ACM
Snowball: extracting relations from large plain-text collections
DL '00 Proceedings of the fifth ACM conference on Digital libraries
Extracting Patterns and Relations from the World Wide Web
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
Disambiguating Web appearances of people in a social network
WWW '05 Proceedings of the 14th international conference on World Wide Web
Text and knowledge mining for coreference resolution
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
The influence of minimum edit distance on reference resolution
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Machine learning for coreference resolution: from local classification to global ranking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Gossip Galore: a self-learning agent for exchanging pop trivia
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II
| Hi-index | 0.00 |
This paper presents the extension of an existing mimimally supervised rule acquisition method for relation extraction by coreference resolution (CR). To this end, a novel approach to CR was designed and tested. In comparison to state-of-the-art methods for CR, our strategy is driven by the target semantic relation and utilizes domain-specific ontological and lexical knowledge in addition to the learned relation extraction rules. An empirical investigation reveals that newswire texts in our selected domains contain more coreferring noun phrases than prononimal coreferences. This means that existing methods for CR would not suffice and a semantic approach is needed. Our experiments show that the utilization of domain knowledge can boost CR. In our approach, the tasks of relation extraction and CR support each other. On the one hand, reference resolution is needed for the detection of arguments of the target relation. On the other hand, domain modelling for the IE task is used for semantic classification of the referring nouns. Moreover, the application of the learned relation extraction rules often narrows down the number of candidates for CR. With respect to the minimally supervised learning of relation extraction grammars, we design and evaluate two integration strategies: (i) resolution after the complete pattern acquisition process and (ii) resolution embedded in the iterations of the learning process. The evaluation helps us to gain and substantiate a relevant insight: CR effectively improves recall in both strategies but it can hurt the precision because of its error spreading potential.