656 search results - page 66 / 132 » Marrying Words and Trees |
187
click to vote
PR
2010
15 years 29 days ago
2010
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
173
click to vote
RECOMB
2009
Springer
16 years 6 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
164
Voted
MFCS
1998
Springer
15 years 10 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
159
click to vote
EACL
2003
ACL Anthology
15 years 7 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
164
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Users of topic modeling methods often have knowledge about the composition of words that should have high or low probability in various topics. We incorporate such domain knowledg...