478 search results - page 24 / 96 » Context-Sensitive Dependency Pairs |
137
click to vote
NAACL
2010
14 years 9 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
118
click to vote
JMLR
2011
14 years 6 months ago
2011
A strong inductive bias is essential in unsupervised grammar induction. In this paper, we explore a particular sparsity bias in dependency grammars that encourages a small number ...
107
click to vote
SIGIR
2005
ACM
15 years 5 months ago
2005
ACM
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
NIPS
2008
15 years 1 months ago
2008
We consider the problem of transforming a signal to a representation in which the components are statistically independent. When the signal is generated as a linear transformation...
183
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...