Results 21 to 30 of about 82 (75)
, 2017 Bahasa ialah komunikasi yang paling lengkap dan efektif untuk menyampaikan ide, pesan, maksud, perasaan dan pendapat kepada orang lain. Suatu tata bahasa harus bisa dibuktikan secara ilmiah oleh setiap orang, di setiap tempat dan pada setiap waktu.
Saepudin, Aep
core
Generator Pohon Untuk Grammar Berbasis Algoritma Couke Younger Kasami
, 2016 Syntactic analysis is a series of processes in order to validate a string that is received by a language. In this section it is often difficult to be explained properly, especially when making the rules up into a tree decline valid received by language ...
Susanto, Ajib, Wijanarto, Wijanarto
core
, 2016 Pada penelitian ini akan dibahas mengenai perbaikan kesalahan kata dan pola kalimat menggunakan algoritma Levenshtein dan CYK. Algoritma CYK merupakan salah satu algoritma yang dapat mengenali apakah sebuah string dapat dikatakan sebagai kalimat yang ...
Faras Wahyudipraja, Mochamad
core
Terminator Detection by Support Vector Machine Utilizing a Stochastic Context-Free Grammar
, 2020 A 2-stage detector was designed to find rho-independent transcription terminators in the Escherichia coli genome. The detector includes a Stochastic Context Free Grammar (SCFG) component and a Support Vector Machine (SVM) component.
Nello Cristianini, Patricia Francis-Lyon
core
, 2019 Práca sa zaoberá štúdiom niekoľkých metód syntaktickej analýzy, obzvlášť najmä Cocke-Younger-Kasami algoritmu. Ďalej je navrhnutý spôsob paralelizácie tohto algoritmu a jeho implementácia v jazyku C++. Na dosiahnutie paralelizácie boli použité vlákna.
Holko, Maroš
core
Design and Implementation of a Probabilistic Chinese Parser
, 2014 摘要 近年來，有許多人利用句法剖析（parsing）作為人機介面的資料搜尋、關鍵字擷取及電腦作自動翻譯等應用。所以句法剖析在語言處理的許多方面皆是不可或缺的一環。 自然語言處理的領域裡，句法剖析是一個公認的困難問題。在過去研究中，剖析器（parser）利用從樹庫（treebank）中訓練出來的Probabilistic Context-Free Grammar（PCFG）來對句子做剖析是很常用的技術。本文中所實作的剖析器（parser）是利用從中研院句結構樹庫（Sinica treebank ...
許燦煌, Shiu, Tsan Huang
core
Approximately Matching Context-Free Languages
, 1995 Given a string w and a pattern p, approximate pattern matching merges traditional sequence comparison and pattern matching by asking for the minimum difference between w and a string exactly matched by p.
Gene Myers
core
Proof of Time Bounds for Recognizing Unambiguous and LR(k) Grammars Using Earley's Algorithm
, 2007 This paper is meant to present a different proof of the time bounds for Earley 's algorithm for parsing context-free grammars. Often these proofs are difficult to follow, and it is helpful to the reader to be able to see different approaches to a ...
Matthew Wong
core
Human behavior understanding using video analysis
, 2016 In this study we proposed a new hierarchical architecture for solution of human behavior understanding problem. A new dataset, namely football video game (FVG) dataset, is generated which involves activities more complex than any other dataset present in
CELAL ONUR GÖKÇE
core
Video analizi ile insan davranışı anlama.
, 2016 In this study we proposed a new hierarchical architecture for solution of human behavior understanding problem. A new dataset, namely football video game (FVG) dataset, is generated which involves activities more complex than any other dataset present in
Gökçe, Celal Onur
core