Sciweavers

1388 search results - page 96 / 278
» Querying Linguistic Trees
Sort
View
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
15 years 6 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
89
Voted
COLING
2002
15 years 14 days ago
A Stochastic Parser Based on an SLM with Arboreal Context Trees
In this paper, we present a parser based on a stochastic structured language model (SLM) with a exible history reference mechanism. An SLM is an alternative to an n-gram model as...
Shinsuke Mori
87
Voted
INTERSPEECH
2010
14 years 7 months ago
Context adaptive training with factorized decision trees for HMM-based speech synthesis
To achieve natural high quality synthesised speech in HMMbased speech synthesis, the effective modelling of complex acoustic and linguistic contexts is critical. Traditional appro...
Kai Yu, Heiga Zen, François Mairesse, Steve...
96
Voted
EACL
2003
ACL Anthology
15 years 2 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
123
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Effective error prediction using decision tree for ASR grammar network in call system
CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it st...
Hongcui Wang, Tatsuya Kawahara