Approximate String Matching with Address Bit Errors
نویسندگان
چکیده
Motivation In the " old " days: Pattern and text are given in correct sequential order. It is possible that the .content is erroneous New paradigm: Content is exact, but the order of .the pattern symbols may be scrambled Why? Transmitted asynchronously? ? The nature of the application Example:Swaps Tehse kni ds of typing mistakes are very common So when searching for patternThese we are seeking the symbols of the pattern but with an .order changed by swaps Surprisingly, pattern matching with swaps is easier)than pattern matching with mismatches)ACHLP:01
منابع مشابه
Bit-Parallel Approach to Approximate String Matching in Compressed Texts
In this paper, we address the problem of approximate string matching on compressed text. We consider this problem for a text string described in terms of collage system, which is a formal system proposed by Kida et al. (1999) that captures various dictionary-based compression methods. We present an algorithm that exploits bit-parallelism, assuming that our problem fits in a single machine word,...
متن کاملApproximate Multiple Pattern String Matching using Bit Parallelism: A Review
String matching is to find all the occurrences of a given pattern in a large text both being sequence of characters drawn from finite alphabet set. Approximate String Matching involves the detection of correct patterns along with the detection of some wrong patterns inside the text. Bit Parallelism is a feature that can be used to detect patterns inside the text and is reported to result in mor...
متن کاملApproximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string matching algorithms find many applications, such as gazetteers, address matching, and geographic information retrieval. This paper presents a novel method for approximate string matching, developed for the recognition of...
متن کاملSimulation of NFA in Approximate String and Sequence Matching
We present detailed description of simulation of nondeterministic nite automata (NFA) for approximate string matching. This simulation uses bit parallelism and used algorithm is called Shift-Or algorithm. Using knowledge of simulation of NFA by Shift-Or algorithm we design modi cation of ShiftOr algorithm for approximate string matching using generalized Levenshtein distance and modi cation for...
متن کاملA Unified View to String Matching Algorithms
We present a uniied view to sequential algorithms for many pattern matching problems, using a nite automaton built from the pattern which uses the text as input. We show the limitations of deterministic nite automata (DFA) and the advantages of using a bitwise simulation of non-deterministic nite automata (NFA). This approach gives very fast practical algorithms which have good complexity for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2008