| Alternate document: Details Fast Diagnosis Of Integrated Circuit Faults Using Feedforward Neural Networks (91) J. Meador A. Wu C.T. Tseng and T.S. Lin Department |
Department Of Computer Science Sun Wu and Udi Manber Fast Text Searching With ...  Home/Search
Context Related
| utk.edu/~cs494/readinglis...agrep.1.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utk.edu/~cs494/readinglist/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Searching for a pattern in a text file is a very common operation in many applications ranging from text editors and databases to applications in molecular biology. In many instances the pattern does not appear in the text exactly. Errors in the text or in the query can result from misspelling or from experimental errors (e.g., when the text is a DNA sequence). The use of such approximate pattern matching has been limited until now to specific applications. Most text editors and searching... (Update)
Context of citations to this paper: More
...to ababab correcting the reversal of the last two symbols. There have been a number of approaches to error tolerant recognition, e.g. [19, 12]. These are however suited for applications where the pattern or the regular expression is small, and the sequence to be matched is...
...or depending on the length of the query term. In order to compute the Levenshtein distance, efficient implementations exist (see [12]) Nevertheless its complexity is O(N) due to the necessity of linear scanning. 2.4.2 Modified Levenshtein distance The basic Levenshtein...
Cited by: More
An Evaluation of Phonetic Spell Checkers - Hodge, Austin (2001) (Correct)
Approximate Pattern Matching with Samples - Takaoka (1994) (Correct)
Agrep - A Fast Approximate Pattern-Matching Tool - Wu, Manber (1992) (Correct)
Active bibliography (related documents): More All
0.2: Discrete Pattern Matching Over Sequences And Interval Sets - Knight (1996) (Correct)
0.1: Serial Computations of Levenshtein Distances - Hirschberg (1997) (Correct)
0.1: String Editing and Longest Common Subsequences - Apostolico (1996) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: GLIMPSE: A Tool to Search Through Entire File Systems - Manber (1994) (Correct)
0.1: Finding Similar Files in a Large File System - Udi Manber (1994) (Correct)
0.1: A Sub-quadratic Algorithm for Approximate Limited Expression .. - Wu, Manber, Myers (1992) (Correct)
Related documents from co-citation: More All
6: A fast string searching algorithm (context) - Boyer - 1977
6: Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
5: Approximate Matching of Regular Expressions (context) - Myers, Miller - 1989
BibTeX entry: (Update)
Sun Wu and Udi Manber. "Fast Text Searching With Errors." Tech. Report TR-9111. University of Arizona, Department of Computer Science (1991). http://citeseer.ist.psu.edu/wu91fast.html More
@techreport{ wu91fast,
author = "S. Wu and U. Manber",
title = "Fast text searching with errors",
number = "TR-91-11",
year = "1991",
url = "citeseer.ist.psu.edu/wu91fast.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft - 1979
347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
214 A fast string searching algorithm (context) - Boyer - 1977
121 Handbook of Algorithms and Data Structures (context) - Gonnet, Baeza-Yates - 1991
114 Finding approximate patterns in strings (context) - Ukkonen - 1985
92 Algorithms for approximate string matching (context) - Ukkonen - 1985
83 Approximate string matching (context) - Hall - 1980
81 A new approach to text searching (context) - Baeza-Yates - 1989
71 An improved algorithm for approximate string matching (context) - Galil - 1990
60 Fast parallel and serial approximate string matching (context) - Landau - 1989
45 Approximate matching of regular expressions (context) - Myers - 1989
43 Data structures and algorithms for approximate string matchi.. (context) - Galil - 1988
35 Fast string matching with k differences (context) - Landau - 1988
32 Approximate string matching in sublinear expected time (context) - Chang
29 Binary codes capable of correcting deletions, insertions, an.. (context) - Levenshtein - 1966
16 Approximate Boyer-Moore string matching (context) - Tarhio - 1990
13 An O(ND) difference algorithm and its variations - Myers - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utk.edu/~cs494/reading-list/): More
Combining Automatic and Manual Index Representations in.. - Rajashekar, Croft (1995) (Correct)
Technology Overview: A Report on Data Mining - Decker, al. (1995) (Correct)
The INQUERY Retrieval System - Callan, Croft, Harding (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC