Results 181 to 190 of about 6,253 (207)
Some of the next articles are maybe not open access.
Suffix Trees as Language Models
Proceedings of the Language Resources and Evaluation Conference, 2012Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n. We explain these properties of suffix trees, which we leverage for our Suffix Tree Language Model (STLM) implementation and explain how a ...
Redd Kennington, Casey +2 more
openaire +3 more sources
Algorithmica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Kyue Kim, Minhwan Kim, Heejin Park
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Kyue Kim, Minhwan Kim, Heejin Park
openaire +2 more sources
Computing suffix links for suffix trees and arrays
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Random Structures & Algorithms, 2003
AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb.
Devroye, Luc, Neininger, Ralph
openaire +1 more source
AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb.
Devroye, Luc, Neininger, Ralph
openaire +1 more source
Efficient implementation of suffix trees
Software: Practice and Experience, 1995AbstractWe study the problem of string searching using the traditional approach of storing all unique substrings of the text in a suffix tree. The methods of path compression, level compression and data compression are combined to build a simple, compact and efficient implementation of a suffix tree.
Arne Andersson, Stefan Nilsson
openaire +1 more source
Suffix cactus: A cross between suffix tree and suffix array
1995The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.
openaire +1 more source
Suffix trees and string complexity
2007Let s = (s1, s2, ..., sn) be a sequence of characters where si Ɛ Zp for 1 ≤ i ≤ n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s [17, 18].
Luke O'Connor, Tim Snider
openaire +1 more source
On-line construction of suffix trees
Algorithmica, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Bidirectional construction of suffix trees
Nord. J. Comput., 2003Summary: String matching is critical in information retrieval since in many cases information is stored and manipulated as strings. Constructing and utilizing a suitable data structure for a text string, we can solve the string matching problem efficiently. Such a structure is called an index structure.
openaire +2 more sources
On the sorting-complexity of suffix tree construction
Journal of the ACM, 2000Paolo Ferragina +2 more
exaly