ANALISIS POLA DAN PROBABILITAS PADA PEMBUATAN KAMUS BAHASA INDONESIA DAN JAWA MENGGUNAKAN PEMODELAN MARKOV

Mike , Yuliana and Tribudi , Santoso and Nur , Afifah ANALISIS POLA DAN PROBABILITAS PADA PEMBUATAN KAMUS BAHASA INDONESIA DAN JAWA MENGGUNAKAN PEMODELAN MARKOV. In: Jurnal Ilmiah Ilmu Komputer.

Preview

PDF Download (919Kb) | Preview

Abstract

To overcome the problem of communication in two languages, we need a translator. The translator can be a dictionary. In the manufacture of electronic dictionaries, a method for parsing and searching is needed. In this study, the method that is used to parse a sentence is parsing tree and binary searching with the help of markov models to determine patterns of words that form the search. The results showed that the words with the same prefix, would have the same probability value, and these form a pattern. The more words beginning with the same prefix, the smaller the probability value. The smallest probability value is 0.007462686 with the number of words are 134. While the probability of words beginning with the letter Y and O is 0.33333334, because it has the least amount of words. For the probability of words beginning with the letter F, O, V, and Z is 0, because there is no word in the dictionary database beginning with that letter.

Actions (login required)