Sciweavers

3270 search results - page 41 / 654
» Approximate String Processing
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
ICDAR
1999
IEEE
13 years 12 months ago
Text/Graphics Separation using Agent-based Pyramid Operations
This paper describes a document image analysis system using multiple agents working on a pyramid structure to separate text from graphics in the image. Text strings appear as diff...
Chew Lim Tan, Bo Yuan, Weihua Huang, Qian Wang, Zh...
APLAS
2006
ACM
14 years 1 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
AIME
2001
Springer
14 years 4 days ago
Using Part-of-Speech and Word-Sense Disambiguation for Boosting String-Edit Distance Spelling Correction
Abstract. We report on the design of a system for correcting spelling errors resulting in non-existent words. The system aims at improving edition of medical reports. Unlike tradit...
Patrick Ruch, Robert H. Baud, Antoine Geissbü...
ISAAC
1994
Springer
91views Algorithms» more  ISAAC 1994»
13 years 11 months ago
A New Problem in String Searching
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...
George Havas, Jin Xian Lian