Sciweavers

481 search results - page 21 / 97
» Learning relational probability trees
Sort
View
MLCW
2005
Springer
14 years 1 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...
ALT
2010
Springer
13 years 4 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
VMV
2008
107views Visualization» more  VMV 2008»
13 years 9 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
AAAI
2011
12 years 7 months ago
Tree Sequence Kernel for Natural Language
We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capabili...
Jun Sun, Min Zhang, Chew Lim Tan
ECML
2006
Springer
13 years 11 months ago
TildeCRF: Conditional Random Fields for Logical Sequences
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
Bernd Gutmann, Kristian Kersting