Complexity algorithm analysis for edit distance

Maarif, Haris Al Qodri and Akmeliawati, Rini and Htike@Muhammad Yusof, Zaw Zaw and Gunawan, Teddy Surya (2014) Complexity algorithm analysis for edit distance. In: 5th International Conference on Computer and Communication Engineering (ICCCE2014), 23rd-25th September 2014, Sunway Putra Hotel, Kuala Lumpur.

	PDF - Published Version Restricted to Repository staff only Download (1MB) | Request a copy
Preview	PDF Download (439kB) | Preview

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.

Item Type:	Conference or Workshop Item (Invited Papers)
Additional Information:	5806/40280 (ISBN: 9781479976355, DOI: 10.1109/ICCCE.2014.48)
Uncontrolled Keywords:	natural language processing, edit distance, time comparison
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Engineering > Department of Electrical and Computer Engineering
Depositing User:	Prof. Dr. Teddy Surya Gunawan
Date Deposited:	29 Dec 2014 11:12
Last Modified:	25 Sep 2017 12:18
URI:	http://irep.iium.edu.my/id/eprint/40280

Actions (login required)

View Item