메뉴 건너뛰기




Volumn 19, Issue 12, 1997, Pages 1376-1380

Error-tolerant retrieval of trees

Author keywords

Approximate tree comparison; Example based machine translation; Retrieval from lexical databases; Tree databases

Indexed keywords

DATABASE SYSTEMS; INFORMATION RETRIEVAL; TREES (MATHEMATICS);

EID: 0031338987     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.643897     Document Type: Article
Times cited : (12)

References (11)
  • 1
    • 0026880778 scopus 로고    scopus 로고
    • "A Model and a Fast Algorithm for Multiple Errors Spelling Correction," Ada Informatica
    • vol. 29, pp. 281-302,1992.
    • M.W. Du and S.C. Chang, "A Model and a Fast Algorithm for Multiple Errors Spelling Correction," Ada Informatica, vol. 29, pp. 281-302,1992.
    • S.C. Chang
    • Du, M.W.1
  • 3
    • 0024597485 scopus 로고    scopus 로고
    • "Approximate Matching of Regular Expressions,"
    • vol. 51, no. 1, pp. 537,1989.
    • E.W. Myers and W. Miller, "Approximate Matching of Regular Expressions," Bulletin of Mathematical Biology, vol. 51, no. 1, pp. 537,1989.
    • Bulletin of Mathematical Biology
    • Myers, E.W.1    Miller, W.2
  • 5
    • 0002692959 scopus 로고    scopus 로고
    • "Error-Tolerant Finite-State Recognition with Applications to Morphological Analysis and Spelling Correction,"
    • vol. 22, no. 1, pp. 73-89,1996.
    • K. Oflazer, "Error-Tolerant Finite-State Recognition With Applications to Morphological Analysis and Spelling Correction," Computational Linguistics, vol. 22, no. 1, pp. 73-89,1996.
    • Computational Linguistics
    • Oflazer, K.1
  • 6
    • 0001704728 scopus 로고    scopus 로고
    • "Towards Memory-Based Translation,"
    • 13th Int'I Conf. Computational Linguistics, vol. 3, pp. 247-252, 1990.
    • S. Sato and M. Nagao, "Towards Memory-Based Translation," Proc. 13th Int'I Conf. Computational Linguistics, vol. 3, pp. 247-252, 1990.
    • Proc.
    • Sato, S.1    Nagao, M.2
  • 7
    • 0001122858 scopus 로고    scopus 로고
    • "The Tree-to-Tree Editing Problem,"
    • vol. 6, no. 6, pp. 184-186,1977.
    • S.M. Selkow, "The Tree-to-Tree Editing Problem," Information Processing Letters, vol. 6, no. 6, pp. 184-186,1977.
    • Information Processing Letters
    • Selkow, S.M.1
  • 8
    • 0018491659 scopus 로고    scopus 로고
    • "The Tree-to-Tree Correction Problem," J
    • vol. 26, no. 3, pp. 422-433,1979.
    • K.C. Tai, "The Tree-to-Tree Correction Problem," J. ACM, vol. 26, no. 3, pp. 422-433,1979.
    • ACM
    • Tai, K.C.1
  • 9
    • 0346462389 scopus 로고    scopus 로고
    • "Thesaurus-Based Efficient Example Retrieval by Generating Retrieval Queries from Similarities,"
    • 15th Int'I Conf. Computational Linguistics, vol. 2, pp. 1,044-1,048,1994.
    • T. Utsuro, K. Uchimoto, M. Matsumoto, and M. Nagao, "Thesaurus-Based Efficient Example Retrieval by Generating Retrieval Queries From Similarities," Proc. 15th Int'I Conf. Computational Linguistics, vol. 2, pp. 1,044-1,048,1994.
    • Proc.
    • Utsuro, T.1    Uchimoto, K.2    Matsumoto, M.3    Nagao, M.4


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