Results 11 to 20 of about 82 (75)

Watson–Crick context-free grammars: Grammar simplifications and a parsing algorithm [PDF]

open access: yes, 2018
A Watson–Crick (WK) context-free grammar, a context-free grammar with productions whose right-hand sides contain nonterminals and double-stranded terminal strings, generates complete double-stranded strings under Watson–Crick complementarity.
Mohamad Zulkufli, Nurul Liyana   +3 more
core   +1 more source

ALGORITMA COCKE YOUNGER KASAMI UNTUK DETEKSI STRUKTUR KALIMAT DAN MEREKOMENDASIKANYA MENGGUNAKAN ALGORITMA DAMERAU LEVENSHTEIN DISTANCE

open access: yes, 2020
Penggunaan kata baku dan struktur kalimat merupakan salah satu syarat dalam penulisan laporan penelitian, tanpa disadari kesalahan penulisan dapat terjadi baik berupa kesalahan pengetikan maupun pada struktur kalimat, beberapa penyebabnya ialah kebiasaan
Rustamadji, Heru Cahya   +2 more
core   +2 more sources

Augmented incremental recognition of online handwritten mathematical expressions [PDF]

open access: yes, 2018
This paper presents an augmented incremental recognition method for online handwritten mathematical expressions (MEs). If an ME is recognized after all strokes are written (batch recognition), the waiting time increases significantly when the ME becomes ...
Bipin Indurkhya   +7 more
core   +1 more source

Terminator Detection by Support Vector Machine Utilizing aStochastic Context-Free Grammar [PDF]

open access: yes, 2006
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.
Francis-Lyon, Patricia   +5 more
core   +1 more source

The CYK approach to serial and parallel parsing [PDF]

open access: yes, 1990
Traditional parsing methods for general context-free grammars have been re-investigated in order to see whether they can be adapted to a parallel processing view. In this paper we discuss sequential and parallel versions of the Cocke-Younger-Kasami (CYK)
Nijholt, Anton, Nijholt, Anton; id_orcid
core  

Certifying Time Complexity of Agda Programs Using Complexity Signatures

open access: yes, 2020
Danielsson and others have shown that by annotating functions it becomes possible to perform time complexity analysis in functional languages, however the idea of how little annotation is necessary has not been explored.This paper describes a small ...
Møllnitz, Christian Bach   +2 more
core  

Analisis Perbandingan Algoritma (Left-Corner-Parsing Dan Algoritma CYK (Cocke-Younger-Kasami)Untuk Memeriksa Pola Kalimat Baku Bahasa Indonesia

open access: yes, 2016
Seorang penulis harus memperhatikan pola kalimat dalam bahasa tulisan, karena pola kalimat akan berpengaruh dalam proses penyampaian dan penerima pesan. Berdasarkan pola dasarnya, bahasa indonesia mengenal beberapa pola kalimat (1) S-P, (2) S-P-O, (3) S ...
Susanti, Sri
core  

Clasificación de lenguajes naturales en la Jerarquía de Chomsky: lenguajes regulares e independientes de contexto

open access: yes, 2022
En este texto se estudia la clasificación de lenguajes naturales como el inglés, español, neerlandés y suizo-alemán en la Jerarquía de Chomsky. Este problema se aborda desde la teoría de la computación (específicamente, la teoría de los autómatas y ...
Pérez Díaz, Andrés Felipe
core  

Parallel Multigenerative Cocke-Younger-Kasami-Based Parsing

open access: yes, 2011
S analýzou řetězců, hledáním vzorů a kontrolou syntaktické správnosti se setkáváme každý den, ať jde o programovací jazyky, komunikační protokoly či psaný text.
Sopuch, Zbyněk
core  

Recognition of online handwritten mathematical expressions

open access: yes, 2015
The thesis focuses on the recognition of online handwritten mathematical expressions. The main contribution is the development of a system for the recognition of online handwritten mathematical expressions.
Simistira, Foteini   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy