TELKOMNIKA Telecommunication, Computing, Electronics and Control
Detecting Indonesian ambiguous sentences using Boyer-Moore algorithm

TELKOMNIKA Telecommunication, Computing, Electronics and Control
Detecting Indonesian ambiguous sentences using Boyer-Moore algorithm

Ambiguous, Boyer-Moore, Grammatical, Indonesian sentences, String, Text

Ambiguous sentences are divided into 3 types namely phonetic, lexical, and grammatical. This study focuses on grammatical ambiguous sentences, grammatical ambiguous sentences are ambiguities that occur due to incorrect grammar, but this ambiguity will disappear once it is used within a sentence. Ambiguous sentences become a big problem when they are processed by a computer. In order for the computer to interpret ambiguous words correctly, this study seeks to develop detection of Indonesian ammbiguous sentences using Boyer Moore algorithm. This algorithm matches ambiguous sentences that are inserted as input with the data set. Then the sentence is being detected
whether it contains ambiguous sentences, by calculating the percentage of similarity using cosine similarity method. Cosine similarity system is able to find out the meaning of the sentence. In the data set, the number of ambiguous sentences that can be collected is 50 words. The 50 words consist of ambiguous words data, ambiguous sentences, and ambiguous sentence meanings. This system trial was carried out for 200 times and the accuracy level was 0.935, precision was 0.9320, and Recall was 0.8. While the F-Measure was 0.8061. While the speed for word search 0.003275 seconds

Risky Aswi Ramadhani, I Ketut Gede Darma Putra, Made Sudarma, I. A. D. Giriantari

DOI: 10.12928/TELKOMNIKA.v18i5.14027

Universitas Ahmad Dahlan

October 2020

Sri Wahyuni

ISSN: 1693-6930

http://journal.uad.ac.id/index.php/TELKOMNIKA

PDF

English

Text

TELKOMNIKA Telecommunication, Computing, Electronics and Control