We improve the fastest known algorithm for approximate string matching, whi
ch can be used only for low error levels. By using a new method to verify p
otential matches and a new optimization technique for biased texts (such as
English), the algorithm also becomes the fastest one for medium error leve
ls. This includes most of the interesting cases in this area. (C) 1999 Publ
ished by Elsevier Science B.V. All rights reserved.