Details

Autor(en) / Beteiligte

• Maarif, H. A.
• Akmeliawati, R.
• Htike, Z. Z.
• Gunawan, Teddy S.

Titel

Complexity Algorithm Analysis for Edit Distance

Ist Teil von

• 2014 International Conference on Computer and Communication Engineering, 2014, p.135-137

Ort / Verlag

IEEE

Erscheinungsjahr

2014

Quelle

IEEE Electronic Library Online

Beschreibungen/Notizen

• 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.