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

Full description

Bibliographic Details
Main Authors:	Maarif, Haris Al Qodri, Akmeliawati, Rini, Htike@Muhammad Yusof, Zaw Zaw, Gunawan, Teddy Surya
Format:	Conference or Workshop Item
Language:	English English
Published:	2014
Subjects:	TK Electrical engineering. Electronics Nuclear engineering
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

id	iium-40280
recordtype	eprints
spelling	iium-402802017-09-25T04:18:22Z http://irep.iium.edu.my/40280/ Complexity algorithm analysis for edit distance Maarif, Haris Al Qodri Akmeliawati, Rini Htike@Muhammad Yusof, Zaw Zaw Gunawan, Teddy Surya TK Electrical engineering. Electronics Nuclear engineering 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. 2014 Conference or Workshop Item NonPeerReviewed application/pdf en http://irep.iium.edu.my/40280/1/40280.pdf application/pdf en http://irep.iium.edu.my/40280/4/40280_Complexity%20algorithm%20analysis%20for%20edit%20distance_Scopus.pdf 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. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7031619&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_Publication_Number%3A7031477%29%26pageNumber%3D2
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	TK Electrical engineering. Electronics Nuclear engineering
spellingShingle	TK Electrical engineering. Electronics Nuclear engineering Maarif, Haris Al Qodri Akmeliawati, Rini Htike@Muhammad Yusof, Zaw Zaw Gunawan, Teddy Surya Complexity algorithm analysis for edit distance
description	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.
format	Conference or Workshop Item
author	Maarif, Haris Al Qodri Akmeliawati, Rini Htike@Muhammad Yusof, Zaw Zaw Gunawan, Teddy Surya
author_facet	Maarif, Haris Al Qodri Akmeliawati, Rini Htike@Muhammad Yusof, Zaw Zaw Gunawan, Teddy Surya
author_sort	Maarif, Haris Al Qodri
title	Complexity algorithm analysis for edit distance
title_short	Complexity algorithm analysis for edit distance
title_full	Complexity algorithm analysis for edit distance
title_fullStr	Complexity algorithm analysis for edit distance
title_full_unstemmed	Complexity algorithm analysis for edit distance
title_sort	complexity algorithm analysis for edit distance
publishDate	2014
url	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
first_indexed	2023-09-18T20:57:46Z
last_indexed	2023-09-18T20:57:46Z
_version_	1777410419571294208

Complexity algorithm analysis for edit distance

Similar Items