Cover Image

String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi

Information Technology has enabled information that can be in many forms such as text, image or sound, to be accessed widely using search terms via a computer. Due to this type of popularity and advancement in technology, there is an increased interest in searching Malay text to enable scholars and...

Full description

Saved in:
Bibliographic Details
Main Author: Mohd Ghazi, Mohd Razif
Format: Thesis
Language:English
Published: 1999
Subjects:
Mathematical statistics. Probabilities
Online Access:https://ir.uitm.edu.my/id/eprint/98146/1/98146.pdf
https://ir.uitm.edu.my/id/eprint/98146/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.98146
record_format eprints
spelling my.uitm.ir.981462024-07-29T09:50:12Z https://ir.uitm.edu.my/id/eprint/98146/ String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi Mohd Ghazi, Mohd Razif Mathematical statistics. Probabilities Information Technology has enabled information that can be in many forms such as text, image or sound, to be accessed widely using search terms via a computer. Due to this type of popularity and advancement in technology, there is an increased interest in searching Malay text to enable scholars and researchers to access the data on-line. This thesis studies the method of a string searching algorithm. There are two methods being evaluated in this research. These are the Wagner & Fischer and Hirschberg algorithms. These methods were chosen because they are based on dynamic programming. Dynamic programming is used to solve both the String Distance Problem and Longest Common Subsequence (LCS) problem. The results obtained shows searching and comparison of LCS retrieved by both algorithms. Comparing of words is carried out based on Dice coefficient. 1999 Thesis NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/98146/1/98146.pdf String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi. (1999) Degree thesis, thesis, Universiti Teknologi MARA (UiTM).
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Mathematical statistics. Probabilities
spellingShingle Mathematical statistics. Probabilities
Mohd Ghazi, Mohd Razif
String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
description Information Technology has enabled information that can be in many forms such as text, image or sound, to be accessed widely using search terms via a computer. Due to this type of popularity and advancement in technology, there is an increased interest in searching Malay text to enable scholars and researchers to access the data on-line. This thesis studies the method of a string searching algorithm. There are two methods being evaluated in this research. These are the Wagner & Fischer and Hirschberg algorithms. These methods were chosen because they are based on dynamic programming. Dynamic programming is used to solve both the String Distance Problem and Longest Common Subsequence (LCS) problem. The results obtained shows searching and comparison of LCS retrieved by both algorithms. Comparing of words is carried out based on Dice coefficient.
format Thesis
author Mohd Ghazi, Mohd Razif
author_facet Mohd Ghazi, Mohd Razif
author_sort Mohd Ghazi, Mohd Razif
title String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
title_short String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
title_full String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
title_fullStr String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
title_full_unstemmed String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi
title_sort string matching algorithms: to search and compare longest common subsequence strings retrieved from wagner & fischer and hirschberg algorithms on malay dictionary words / mohd razif mohd ghazi
publishDate 1999
url https://ir.uitm.edu.my/id/eprint/98146/1/98146.pdf
https://ir.uitm.edu.my/id/eprint/98146/
_version_ 1806422154082779136
score 13.211869

Similar Items