Complexity Algorithm Analysis for Edit Distance

Author

Maarif, H.A. ; Akmeliawati, R. ; Htike, Z.Z. ; Gunawan, T.S.

Author_Institution

Dept. of Mechatron. Eng. Int., Islamic Univ. Malaysia, Kuala Lumpur, Malaysia

fYear

2014

fDate

23-25 Sept. 2014

Firstpage

135

Lastpage

137

Abstract

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 Wrinkler, 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.

Keywords

computational complexity; natural language processing; statistical analysis; Jaro Wrinkler; Levenshtein; Mahalanobis; N-grams; NLP; Soundex; complexity algorithm analysis; edit distance analysis; natural language processing; statistical calculations; time process; Abstracts; Art; Computers; Conferences; Natural language processing; Programming; Speech; edit distance; natural language processing; time comparison;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Communication Engineering (ICCCE), 2014 International Conference on

Conference_Location

Kuala Lumpur

Type

conf

DOI

10.1109/ICCCE.2014.48

Filename

7031619