论文信息 - Complexity Algorithm Analysis for Edit Distance

Complexity Algorithm Analysis for Edit Distance

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.

H. A. Maarif | R. Akmeliawati | Z. Z. Htike | Teddy S. Gunawan

[1] P. Mahalanobis. On the generalized distance in statistics , 1936 .

[2] Supriya Kapoor,et al. Facial Gesture Recognition Using Correlation And Mahalanobis Distance , 2010, ArXiv.

[3] Ion Androutsopoulos,et al. Learning Textual Entailment using SVMs and String Similarity Measures , 2007, ACL-PASCAL@ACL.

[4] Nina Nikolova-Jeliazkova,et al. QSAR Applicability Domain Estimation by Projection of the Training Set in Descriptor Space: A Review , 2005, Alternatives to laboratory animals : ATLA.

[5] Darnes Vilariño Ayala,et al. The Soundex Phonetic Algorithm Revisited for SMS Text Representation , 2012, TSD.

[6] John Nerbonne,et al. Applying the Levenshtein Distance to Catalan dialects: A brief comparison of two dialectometric approaches , 2012 .