SENTENCE ANALYSIS WITH ARTIFICIAL INTELLIGENCE MACHINE LEARNING USING FINITE STATE AUTOMATA
Abstract
misinterpretation and different meaning. The basic sentence pattern consists of subject,
predicate, and object (SPO). To analyze the sentence, this project implements Finite State
Automata (FSA) algorithm, which is useful to identify the class of words in a sentence.
The given sentence processed through parsing process to break down the sentence into
array of tokens. The program will then examine the tokens to determine the class of each
word. The discovered pattern will be checked against existing vocabularies on the
database. If the word exists, the program will return a response in accordance to the
existing one. Otherwise, the program will store the word onto a temporary file until it find
the class of the word.
The Intelligence of the program depends on the number of vocabularies on the database.
This program supports learning process, so the more sentences given, the more intelligent
it gets.
Keywords
Full Text:
PDFReferences
Gopalakrishnan, Computation Engineering : Applied Automata Theory and
Logic, Ganesh, New York : Springer, 2006.
Gorys, Tata Bahasa Rujukan Bahasa Indonesia, Jakarta: PT Gramedia.
Hopcroft, John E. et al, Introduction to Automata Theory, Languages, and
Computation, 2nd Edition, New York: Addison-Wesley, 2001.
Kosasih, Dr.E., Kompetensi Ketatabahasaan dan Kesusastraan, Bandung:
CV YramaWidya, 2003.
Kusno, B.S., Tata Bahasa Indonesia, Bandung: CV Rosda. 1985.
Ramlan, M., Sintaksis. Yogyakarta: CV Karyono. 1987.
Sudaryanto, Predikat Objek dalam Bahasa Indonesia, Yogyakarta:
Djambatan.
Sugono, Dendy, Berbahasa Indonesia dengan Benar. Jakarta: Puspa Swara.
Tarigan, Henry Guntur, Prinsip-prinsip Dasar Sintaksis, Bandung: Angkasa.
HeruCahyaRustamadji, Teori Bahasa dan Otomata, Fakultas Teknik
Industri Universitas Pembangunan Nasional, 2004.
DOI: https://doi.org/10.24167/proxies.v1i1.926
Copyright (c)
View My Stats