Sciweavers

34 search results - page 5 / 7
» Forest-based Tree Sequence to String Translation Model
Sort
View
ACL
2010
13 years 6 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
CSL
1999
Springer
13 years 8 months ago
A hidden Markov-model-based trainable speech synthesizer
This paper presents a new approach to speech synthesis in which a set of cross-word decision-tree state-clustered context-dependent hidden Markov models are used to define a set o...
R. E. Donovan, Philip C. Woodland
MT
2010
100views more  MT 2010»
13 years 7 months ago
Exploiting syntactic relationships in a phrase-based decoder: an exploration
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drastically oversimplified reordering models. Syntactically aware models make it pos...
Tim Hunter, Philip Resnik
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 27 days ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 8 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný