63 Hits in 3.7 sec

Experience, representations and the production of second language allophones

Christine E Shea, Suzanne Curtin
2011 Second Language Research  
In this paper we discuss sequential and parallel versions of the Cocke-Younger-Kasami (CYK) parsing algorithm.  ...  The algorithms that are considered turn out to be suitable for implementations ranging from environments with a small number of asynchronous processors to environments consisting of a large array of highly  ...  Presently it has become customary to use the name Cocke-Y ounger-Kasami* algorithm.  ... 
doi:10.1177/0267658310375753 fatcat:gqbg3awtmbeqtn7a5xpxw5ehoe

Page 5381 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
In this paper we introduce the family, give its gener- ating grammars, and present a polynomial-time parsing algorithm, which is an extension of the Cocke-Kasami-Younger algorithm for context-free languages  ...  ISBN 0-8176-3654-4 This book is the second and revised edition of a monograph which appeared under the same title in 1986 [Pitman, London, 1986; MR 87k:68002].  ... 

Two dynamic programming algorithms for which interpreted pebbling helps

H. Venkateswaran
1991 Information and Computation  
We consider extensions of one-person and two-person pebble games that take into account the types of the gates of the circuits on which the games are played.  ...  A simple relationship is established between the extended games and the corresponding original games.  ...  My grateful thanks are also due to the two anonymous referees whose critical comments and suggestions have helped in revising this paper.  ... 
doi:10.1016/0890-5401(91)90010-y fatcat:deoln2562bgjrghmqwrmnn56wa

Visual Report Generation Tool for Grammar-Based Classifier System

Olgierd Unold, Agnieszka Kaczmarek, Łukasz Culer
2017 International Journal of Machine Learning and Computing  
Grammar-based Classifier System (GCS) is one of the evolutionary approached context-free grammar induction methods.  ...  In the present paper we aim to present a reporting tool, created to facilitate analysis and conclusion drawing by presenting learning data in a neat and readable form, yet fully conveying its complexity  ...  The core of the system is CYK (Cocke-Younger-Kasami) parser [5] , which enables checking whether the set of rules can parse the input example.  ... 
doi:10.18178/ijmlc.2017.7.6.642 fatcat:lfozbmf3jrbmbpcgnpf32ivdtq

FUNCTIONAL PEARL Functional chart parsing of context-free grammars

2004 Journal of functional programming  
This makes the code clean, elegant and declarative, while still having the same space and time complexity as the standard imperative implementations.  ...  This is one of the many chart parsing variants, which are all based on the data structure of charts.  ...  This paper is a revised version of chapter 5 from Ljunglöf (2002) . I am grateful to Aarne Ranta, Paul Callaghan, and three anonymous referees for many helpful comments and suggestions.  ... 
doi:10.1017/s0956796804005106 fatcat:ucfzcty47bg7neloj4yu2ujpgi

Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar [chapter]

Seiichi Toyota, Seiichi Uchida, Masakazu Suzuki
2006 Lecture Notes in Computer Science  
The proposed method consists of three steps. In the first step, a fast structural analysis algorithm is performed on each mathematical formula to obtain a tree representation of the formula.  ...  If the onedimensional representation is not accepted by the grammar, the result of the analysis step is detected as an erroneous result and alarmed to OCR users.  ...  Acknowledgement This research is supported by the Kyushu University 21st Century COE Program: "Development of Dynamic Mathematics with High Functionality".  ... 
doi:10.1007/11669487_14 fatcat:r43ka6gmlnes3m2ndbbjajz2ve

Augmented incremental recognition of online handwritten mathematical expressions

Khanh Minh Phan, Anh Duc Le, Bipin Indurkhya, Masaki Nakagawa
2018 International Journal on Document Analysis and Recognition  
In the first process, the segmentation and the recognition by Cocke-Younger-Kasami (CYK) algorithm are only executed for the latest stroke.  ...  It shortens the waiting time but degrades the recognition rate due to the limited context.  ...  [3] , who won the first prize at CROHME 2011, second prize at CROHME 2013 and CHROME 2014, modified the Cocke-Younger-Kasami (CYK) parsing algorithm to parse an input OHME in 2 dimensions (2D) under  ... 
doi:10.1007/s10032-018-0306-1 fatcat:ticbapa52zd7pn2xf2jbi5jygy

Automatic Generation of Programs [chapter]

Ondej Popelka, Ji tastn
2011 Advances in Computer Science and Engineering  
Cocke-Younger-Kasami algorithm (Kasami, 1965) , which grants that the time of analysis is proportional to third power of string length; -Top-down parsing -We begin from initial symbol and we are trying  ...  The fitness function is the key feature of genetic algorithm, since the genetic algorithm performs the minimization of this function.  ...  The book Advances in Computer Science and Engineering constitutes the revised selection of 23 chapters written by scientists and researchers from all over the world.  ... 
doi:10.5772/16012 fatcat:uawswgol6bexvbb25gwh4mhlsi


