메뉴 건너뛰기




Volumn 1, Issue , 2015, Pages 1416-1426

Learning anaphoricity and antecedent ranking features for coreference resolution

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LEARNING TO RANK;

EID: 84943807058     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p15-1137     Document Type: Conference Paper
Times cited : (160)

References (43)
  • 4
    • 84890472799 scopus 로고    scopus 로고
    • Datadriven multilingual coreference resolution using resolver stacking
    • ACL
    • Anders Björkelund and Richárd Farkas. 2012. Datadriven Multilingual Coreference Resolution using Resolver Stacking. In Joint Conference on EMNLP and CoNLL-Shared Task, pages 49-55. ACL.
    • (2012) Joint Conference on EMNLP and CoNLL-Shared Task , pp. 49-55
    • Björkelund, A.1    Farkas, R.2
  • 9
    • 84858393901 scopus 로고    scopus 로고
    • First-order probabilistic models for coreference resolution
    • Aron Culotta, Michael Wick, Robert Hall, and Andrew McCallum. 2006. First-order Probabilistic Models for Coreference Resolution. NAACL-HLT.
    • (2006) NAACL-HLT
    • Culotta, A.1    Wick, M.2    Hall, R.3    McCallum, A.4
  • 11
    • 84858428184 scopus 로고    scopus 로고
    • Joint determination of anaphoricity and coreference resolution using integer programming
    • Citeseer
    • Pascal Denis, Jason Baldridge, et al. 2007. Joint Determination of Anaphoricity and Coreference Resolution using Integer Programming. In HLT-NAACL, pages 236-243. Citeseer.
    • (2007) HLT-NAACL , pp. 236-243
    • Denis, P.1    Baldridge, J.2
  • 12
    • 80052250414 scopus 로고    scopus 로고
    • Adaptive subgradient methods for online learning and stochastic optimization
    • John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. The Journal of Machine Learning Research, 12:2121-2159.
    • (2011) The Journal of Machine Learning Research , vol.12 , pp. 2121-2159
    • Duchi, J.1    Hazan, E.2    Singer, Y.3
  • 17
    • 84918552373 scopus 로고    scopus 로고
    • Latent structure perceptron with feature induction for unrestricted coreference resolution
    • Association for Computational Linguistics
    • Eraldo Rezende Fernandes, Cícero Nogueira Dos Santos, and Ruy Luiz Milidíu. 2012. Latent Structure Perceptron with Feature Induction for Unrestricted Coreference Resolution. In Joint Conference on EMNLP and CoNLL-Shared Task, pages 41-48. Association for Computational Linguistics.
    • (2012) Joint Conference on EMNLP and CoNLL-Shared Task , pp. 41-48
    • Fernandes, E.R.1    Santos, C.N.S.2    Milidíu, R.L.3
  • 28
  • 29
    • 34548480020 scopus 로고
    • A method of solving a convex programming problem with convergence rate O (1/k2
    • Yurii Nesterov. 1983. A Method of Solving a Convex Programming Problem with Convergence Rate O (1/k2). In Soviet Mathematics Doklady, volume 27, pages 372-376.
    • (1983) Soviet Mathematics Doklady , vol.27 , pp. 372-376
    • Nesterov, Y.1
  • 30
    • 11144345567 scopus 로고    scopus 로고
    • Identifying anaphoric and non-Anaphoric noun phrases to improve coreference resolution
    • Association for Computational Linguistics
    • Vincent Ng and Claire Cardie. 2002. Identifying Anaphoric and Non-Anaphoric Noun Phrases to Improve Coreference Resolution. In Proceedings of the 19th international conference on Computational linguistics-Volume 1, pages 1-7. Association for Computational Linguistics.
    • (2002) Proceedings of the 19th International Conference on Computational Linguistics , vol.1 , pp. 1-7
    • Ng, V.1    Cardie, C.2
  • 31
    • 85149108413 scopus 로고    scopus 로고
    • Learning noun phrase anaphoricity to improve coreference resolution: Issues in representation and optimization
    • Association for Computational Linguistics
    • Vincent Ng. 2004. Learning Noun Phrase Anaphoricity to Improve Coreference Resolution: Issues in Representation and Optimization. In Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, page 151. Association for Computational Linguistics.
    • (2004) Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics , pp. 151
    • Ng, V.1
  • 35
    • 84906515207 scopus 로고    scopus 로고
    • The life and death of discourse entities: Identifying singleton mentions
    • Marta Recasens, Marie-Catherine de Marneffe, and Christopher Potts. 2013. The Life and Death of Discourse Entities: Identifying Singleton Mentions. In HLT-NAACL, pages 627-633.
    • (2013) HLT-NAACL , pp. 627-633
    • Recasens, M.1    De Marneffe, M.2    Potts, C.3
  • 38
    • 0039891959 scopus 로고    scopus 로고
    • A machine learning approach to coreference resolution of noun phrases
    • Wee Meng Soon, Hwee Tou Ng, and Daniel Chung Yong Lim. 2001. A Machine Learning Approach to Coreference Resolution of Noun Phrases. Computational Linguistics, 27(4):521-544.
    • (2001) Computational Linguistics , vol.27 , Issue.4 , pp. 521-544
    • Meng Soon, W.1    Tou Ng, H.2    Chung, D.3    Lim, Y.4
  • 39
    • 84876807022 scopus 로고    scopus 로고
    • Easy-first coreference resolution
    • Citeseer
    • Veselin Stoyanov and Jason Eisner. 2012. Easy-first Coreference Resolution. In COLING, pages 2519-2534. Citeseer.
    • (2012) COLING , pp. 2519-2534
    • Stoyanov, V.1    Eisner, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.