Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms

Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms. In determining similarities, the Rabin-Karp and Winnowing algorithms use fingerprints, while the Horspool Boyer-Moore alg...

Full description

Saved in:
Bibliographic Details
Published in:Intensif (Online) Vol. 6; no. 2; pp. 253 - 270
Main Authors: Fadlil, Abdul, Sunardi, Sunardi, Ramdhani, Rezki
Format: Journal Article
Language:English
Published: Universitas Nusantara PGRI Kediri 13.08.2022
Subjects:
algorithm
n-gram
similarity
string-matching
ISSN:2580-409X, 2549-6824
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms. In determining similarities, the Rabin-Karp and Winnowing algorithms use fingerprints, while the Horspool Boyer-Moore algorithm uses a bad-character table. However, previous research focused on identifying similarities using these algorithms based on character n-gram. In contrast, identification based on the word n-gram to determine the similarity based on its linguistic meaning, especially for longer strings, had not been covered yet. Therefore, a word-level trigram was proposed to identify similarities based on the word trigrams using the three algorithms and compare each performance. Based on precision, recall, and running time comparison, the Rabin-Karp algorithm results were 100%, 100%, and 0.19 ms, respectively; the Winnowing algorithm results with the smallest window were 100%, 56%, and 0.18 ms, respectively; and the Horspool algorithm results were 100%, 100%, and 0.06 ms. From these results, it can be concluded that the performance of the Horspool Boyer-Moore algorithm is better in terms of precision, recall, and running time.
ISSN:2580-409X
2549-6824
DOI:10.29407/intensif.v6i2.18141