481 search results - page 21 / 97 » Learning relational probability trees |
113
click to vote
MLCW
2005
Springer
15 years 5 months ago
2005
Springer
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 ...
110
click to vote
ALT
2010
Springer
14 years 8 months ago
2010
Springer
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...
VMV
2008
15 years 1 months ago
2008
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 ...
103
click to vote
AAAI
2011
13 years 12 months ago
2011
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...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
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...