Applications of approximate word matching in information retrieval

By J. French, Allison L. Powell, E. Schulman. 1997

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

SIGMa: simple greedy matching for aligning large knowledge bases (2012, methodology): “ this measure is not robust to small typos or small changes of spelling of words. This problem could be addressed by using more involved string similarity measures such as approximate string matching [10,25], which handles both word corruption as well as word reordering, though our current implement”
A guided tour to approximate string matching (2001, unknown): “Good references about the relation of approximate string matching and information retrieval are Wagner and Fisher [1974], Lowrance and Wagner [1975], Nesbit [1986], Owolabi and McGregor [1988], Kukich [1992], Zobel and Dart [1996], French et al. [1997], and BaezaYates and Ribeiro-Neto [1999].”