Sciweavers

643 search results - page 27 / 129
» Parsing And Derivational Equivalence
Sort
View
CSL
2007
Springer
13 years 7 months ago
Stochastic and syntactic techniques for predicting phrase breaks
Determining the position of breaks in a sentence is a key task for a text-to-speech (TTS) system. We describe some methods for phrase break prediction in which the whole sentence ...
Ian Read, Stephen Cox
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
13 years 11 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
ISIM
2007
13 years 9 months ago
k-Limited Erasing Performed by Scattered Context Grammars
A scattered context grammar, G, erases nonterminals in a k-limited way, where k ≥ 1, if in every sentential form of any derivation, between every two symbols from which G derive...
Jirí Techet
DCC
2004
IEEE
14 years 7 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
JAPLL
2010
104views more  JAPLL 2010»
13 years 6 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx