메뉴 건너뛰기




Volumn 3523, Issue II, 2005, Pages 638-646

Semantic similarity between sentences through approximate tree matching

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ERROR ANALYSIS; INFORMATION RETRIEVAL; PATTERN MATCHING; TREES (MATHEMATICS);

EID: 25144467371     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11492542_78     Document Type: Conference Paper
Times cited : (2)

References (5)
  • 4
    • 0015960104 scopus 로고
    • The string to string correction problem
    • R.A. Wagner and M.J. Fischer. The string to string correction problem. Journal of the ACM, 21(1):168-173, 1974.
    • (1974) Journal of the ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 5
    • 0003193164 scopus 로고
    • Approximate tree matching in the presence of variable length don't cares
    • K. Zhang, D. Shasha, and J.T.L. Wang. Approximate tree matching in the presence of variable length don't cares. Journal of Algorithms, 16(1):33-66, 1994.
    • (1994) Journal of Algorithms , vol.16 , Issue.1 , pp. 33-66
    • Zhang, K.1    Shasha, D.2    Wang, J.T.L.3


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