773 search results - page 20 / 155 » Suffix Trees on Words |
138
Voted
CORR
2008
Springer
15 years 14 days ago
2008
Springer
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
DLT
2008
15 years 3 months ago
2008
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...
101
click to vote
LREC
2008
15 years 3 months ago
2008
This paper presents a context sensitive spell checking system that uses mixed trigram models, and introduces a new empirically grounded method for building confusion sets. The pro...
139
Voted
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
119
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Query suggestion plays an important role in improving the usability of search engines. Although some recently proposed methods can make meaningful query suggestions by mining quer...