Spell Checker for Somali Language Using Knuth-Morris-Pratt String Matching Algorithm

2018 ◽  
pp. 249-256
Author(s):  
Ali Olow Jimale ◽  
Wan Mohd Nazmee Wan Zainon ◽  
Lul Farah Abdullahi
Keyword(s):  
String Matching ◽  
Matching Algorithm ◽  
Spell Checker

scholarly journals Contribution to Semantic Analysis of Arabic Language

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Anis Zouaghi ◽  
Mounir Zrigui ◽  
Georges Antoniadis ◽  
Laroussi Merhbene
Keyword(s):  
Information Retrieval ◽  
Semantic Analysis ◽  
String Matching ◽  
Ambiguous Word ◽  
Arabic Language ◽  
New Approach ◽  
Matching Algorithm ◽  
Ambiguous Words ◽  
Lesk Algorithm ◽  
Context Of Use

We propose a new approach for determining the adequate sense of Arabic words. For that, we propose an algorithm based on information retrieval measures to identify the context of use that is the closest to the sentence containing the word to be disambiguated. The contexts of use represent a set of sentences that indicates a particular sense of the ambiguous word. These contexts are generated using the words that define the senses of the ambiguous words, the exact string-matching algorithm, and the corpus. We use the measures employed in the domain of information retrieval, Harman, Croft, and Okapi combined to the Lesk algorithm, to assign the correct sense of those proposed.

scholarly journals Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android

2021 ◽  
Vol 1 (2) ◽  
pp. 54-60
Author(s):  
Candra Irawan ◽  
Mudafiq Riyan Pratama
Keyword(s):  
String Matching ◽  
Search Process ◽  
Brute Force ◽  
Text Search ◽  
Matching Algorithm ◽  
Running Time ◽  
The Right ◽  
Bahasa Indonesia ◽  
Testing Criteria

String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm. The Boyer-Moore algorithm is a string matching algorithm published by Robert S. Boyer and J. Strother Moore in 1977. This algorithm is considered the most efficient algorithm in general applications. The Boyer-Moore algorithm starts matching characters from the pattern on the right. While the Brute Force algorithm is an algorithm that matches a pattern with all text between 0 and n-m to find the existence of a pattern in the text. These two algorithms have different patterns in the search process. In this article, a comparative analysis of the performance of the Boyer-Moore and Brute Force algorithms is carried out in a case study of the search for the Big Indonesian Dictionary (KBBI) based on Android. The search process is carried out by searching based on words and word descriptions. The results of this study indicate that the criteria for running time, the Brute Force algorithm is faster than the Boyer-Moore algorithm with the total running time of the Brute Force algorithm is 168.3 ms in words, 6994.16 ms in word descriptions, while the Boyer-Moore algorithm for running time reached 304.7 ms on the word, 8654.77 ms on the word description. In the testing criteria based on related keywords, the two algorithms can display the same list of related keywords.

Sign in / Sign up

Export Citation Format

Share Document