2004 Current Trends in Theoretical Computer Science  
Several theoretical results on their properties have been obtained since then, and a number of efficient parsing algorithms that justify the practical value of the concept have been developed.  ...  Conjunctive grammars were introduced in 2000 as a generalization of context-free grammars that allows the use of an explicit intersection operation in rules.  ...  A recognition algorithm Conjunctive grammars in the binary normal form can be parsed using an extension of the Cocke-Kasami-Younger algorithm [13] .  ... 
doi:10.1142/9789812562494_0064 fatcat:ukdx344tsvgivnvgpu75sqw42u

Principles and implementation of deductive parsing

Stuart M. Shieber, Yves Schabes, Fernando C.N. Pereira
1995 The Journal of Logic Programming  
Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser.  ...  algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars.  ...  The authors would like to thank the anonymous reviewers for their helpful comments on an earlier draft.  ... 
doi:10.1016/0743-1066(95)00035-i fatcat:ja6qi5hsmnconkele2u7arh7hy

Principles and Implementation of Deductive Parsing [article]

Stuart M. Shieber, Yves Schabes (Mitsubishi Electric Research Laboratories), Fernando C. N. Pereira (AT&T Bell Laboratories)
1994 arXiv   pre-print
Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser.  ...  We present a system for generating parsers based directly on the metaphor of parsing as deduction.  ...  The authors would like to thank the anonymous reviewers for their helpful comments on an earlier draft.  ... 
arXiv:cmp-lg/9404008v1 fatcat:ca6kzfys6vegvf356wrne46iba

Automata Tutor v3 [chapter]

Loris D'Antoni, Martin Helfrich, Jan Kretinsky, Emanuel Ramneantu, Maximilian Weininger
2020 Lecture Notes in Computer Science  
We also present the results of a survey run on a class of 950 students, which shows very positive results about the usability and usefulness of the tool.  ...  ; the TUM fund "Verbesserung der Lehrmittelsituation" and the CAV community for caring about good teaching.  ...  CYK: Given a context free grammar in CNF and a word, the student has to decide whether the word is in the language of the grammar by using the Cocke-Younger-Kasami algorithm.  ... 
doi:10.1007/978-3-030-53291-8_1 fatcat:ucwguvt7lvgfziazphj4l6eulm


2011 Journal of Bioinformatics and Computational Biology  
Secondary structure remains the most exploitable feature for non-coding RNA (ncRNA) gene finding in genomes.  ...  This paper investigates a novel method, unpaired structural entropy (USE) as a measurement for the structure fold stability of ncRNAs.  ...  We used the Cocke-Younger Kasami(CYK) algorithm to develop an in house CYK program to perform microRNA gene finding called miR-CYK.  ... 
doi:10.1142/s0219720011005495 pmid:21523933 fatcat:v3ckau2yqvexbpmv6iefmjn7cy

Recent methods for RNA modeling using stochastic context-free grammars [chapter]

Yasubumi Sakakibara, Michael Brown, Richard Hughey, Saira Mian, Kimmen Sjölander, Rebecca C. Underwood, David Haussler
1994 Lecture Notes in Computer Science  
Tree-Grammar EM, a generalization of the HMM forward-backward algorithm, is based on tree grammars and is faster than the previously proposed inside-outside SCFG training algorithm.  ...  This paper discusses our new algorithm, Tree-Grammar EM, for deducing SCFG parameters automatically from unaligned, unfolded training sequences.  ...  However, a dynamic programming technique analogous to the Cocke-Younger-Kasami (CYK) or Early parsing methods AU72] for non-stochastic CFGs can complete this task in polynomial time (proportional to the  ... 
doi:10.1007/3-540-58094-8_25 fatcat:3qcr4fdonrax3juwoo3y4cefni

Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint

Jun He, Pierre Flener, Justin Pearson
2013 Journal of Heuristics  
We use the edit-distance based SoftRegular constraint as an example to show that a propagation algorithm that sometimes underestimates the cost may guide the search to incorrect (non-optimal) solutions  ...  To compute correctly the cost for the editdistance based SoftRegular constraint, we present a quadratic-time propagation algorithm based on dynamic programming and a proof of its correctness.  ...  Acknowledgments The authors are supported by Grants 2007-6445 and 2011-6133 of the Swedish Research Council (VR), and Jun He is also supported by Grant 2008-611010 of China Scholarship Council and the  ... 
doi:10.1007/s10732-013-9222-1 fatcat:yhh765qdqzfoxeyk2wrrsdbdyy
« Previous Showing results 1 — 15 out of 63 results