Hasil Pencarian  ::  Simpan CSV :: Kembali

"Parsing merupakan suatu pengujian apakah sebuah string ada dalam bahasa untuk suatu grammar atau tidak. Dan bila string itu ada, maka bagaimana pembentukan (derivasi) string tersebut diketahui. Dalam tugas akhir ini, akan dibahas parsing suatu subklas dari context-free grammar yaitu grammar LL(k)."

"An examination of the role of syntax in theories of sentence comprehension."

"This book examines the role of syntax in theories of sentence comprehension, and argues for a distinct processing component which is devoted to the recovery of syntactic structure and which utilizes the contrasting types of information found within a Government-Binding grammar. Paul Gorrell contrasts the primary relations (dominance and precedence) and secondary relations (case assignment, theta-role assignment, etc.) in a phrase-structure tree, and shows how this computational distinction of information types is reflected in the internal structure of the parser, which consists of two subcomponents: a structure builder (responsible for creating nodes in a tree and positing primary relations between them), and a structure interpreter (responsible for analyzing the tree in terms of secondary relations). This model can also predict gardenpath phenomena in the processing of verb-final clauses."

"Pada skripsi ini akan membahas mengenai pengimplementasi pendeteksian pengulangan kata menggunakan Cosine Similarity, sedangkan untuk melihat makna antar kalimat akan dilakukan pembobotan kalimat yang sebelumnya di lakukan proses parsing, stemming, stopword dan melakukan pemisahan antar kalimat. Metode stemming yang akan digunakan adalah metode stemming Arifin-Setiono, proses stemming digunakan untuk mencari kata dasar dari setiap kata pada jawaban dan kemudian dibandingkan dengan kata yang ada pada database. Jika antar kalimat masing-masing dibandingkan dan memiliki nilai cosine similarity lebih dari 0.5 maka sistem tambahan akan menghapus satu kalimat tersebut. Waktu proses antara sistem SIMPLE-O murni lebih cepat jika dibandingkan dengan SIMPLE-O dengan pendeteksian kata yang berulang antar kalimat dengan selisih waktu 0.22 detik. Korelasi nilai antara SIMPLE-O+Cosine dengan Human Raters adalah yaitu sebesar 0.38 untuk soal nomor satu dan untuk soal nomor dua memiliki nilai korelasi yang bernilai negatif 0.08 , untuk soal tiga 0.13, untuk soal empat 0.65 dan 0.022 untuk soal nomor lima.

---

In this paper will discuss the use of word repetition detection implement Cosine Similarity, while to see the meaning of the sentence will be weighted between sentences previously performed process of parsing , stemming , stopword and separation between sentences . Stemming method to be used is a method of stemming Arifin - Setiono , stemming process used to find root of each word in student answer , and then compared with of the word database . If the inter- sentence and has been compared and have value of cosine similarity more than 0.5 , the additional features on the system will remove a sentence . The time between system processes SIMPLE - O more fast when compared with SIMPLE-O with additional features on the system that will repetitive detection word sentence with a time difference between 0.22 seconds. The correlation value of the Human Raters with the SIMPLE-O + Cosine is 0.383 for the first question, -0.08 for the second question, 0.13 for the third question, 0.65 for the fourth question and 0.02 for the fifth question."

"Tugas akhir ini membahas tantang masalah yang terdapat pada Desain Database yaitu: Hubungan antara Struktur Functional Dependencies dan Struktur Dekomposisi. Hubungan tersebut diper1ihatkan melalui saturated set yang terdapat pada Funrtional Dependencies dan konsep antiroot (dibatasi hanya untuk non-trivial antiroot) yang terdapat pada Struktur Dekomposisi."

"This paper reports a preliminary work on using an aspect oriented attribute grammar system called UU-AG to develop computer aided verification tools. UU_AG provides an abstract and modular way to develop such a tool and later on incrementally upgrade them. This paper shows an example of a toy programming logic implemented in UU_AG. We will show the implementation of the verification condition generator (VCG). We extend the implementation with a new feature such as run-time-trace generator to validate the computation of the implemented inference engine."