메뉴 건너뛰기




Volumn , Issue , 2005, Pages 88-95

An expectation maximization approach to pronoun resolution

Author keywords

[No Author keywords available]

Indexed keywords

EXPECTATION-MAXIMIZATION APPROACHES; PRONOUN RESOLUTION; SUPERVISED METHODS;

EID: 80053405400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1706543.1706559     Document Type: Conference Paper
Times cited : (27)

References (23)
  • 1
    • 29344460062 scopus 로고    scopus 로고
    • Unsupervised learning of contextual role knowledge for coreference resolution
    • In
    • David L. Bean and Ellen Riloff. 2004. Unsupervised learning of contextual role knowledge for coreference resolution. In HLT-NAACL, pages 297-304.
    • (2004) HLT-NAACL , pp. 297-304
    • Bean, D.L.1    Riloff, E.2
  • 4
    • 84862299483 scopus 로고    scopus 로고
    • Master's thesis, Department of Computing Science, University of Alberta, Edmonton
    • Shane Bergsma. 2005b. Corpus-based learning for pronominal anaphora resolution. Master's thesis, Department of Computing Science, University of Alberta, Edmonton. http://www.cs.ualberta.ca/~bergsma/Pubs/thesis.pdf.
    • (2005) Corpus-based learning for pronominal anaphora resolution
    • Bergsma, S.1
  • 5
  • 10
    • 85055298846 scopus 로고
    • Structural ambiguity and lexical relations
    • Donald Hindle and Mats Rooth. 1993. Structural ambiguity and lexical relations. Computational Linguistics, 19(1):103-120.
    • (1993) Computational Linguistics , vol.19 , Issue.1 , pp. 103-120
    • Hindle, D.1    Rooth, M.2
  • 11
    • 0003414592 scopus 로고
    • chapter 3.23. Oxford: Clarendon Press, 3rd edition
    • Harold Jeffreys, 1961. Theory of Probability, chapter 3.23. Oxford: Clarendon Press, 3rd edition.
    • (1961) Theory of Probability
    • Jeffreys, H.1
  • 14
    • 30844441070 scopus 로고
    • An algorithm for pronominal anaphora resolution
    • Shalom Lappin and Herbert J. Leass. 1994. An algorithm for pronominal anaphora resolution. Computational Linguistics, 20(4):535-561.
    • (1994) Computational Linguistics , vol.20 , Issue.4 , pp. 535-561
    • Lappin, S.1    Leass, H.J.2
  • 15
    • 0002765422 scopus 로고
    • Principar-an efficient, broad-coverage, principle-based parser
    • In, Kyoto, Japan
    • Dekang Lin. 1994. Principar-an efficient, broad-coverage, principle-based parser. In Proceedings of COLING-94, pages 42-48, Kyoto, Japan.
    • (1994) Proceedings of COLING-94 , pp. 42-48
    • Lin, D.1
  • 20
    • 85094067550 scopus 로고    scopus 로고
    • Weakly supervised natural language learning without redundant views
    • In
    • Vincent Ng and Claire Cardie. 2003. Weakly supervised natural language learning without redundant views. In HLTNAACL 2003: Proceedings of the Main Conference, pages 173-180.
    • (2003) HLTNAACL 2003: Proceedings of the Main Conference , pp. 173-180
    • Ng, V.1    Cardie, C.2
  • 22
    • 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
    • Soon, W.M.1    Ng, H.T.2    Yong Lim, D.C.3


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