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 条
  • [21] Automatic Parameter Optimization for Edit Distance Algorithm on GPU
    Tomiyama, Ayumu
    Suda, Reiji
    HIGH PERFORMANCE COMPUTING FOR COMPUTATIONAL SCIENCE - VECPAR 2012, 2013, 7851 : 420 - 434
  • [22] DEOBFUSCATION BASED ON EDIT DISTANCE ALGORITHM FOR SPAM FILITERING
    Zhong, Xinwang
    PROCEEDINGS OF 2014 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL 1, 2014, : 109 - 114
  • [23] Marking musical dictations using the edit distance algorithm
    Tremblay, G.
    Champagne, F.
    SOFTWARE-PRACTICE & EXPERIENCE, 2007, 37 (02): : 207 - 230
  • [24] An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs
    Paassen, Benjamin
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2021, 2021, 13058 : 364 - 371
  • [25] Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
    Qiu, Yutong
    Shen, Yihang
    Kingsford, Carl
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2024, 19 (01)
  • [26] Approximating tree edit distance through string edit distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 90 - +
  • [27] Approximating Tree Edit Distance through String Edit Distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMICA, 2010, 57 (02) : 325 - 348
  • [28] Approximating Tree Edit Distance through String Edit Distance
    Tatsuya Akutsu
    Daiji Fukagawa
    Atsuhiro Takasu
    Algorithmica, 2010, 57 : 325 - 348
  • [29] Graph Edit Distance or Graph Edit Pseudo-Distance?
    Serratosa, Francesc
    Cortes, Xavier
    Moreno, Carlos-Francisco
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2016, 2016, 10029 : 530 - 540
  • [30] MinSearch: An Efficient Algorithm for Similarity Search under Edit Distance
    Zhang, Haoyu
    Zhang, Qin
    KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, : 566 - 576
12345