Sciweavers

81 search results - page 6 / 17
» Decision Tree Parsing using a Hidden Derivation Model
Sort
View
ACL
2010
14 years 9 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom
DIS
2001
Springer
15 years 4 months ago
Functional Trees
In the context of classification problems, algorithms that generate multivariate trees are able to explore multiple representation languages by using decision tests based on a com...
Joao Gama
ACL
2012
13 years 2 months ago
Selective Sharing for Multilingual Dependency Parsing
We present a novel algorithm for multilingual dependency parsing that uses annotations from a diverse set of source languages to parse a new unannotated language. Our motivation i...
Tahira Naseem, Regina Barzilay, Amir Globerson
CSL
2007
Springer
14 years 11 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
90
Voted
ESANN
2001
15 years 1 months ago
Transfer functions: hidden possibilities for better neural networks
Abstract. Sigmoidal or radial transfer functions do not guarantee the best generalization nor fast learning of neural networks. Families of parameterized transfer functions provide...
Wlodzislaw Duch, Norbert Jankowski