101 search results - page 5 / 21 » On String Matching in Chunked Texts |
ISAAC
1994
Springer
13 years 11 months ago
1994
Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
DLT
2004
13 years 8 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
ALENEX
2007
13 years 9 months ago
2007
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
FUIN
2006
13 years 7 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...