A constrained latent variable model for coreference resolution

Kai Wei Chang; Rajhans Samdani; Dan Roth

A constrained latent variable model for coreference resolution

Kai Wei Chang, Rajhans Samdani, Dan Roth

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Coreference resolution is a well known clustering task in Natural Language Processing. In this paper, we describe the Latent Left Linking model (L³M), a novel, principled, and linguistically motivated latent structured prediction approach to coreference resolution. We show that L³M admits efficient inference and can be augmented with knowledge-based constraints; we also present a fast stochastic gradient based learning. Experiments on ACE and Ontonotes data show that L³M and its constrained version, CL³M, are more accurate than several state-of-the-art approaches as well as some structured prediction models proposed in the literature.

Original language	English (US)
Title of host publication	EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference
Publisher	Association for Computational Linguistics (ACL)
Pages	601-612
Number of pages	12
ISBN (Electronic)	9781937284978
State	Published - 2013
Externally published	Yes
Event	2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013 - Seattle, United States Duration: Oct 18 2013 → Oct 21 2013

Publication series

Name	EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Other

Other	2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013
Country/Territory	United States
City	Seattle
Period	10/18/13 → 10/21/13

ASJC Scopus subject areas

Computational Theory and Mathematics
Information Systems
Computer Vision and Pattern Recognition

Library availability

Discover UIUC Full Text

Cite this

Chang, K. W., Samdani, R., & Roth, D. (2013). A constrained latent variable model for coreference resolution. In EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference (pp. 601-612). (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference). Association for Computational Linguistics (ACL).

A constrained latent variable model for coreference resolution. / Chang, Kai Wei; Samdani, Rajhans; Roth, Dan.

EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. Association for Computational Linguistics (ACL), 2013. p. 601-612 (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chang, KW, Samdani, R & Roth, D 2013, A constrained latent variable model for coreference resolution. in EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference, Association for Computational Linguistics (ACL), pp. 601-612, 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013, Seattle, United States, 10/18/13.

Chang KW, Samdani R, Roth D. A constrained latent variable model for coreference resolution. In EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. Association for Computational Linguistics (ACL). 2013. p. 601-612. (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference).

Chang, Kai Wei ; Samdani, Rajhans ; Roth, Dan. / A constrained latent variable model for coreference resolution. EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. Association for Computational Linguistics (ACL), 2013. pp. 601-612 (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference).

@inproceedings{d203d252dfd745438e1e1af227eeb93c,

title = "A constrained latent variable model for coreference resolution",

abstract = "Coreference resolution is a well known clustering task in Natural Language Processing. In this paper, we describe the Latent Left Linking model (L3M), a novel, principled, and linguistically motivated latent structured prediction approach to coreference resolution. We show that L3M admits efficient inference and can be augmented with knowledge-based constraints; we also present a fast stochastic gradient based learning. Experiments on ACE and Ontonotes data show that L3M and its constrained version, CL3M, are more accurate than several state-of-the-art approaches as well as some structured prediction models proposed in the literature.",

author = "Chang, {Kai Wei} and Rajhans Samdani and Dan Roth",

note = "Publisher Copyright: {\textcopyright} 2013 Association for Computational Linguistics.; 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013 ; Conference date: 18-10-2013 Through 21-10-2013",

year = "2013",

language = "English (US)",

series = "EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference",

publisher = "Association for Computational Linguistics (ACL)",

pages = "601--612",

booktitle = "EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference",

}

TY - GEN

T1 - A constrained latent variable model for coreference resolution

AU - Chang, Kai Wei

AU - Samdani, Rajhans

AU - Roth, Dan

PY - 2013

Y1 - 2013

N2 - Coreference resolution is a well known clustering task in Natural Language Processing. In this paper, we describe the Latent Left Linking model (L3M), a novel, principled, and linguistically motivated latent structured prediction approach to coreference resolution. We show that L3M admits efficient inference and can be augmented with knowledge-based constraints; we also present a fast stochastic gradient based learning. Experiments on ACE and Ontonotes data show that L3M and its constrained version, CL3M, are more accurate than several state-of-the-art approaches as well as some structured prediction models proposed in the literature.

AB - Coreference resolution is a well known clustering task in Natural Language Processing. In this paper, we describe the Latent Left Linking model (L3M), a novel, principled, and linguistically motivated latent structured prediction approach to coreference resolution. We show that L3M admits efficient inference and can be augmented with knowledge-based constraints; we also present a fast stochastic gradient based learning. Experiments on ACE and Ontonotes data show that L3M and its constrained version, CL3M, are more accurate than several state-of-the-art approaches as well as some structured prediction models proposed in the literature.

UR - http://www.scopus.com/inward/record.url?scp=84902787899&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902787899&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84902787899

T3 - EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

SP - 601

EP - 612

BT - EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

PB - Association for Computational Linguistics (ACL)

T2 - 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013

Y2 - 18 October 2013 through 21 October 2013

ER -

A constrained latent variable model for coreference resolution

Abstract

Publication series

Other

ASJC Scopus subject areas

Library availability

Related links

Fingerprint

Cite this