101 search results - page 1 / 21 » On String Matching in Chunked Texts |
WIA
2007
Springer
14 years 1 months ago
2007
Springer
IPL
2008
13 years 7 months ago
2008
![Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time")
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
GFKL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...