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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/40280/ http://irep.iium.edu.my/40280/ http://irep.iium.edu.my/40280/1/40280.pdf http://irep.iium.edu.my/40280/4/40280_Complexity%20algorithm%20analysis%20for%20edit%20distance_Scopus.pdf |
| Summary: | 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. |
|---|