• Title/Summary/Keyword: 레빈스타인 거리

Search Result 1, Processing Time 0.013 seconds

Vocabulary Retrieve System using Improve Levenshtein Distance algorithm (개선된 Levenshtein Distance 알고리즘을 사용한 어휘 탐색 시스템)

  • Lee, Jong-Sub;Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.367-372
    • /
    • 2013
  • In general, Levenshtein distance algorithm have a problem with not distinguish the consideration of vacabulary retrieve, because Levenshtein methode is used to vocabulary order are not defined. In this paper, we propose a improved Levenshtein methode, it effectively manage the vocabulary retrieve by frequency use of a vocabulary, and it gives the weight number which have a order between vocabularies. Therefore proposed methode have a advantage of solve the defect of perception rate in the case of increase the vocabulary, improve the recognition time become higher and it can be effectively retrieval space management.. System performance as a result of represent vocabulary dependence recognition rate of 97.81%, vocabulary independence recognition rate of 96.91% in indoor environment. Also, vocabulary dependence recognition rate of 91.11%, vocabulary independence recognition rate of 90.01% in outdoor environment.