메뉴 건너뛰기




Volumn , Issue , 2005, Pages 660-667

Multi-lingual coreference resolution with syntactic features

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 38149113090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220575.1220658     Document Type: Conference Paper
Times cited : (32)

References (25)
  • 3
    • 0002652285 scopus 로고    scopus 로고
    • A maximum entropy approach to natural language processing
    • March
    • Adam L. Berger, Stephen A. Della Pietra, and Vincent J. Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1):39-71, March.
    • (1996) Computational Linguistics , vol.22 , Issue.1 , pp. 39-71
    • Berger, A.L.1    Della Pietra, S.A.2    Della Pietra, V.J.3
  • 7
    • 84935441458 scopus 로고
    • On the distribution and reference of empty pronouns
    • C.-T. James Huang. 1984. On the distribution and reference of empty pronouns. Linguistic Inquiry, 15:531-574.
    • (1984) Linguistic Inquiry , vol.15 , pp. 531-574
    • Huang, C.-T.J.1
  • 8
    • 29344474705 scopus 로고    scopus 로고
    • The (Non)utility of predicateargument frequencies for pronoun interpretation
    • Daniel Marcu Susan Dumais and Salim Roukos, editors, Boston, Massachusetts, USA, May 2 - May 7. Association for Computational Linguistics
    • Andrew Kehler, Douglas Appelt, Lara Taylor, and Aleksandr Simma. 2004. The (Non)utility of predicateargument frequencies for pronoun interpretation. In Daniel Marcu Susan Dumais and Salim Roukos, editors, HLT-NAACL 2004: Main Proceedings, Boston, Massachusetts, USA, May 2 - May 7. Association for Computational Linguistics.
    • (2004) HLT-NAACL 2004: Main Proceedings
    • Kehler, A.1    Appelt, D.2    Taylor, L.3    Simma, A.4
  • 9
    • 30844441070 scopus 로고
    • An algorithm for pronominal anaphora resolution
    • December
    • Shalom Lappin and Herbert J. Leass. 1994. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20(4), December.
    • (1994) Computational Linguistics , vol.20 , Issue.4
    • Lappin, S.1    Leass, H.J.2
  • 10
    • 85015851164 scopus 로고    scopus 로고
    • A mentionsynchronous coreference resolution algorithm based on the bell tree
    • Xiaoqiang Luo, Abe Ittycheriah, Hongyan Jing, Nanda Kambhatla, and Salim Roukos. 2004. A mentionsynchronous coreference resolution algorithm based on the bell tree. In Proc. of ACL.
    • (2004) Proc. of ACL
    • Luo, X.1    Ittycheriah, A.2    Jing, H.3    Kambhatla, N.4    Roukos, S.5
  • 11
    • 80053254849 scopus 로고    scopus 로고
    • On coreference resolution performance metrics
    • Xiaoqiang Luo. 2005. On coreference resolution performance metrics. In Procs. of HLT/EMNLP.
    • (2005) Procs. of HLT/EMNLP
    • Luo, X.1
  • 13
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn treebank
    • M. Marcus, B. Santorini, and M. Marcinkiewicz. 1993. Building a large annotated corpus of English: the Penn treebank. Computational Linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.1    Santorini, B.2    Marcinkiewicz, M.3
  • 15
    • 85149134414 scopus 로고    scopus 로고
    • Robust pronoun resolution with limited knowledge
    • R. Mitkov. 1998. Robust pronoun resolution with limited knowledge. In Procs. of the 36th ACL/17th COLING, pages 869-875.
    • (1998) Procs. of the 36th ACL/17th COLING , pp. 869-875
    • Mitkov, R.1
  • 17
    • 85018107058 scopus 로고    scopus 로고
    • Improving machine learning approaches to coreference resolution
    • Vincent Ng and Claire Cardie. 2002. Improving machine learning approaches to coreference resolution. In Proc. of ACL, pages 104-111.
    • (2002) Proc. of ACL , pp. 104-111
    • Ng, V.1    Cardie, C.2
  • 19
    • 77951940145 scopus 로고    scopus 로고
    • NIST. 2004. The ACE evaluation plan. www.nist.gov/speech/tests/ace/index. htm.
    • (2004) The ACE Evaluation Plan
  • 20
    • 0032660854 scopus 로고    scopus 로고
    • Learning to parse natural language with maximum entropy models
    • Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151-178.
    • (1999) Machine Learning , vol.34 , pp. 151-178
    • Ratnaparkhi, A.1
  • 21
    • 0039891959 scopus 로고    scopus 로고
    • A machine learning approach to coreference resolution of noun phrases
    • DOI 10.1162/089120101753342653
    • Wee Meng Soon, Hwee Tou Ng, and Chung Yong Lim. 2001. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4):521-544. (Pubitemid 33597451)
    • (2001) Computational Linguistics , vol.27 , Issue.4 , pp. 521-544
    • Soon, W.M.1    Lim, D.C.Y.2    Ng, H.T.3
  • 22
    • 0038972285 scopus 로고    scopus 로고
    • Design and enhanced evaluation of a robust anaphor resolution algorithm
    • Roland Stuckardt. 2001. Design and enhanced evaluation of a robust anaphor resolution algorithm. Computational Linguistics, 27(4).
    • (2001) Computational Linguistics , vol.27 , Issue.4
    • Stuckardt, R.1
  • 25
    • 85037109408 scopus 로고    scopus 로고
    • Coreference resolution using competition learning approach
    • Xiaofeng Yang, Guodong Zhou, Jian Su, and Chew Lim Tan. 2003. Coreference resolution using competition learning approach. In Proc. of ACL.
    • (2003) Proc. of ACL
    • Yang, X.1    Zhou, G.2    Su, J.3    Tan, C.L.4


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