메뉴 건너뛰기




Volumn 2588, Issue , 2003, Pages 329-332

Sentence co-occurrences as small-world graphs: A solution to automatic lexical disambiguation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; GRAPH THEORY; TEXT PROCESSING;

EID: 21144447869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36456-0_34     Document Type: Article
Times cited : (9)

References (8)
  • 1
    • 84957611690 scopus 로고    scopus 로고
    • An adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet
    • A. Gelbukh (Ed.), Computational Linguistics and Intelligent Text Processing, Springer-Verlag
    • S. Banarjee, T. Pedersen. An adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet. In A. Gelbukh (Ed.), Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science N 2276, Springer-Verlag, 2002.
    • (2002) Lecture Notes in Computer Science , vol.2276
    • Banarjee, S.1    Pedersen, T.2
  • 8
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'small-world' networks
    • D. J. Watts, S.H. Strogatz. Collective dynamics of 'small-world' networks, Nature 393:440-442, 1998.
    • (1998) Nature , vol.393 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2


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