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

共 10 条

[1] [Anonymous], 1936, P NATL I SCI INDIA, DOI DOI 10.1007/S13171-019-00164-5
[2] [Anonymous], 2008, Introduction to information retrieval
[3] QSAR applicability domain estimation by projection of the training set in descriptor space: A review
Jaworska, J
Nikolova-Jeliazkova, N
Aldenberg, T
[J]. ATLA-ALTERNATIVES TO LABORATORY ANIMALS, 2005, 33 (05): : 445 - 459
[4] Kapoor S., 2010, ARXIV10031819
[5] Knuth D., 1998, ART COMPUTER PROGRAM
[6] MALAKASIOTIS P, 2007, P ACL PASCAL WORKSH, P42
[7] Pinto D, 2012, LECT NOTES COMPUT SC, V7499, P47, DOI 10.1007/978-3-642-32790-2_5
[8] [No title captured]
[9] [No title captured]
[10] [No title captured]

← 1 →