773 search results - page 22 / 155 » Suffix Trees on Words |
113
click to vote
ENTCS
2008
15 years 1 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
102
click to vote
TVCG
2008
15 years 1 months ago
2008
We introduce the Word Tree, a new visualization and information-retrieval technique aimed at text documents. A word tree is a graphical version of the traditional "keyword-in-...
105
click to vote
EMNLP
2008
15 years 3 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
109
click to vote
AAAI
1994
15 years 3 months ago
1994
We apply decision tree induction to the problem of discourse clue word sense disambiguation. The automatic partitioning of the training set which is intrinsic to decision tree ind...
108
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...