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 条
  • [1] The Smoothed Complexity of Edit Distance
    Andoni, Alexandr
    Krauthgamer, Robert
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [2] The smoothed complexity of edit distance
    Andoni, Alexandr
    Krauthgamer, Robert
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 357 - +
  • [3] A parallel graph edit distance algorithm
    Abu-Aisheh, Zeina
    Raveaux, Romain
    Ramel, Jean-Yves
    Martineau, Patrick
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 94 : 41 - 57
  • [4] The greedy algorithm for edit distance with moves
    Kaplan, H
    Shafrir, N
    INFORMATION PROCESSING LETTERS, 2006, 97 (01) : 23 - 27
  • [5] An Improved Sketching Algorithm for Edit Distance
    Jin, Ce
    Nelson, Jelani
    Wu, Kewen
    38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [6] An Edit Distance Algorithm with Block Swap
    Xia, Tian
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 54 - 59
  • [7] Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
    Andoni, Alexandr
    Krauthgamer, Robert
    Onak, Krzysztof
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 377 - 386
  • [8] Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
    Andoni, Alexandr
    Krauthgamer, Robert
    Onak, Krzysztof
    PROPERTY TESTING: CURRENT RESEARCH AND SURVEYS, 2010, 6390 : 244 - +
  • [9] An Optimal Decomposition Algorithm for Tree Edit Distance
    Demaine, Erik D.
    Mozes, Shay
    Rossman, Benjamin
    Weimann, Oren
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [10] Distributed algorithm for parallel edit distance computation
    Sadiq M.U.
    Yousaf M.M.
    Computing and Informatics, 2021, 39 (04) : 757 - 779
12345