Campus Event Calendar
Event Entry
What and Who
Filter Algorithms for Approximate String Matching
Stefan Burkhardt
Max-Planck-Institut für Informatik - AG 1
Promotionskolloquium
AG 1, AG 3
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 19 December 2002
16:00
-- Not specified --
46.1 - MPII
024
Saarbrücken
Contact
Stefan Burkhardt
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Filter algorithms for approximate string matching typically consist of two distinct phases. In the first, the filtration phase, one applies a so-called filter criterion to detect
regions of a subject string that are potentially similar to
the query string. In the second phase, the verification phase, the potential matches are analyzed in order to find the actual matches between query and subject.
We introduce new fliter criteria based on a previously known
approach using exact matching substrings between query and
subject by allowing gaps in the substrings.