Sciweavers

66 search results - page 2 / 14
» An Optimal Tabular Parsing Algorithm
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
13 years 9 months ago
Decomposition of timed decision tables and its use in presynthesis optimizations
Presynthesis optimizations transform a behavioral HDL description into an optimized HDL description that results in improved synthesis results. In this paper we introduce the decom...
Jian Li, Rajesh K. Gupta
NAACL
2010
13 years 3 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
ACTA
2000
302views more  ACTA 2000»
13 years 5 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
WABI
2007
Springer
110views Bioinformatics» more  WABI 2007»
13 years 11 months ago
Haplotype Inference Via Hierarchical Genotype Parsing
The within-species genetic variation due to recombinations leads to a mosaic-like structure of DNA. This structure can be modeled, e.g. by parsing sample sequences of current DNA w...
Pasi Rastas, Esko Ukkonen
ENTCS
2010
122views more  ENTCS 2010»
13 years 2 months ago
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
Trevor Jim, Yitzhak Mandelbaum