Complexity Algorithm Analysis for Edit Distance

被引：3
|
作者：
Maarif, H. A. [1 ]
Akmeliawati, R. [1 ]
Htike, Z. Z. [1 ]
Gunawan, Teddy S. [2 ]
机构：
[1] Int Islamic Univ Malaysia, Dept Mechatron Engn, Intelligent Mechatron Syst Res Unit, Kuala Lumpur, Malaysia
[2] Int Islamic Univ Malaysia, Dept Elect & Comp Engn, Kuala Lumpur, Malaysia
来源：
2014 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING (ICCCE) | 2014年
关键词：
natural language processing; edit distance; time comparison;
D O I：
10.1109/ICCCE.2014.48
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Natural Language Processing (NLP) is a method which works on any language processing. Some of the algorithms are based on edit distance analysis. It is a process where the statistical calculations between two words or sentences are analyzed. Some of used edit distances for NLP are Levenshtein, Jaro Wrinkles, Soundex, N-grams, and Mahalanobis. The evaluation of edit distance is aimed to analyze the processing time of each edit distance in calculation of two different words or sentences. The objective of this paper is to evaluate the complexity of each distance, based on the time process.
引用
收藏
页码：135 / 137
页数：3
相关论文
共 50 条
  • [41] Average Edit Distance Bacterial Mutation Algorithm for Effective Optimisation
    Tang, Tiong Yew
    Egerton, Simon
    Botzheim, Janos
    Kubota, Naoyuki
    2014 IEEE SYMPOSIUM ON ROBOTIC INTELLIGENCE IN INFORMATIONALLY STRUCTURED SPACE (RIISS), 2014, : 1 - 7
  • [42] An Adjusted-Edit Distance Algorithm Applying to Web Environment
    Zhu, Mingdong
    Shen, Derong
    Nie, Tiezheng
    Kou, Yue
    2009 SIXTH WEB INFORMATION SYSTEMS AND APPLICATIONS CONFERENCE, PROCEEDINGS, 2009, : 71 - 75
  • [43] An improved algorithm for tree edit distance incorporating structural linearity
    Chen, Shihyen
    Zhang, Kaizhong
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2007, 4598 : 482 - +
  • [44] lINTERPRETING CHANCE FOR COMPUTER SECURITY BY VITERBI ALGORITHM WITH EDIT DISTANCE
    Koo, Ja-Min
    Cho, Sung-Bae
    NEW MATHEMATICS AND NATURAL COMPUTATION, 2005, 1 (03) : 421 - 433
  • [45] An Improved Algorithm for The k-Dyck Edit Distance Problem
    Fried, Dvir
    Golan, Shay
    Kociumaka, Tomasz
    Kopelowitz, Tsvi
    Porat, Ely
    Starikovskaya, Tatiana
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (03)
  • [46] A comparative analysis of new graph distance measures and graph edit distance
    Li, Tao
    Dong, Han
    Shi, Yongtang
    Dehmer, Matthias
    INFORMATION SCIENCES, 2017, 403 : 15 - 21
  • [47] Burst Edit Distance
    Boneh, Itai
    Golan, Shay
    Levy, Avivit
    Porat, Ely
    Shalom, B. Riva
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2024, 2025, 14899 : 41 - 56
  • [48] Markov edit distance
    Wei, J
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (03) : 311 - 321
  • [49] Hybrid Optimization Algorithm Using N Gram Based Edit Distance
    Priya, M.
    Kalpana, R.
    Srisupriya, T.
    2017 INTERNATIONAL CONFERENCE ON COMMUNICATION AND SIGNAL PROCESSING (ICCSP), 2017, : 216 - 221
  • [50] Segmentation Edit Distance
    Pucher, Daniel
    Kropatsch, Walter G.
    2018 24TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2018, : 1175 - 1180
12345