17 search results - page 3 / 4 » The Complexity of Recognition of Linguistically Adequate Dep... |
ACL
2009
13 years 4 months ago
2009
We present a novel approach to deciding whether two sentences hold a paraphrase relationship. We employ a generative model that generates a paraphrase of a given sentence, and we ...
CICLING
2003
Springer
13 years 11 months ago
2003
Springer
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
ACL
2003
13 years 7 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
ICML
2004
IEEE
14 years 7 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
COLING
2010
13 years 1 months ago
2010
An unsupervised discriminative training procedure is proposed for estimating a language model (LM) for machine translation (MT). An English-to-English synchronous context-free gra...