Sciweavers

2944 search results - page 149 / 589
» On Well Quasi-orders on Languages
Sort
View
CACM
2011
120views more  CACM 2011»
14 years 7 months ago
The sequence memoizer
We propose an unbounded-depth, hierarchical, Bayesian nonparametric model for discrete sequence data. This model can be estimated from a single training sequence, yet shares stati...
Frank Wood, Jan Gasthaus, Cédric Archambeau...
109
Voted
COLING
2010
14 years 7 months ago
A Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
Smaranda Muresan
ECEASST
2010
14 years 7 months ago
MySQL4OCL: A Stored Procedure-Based MySQL Code Generator for OCL
In this paper we introduce a MySQL code generator for a significant subset of OCL expressions which is based on the use of stored procedures for mapping OCL iterators. Our code gen...
Marina Egea, Carolina Dania, Manuel Clavel
69
Voted
INTERSPEECH
2010
14 years 7 months ago
Search by voice in Mandarin Chinese
In this paper we describe our efforts to build a Mandarin Chinese voice search system. We describe our strategies for data collection, language, lexicon and acoustic modeling, as ...
Jiulong Shan, Genqing Wu, Zhihong Hu, Xiliu Tang, ...
82
Voted
INTERSPEECH
2010
14 years 7 months ago
Fully automatic segmentation for prosodic speech corpora
While automatic methods for phonetic segmentation of speech can help with rapid annotation of corpora, most methods rely either on manually segmented data to initially train the p...
Sarah Hoffmann, Beat Pfister