Sciweavers

11 search results - page 2 / 3
» Structural Correspondence Learning for Parse Disambiguation
Sort
View
JMLR
2012
11 years 7 months ago
Joint Learning of Words and Meaning Representations for Open-Text Semantic Parsing
Open-text semantic parsers are designed to interpret any statement in natural language by inferring a corresponding meaning representation (MR – a formal representation of its s...
Antoine Bordes, Xavier Glorot, Jason Weston, Yoshu...
ICASSP
2010
IEEE
13 years 5 months ago
Learning deep rhetorical structure for extractive speech summarization
Extractive summarization of conference and lecture speech is useful for online learning and references. We show for the first time that deep(er) rhetorical parsing of conference ...
Justin Jian Zhang, Pascale Fung
NIPS
2001
13 years 6 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning
ML
1998
ACM
139views Machine Learning» more  ML 1998»
13 years 4 months ago
The Hierarchical Hidden Markov Model: Analysis and Applications
We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our m...
Shai Fine, Yoram Singer, Naftali Tishby
JMLR
2008
230views more  JMLR 2008»
13 years 4 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...