ACM Home Page
Please provide us with feedback. Feedback
Coreference resolution using expressive logic models
Full text PdfPdf (90 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
POSTER SESSION: Poster session 1/knowledge management table of contents
Pages 1373-1374  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Ki Chan  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Wai Lam  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Xiaofeng Yu  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 64,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458286
What is a DOI?

ABSTRACT

Coreference resolution is regarded as a crucial step for acquiring linkages among pieces of information extracted. Traditionally, coreference resolution models make use of independent attribute-value features over pairs of noun phrases. However, dependency and deeper relations between features can more adequately describe the properties of coreference relations between noun phrases. In this paper, we propose a framework of coreference resolution based on first-order logic and probabilistic graphical model, the Markov Logic Network. The proposed framework enables the use of background knowledge and captures more complex coreference linkage properties through rich expression of conditions. Moreover, the proposed conditions can capture the structural pattern within a noun phrase as well as contextual information between noun phrases. Our experiments show improvement with the use of the expressive logic models and the use of pattern-based conditions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Bagga and B. Baldwin. Algorithms for scoring coreference chains. In Proceedings of the Linguistic Coreference Workshop at the First International Conference on Language Resources and Evaluation, pages 563--566, 1998.
 
2
S. Kok and P. Domingos. The alchemy system for statistical relational AI. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 2005. http://www.cs.washington.edu/ai/alchemy
 
3
 
4