12 search results - page 3 / 3 » Leaf languages and string compression |
CORR
1998
Springer
13 years 4 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
ICALP
2007
Springer
13 years 8 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...