Sciweavers

1000 search results - page 158 / 200
» Dependency Tree Automata
Sort
View
NAACL
2010
14 years 10 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
94
Voted
EMNLP
2009
14 years 10 months ago
Semi-supervised Speech Act Recognition in Emails and Forums
In this paper, we present a semi-supervised method for automatic speech act recognition in email and forums. The major challenge of this task is due to lack of labeled data in the...
Minwoo Jeong, Chin-Yew Lin, Gary Geunbae Lee
121
Voted
EMNLP
2009
14 years 10 months ago
Unsupervised Semantic Parsing
We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, r...
Hoifung Poon, Pedro Domingos
116
Voted
ICASSP
2011
IEEE
14 years 4 months ago
An optimization algorithm of independent mean and variance parameter tying structures for HMM-based speech synthesis
This paper proposes a technique for constructing independent parameter tying structures of mean and variance in HMMbased speech synthesis. Conventionally, mean and variance parame...
Shinji Takaki, Keiichiro Oura, Yoshihiko Nankaku, ...
111
Voted
ICASSP
2011
IEEE
14 years 4 months ago
An atlas-based deep brain structure segmentation method: from coarse positioning to fine shaping
Segmentation of deep brain structures is a challenging task for MRI images due to blurry structure boundaries, small object size and irregular shapes. In this paper, we present a ...
Yishan Luo, Albert C. S. Chung