Sciweavers

136 search results - page 3 / 28
» Learning probabilistic models of tree edit distance
Sort
View
MLCW
2005
Springer
13 years 10 months ago
Textual Entailment Recognition Based on Dependency Analysis and WordNet
The Recognizing Textual Entailment System shown here is based on the use of a broad-coverage parser to extract dependency relationships; in addition, WordNet relations are used to ...
Jesús Herrera, Anselmo Peñas, Felisa...
TCS
2008
13 years 4 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 6 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
ICML
2005
IEEE
14 years 5 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
ICCV
2005
IEEE
14 years 7 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu