12 search results - page 1 / 3 » spire 2001 |
SPIRE
2001
Springer
13 years 9 months ago
2001
Springer
SPIRE
2001
Springer
13 years 9 months ago
2001
Springer
We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path fr...
SPIRE
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper examines a conflation method based on the N-grams approach and evaluates its performance relative to the results achieved by other techniques such as Porter a...
SPIRE
2001
Springer
13 years 9 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
SPIRE
2001
Springer
13 years 9 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...