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
关键词
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 条
  • [31] A Novel Human Action Recognition Algorithm Based on Edit Distance
    Yuan, Hejin
    Wang, Cuiru
    NEW TRENDS AND APPLICATIONS OF COMPUTER-AIDED MATERIAL AND ENGINEERING, 2011, 186 : 261 - 265
  • [32] A Dynamic Programming A* Algorithm for Computing Unordered Tree Edit Distance
    Yoshino, Takuya
    Higuchi, Shoichi
    Hirata, Kouichi
    2013 SECOND IIAI INTERNATIONAL CONFERENCE ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2013), 2013, : 135 - 140
  • [33] A linear tree edit distance algorithm for similar ordered trees
    Touzet, H
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2005, 3537 : 334 - 345
  • [34] Modified edit distance algorithm and its application in web search
    School of Electronics and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, China
    Hsi An Chiao Tung Ta Hsueh, 2008, 12 (1450-1454):
  • [35] A new algorithm for image similarity measure and graph edit distance
    Xiao, Bing
    Li, Jie
    Gao, Xin-Bo
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2009, 37 (10): : 2205 - 2210
  • [36] An Improved Algorithm for The k-Dyck Edit Distance Problem
    Fried, Dvir
    Golan, Shay
    Kociumaka, Tomasz
    Kopelowitz, Tsvi
    Porat, Ely
    Starikovskaya, Tatiana
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 3650 - 3669
  • [37] Algorithm to Determine Extended Edit Distance between Program Codes
    Anzai, Kazuki
    Watanobe, Yutaka
    2019 IEEE 13TH INTERNATIONAL SYMPOSIUM ON EMBEDDED MULTICORE/MANY-CORE SYSTEMS-ON-CHIP (MCSOC 2019), 2019, : 180 - 186
  • [38] Analysis of tree edit distance on XML data
    Wu, Yu-Fang
    Lin, Shu-Fen
    Yen, Hsu-Chun
    PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET, AND INFORMATION TECHNOLOGY, 2007, : 5 - 10
  • [39] Algorithm for driver intention detection with Fuzzy Logic and Edit Distance
    Heine, Jens
    Sylla, Michael
    Schramm, Thomas
    Langer, Ingmar
    Abendroth, Bettina
    Bruder, Ralph
    2015 IEEE 18TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, : 1022 - 1027
  • [40] A Novel Similarity Verification Algorithm Under Edit Distance Limitation
    Yu C.-Y.
    Li M.-M.
    Zhao C.
    Ma H.-T.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2019, 40 (11): : 1543 - 1548