메뉴 건너뛰기




Volumn 6562 LNAI, Issue , 2011, Pages 435-443

Unsupervised word sense disambiguation with lexical chains and graph-based context formalization

Author keywords

graph based WSD algorithm; lexical chains; unsupervised WSD

Indexed keywords

GRAPH-BASED; LEXICAL CHAIN; LEXICAL CHAINS; SEMANTIC RELATEDNESS; UNSUPERVISED WSD; WORD-SENSE DISAMBIGUATION; WSD ALGORITHMS; SEMANTIC MEASURES;

EID: 79953227688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20095-3_40     Document Type: Conference Paper
Times cited : (2)

References (11)
  • 9
    • 0039486317 scopus 로고    scopus 로고
    • Efficiently computed lexical chains as an intermediate representation for automatic text summarization
    • Silber, H.G., McCoy, K.F.: Efficiently computed lexical chains as an intermediate representation for automatic text summarization. Computational Linguistics 28(4), 487-496 (2002)
    • (2002) Computational Linguistics , vol.28 , Issue.4 , pp. 487-496
    • Silber, H.G.1    McCoy, K.F.2


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