Sciweavers

75 search results - page 11 / 15
» Feature Lattices for Maximum Entropy Modelling
Sort
View
NAACL
2010
13 years 4 months ago
A Direct Syntax-Driven Reordering Model for Phrase-Based Machine Translation
This paper presents a direct word reordering model with novel syntax-based features for statistical machine translation. Reordering models address the problem of reordering source...
Niyu Ge
ICASSP
2011
IEEE
12 years 10 months ago
Deep belief nets for natural language call-routing
This paper considers application of Deep Belief Nets (DBNs) to natural language call routing. DBNs have been successfully applied to a number of tasks, including image, audio and ...
Ruhi Sarikaya, Geoffrey E. Hinton, Bhuvana Ramabha...
ICML
2004
IEEE
14 years 4 days ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
CIKM
2006
Springer
13 years 10 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
EMNLP
2008
13 years 8 months ago
Two Languages are Better than One (for Syntactic Parsing)
We show that jointly parsing a bitext can substantially improve parse quality on both sides. In a maximum entropy bitext parsing model, we define a distribution over source trees,...
David Burkett, Dan Klein