4 search results - page 1 / 1 » Combinatorics of Finite Words and Suffix Automata |
CAI
2009
Springer
13 years 11 months ago
2009
Springer
CPM
1999
Springer
13 years 9 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
STRINGOLOGY
2008
13 years 6 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
ACL
2004
13 years 6 months ago
2004
Parsing systems which rely on hand-coded linguistic descriptions can only perform adequately in as far as these descriptions are correct and complete. The paper describes an error...