101 search results - page 16 / 21 » On String Matching in Chunked Texts |
SPIRE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
CPM
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
KI
2009
Springer
14 years 2 months ago
2009
Springer
Temporal expressions are important structures in natural language. In order to understand text, temporal expressions have to be extracted and normalized. In this paper we present a...
SPIRE
2000
Springer
13 years 11 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...