| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wafer (0) - 2 freq afer (1) - 1 freq waffer (1) - 1 freq wa'er (1) - 4 freq safer (1) - 18 freq waer (1) - 2 freq water (1) - 258 freq wager (1) - 9 freq waver (1) - 1 freq wajer (1) - 1 freq oafur (2) - 1 freq mayer (2) - 1 freq refer (2) - 37 freq haver (2) - 6 freq wae- (2) - 2 freq waley (2) - 6 freq afen (2) - 4 freq paper (2) - 526 freq wyfe (2) - 19 freq iffer (2) - 1 freq wake (2) - 100 freq lawer (2) - 10 freq watar (2) - 1 freq walter (2) - 57 freq wife (2) - 818 freq |
wafer (0) - 2 freq water (2) - 258 freq wager (2) - 9 freq waver (2) - 1 freq waer (2) - 2 freq wajer (2) - 1 freq afer (2) - 1 freq safer (2) - 18 freq waffer (2) - 1 freq wa'er (2) - 4 freq saifer (3) - 3 freq waaker (3) - 1 freq wher (3) - 6 freq fifer (3) - 11 freq waeker (3) - 1 freq wer (3) - 220 freq afor (3) - 25 freq wheer (3) - 20 freq waar (3) - 70 freq weer (3) - 68 freq watier (3) - 1 freq wahr (3) - 1 freq affer (3) - 2 freq weyer (3) - 1 freq ufer (3) - 1 freq |
SoundEx code - W160 whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq wyver - 2 freq wapper - 2 freq €œwhaever - 1 freq weber - 1 freq wavery - 1 freq waahfer - 1 freq whopper - 3 freq wyper - 1 freq |
MetaPhone code - WFR whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq €œwhaever - 1 freq wavery - 1 freq waahfer - 1 freq |
WAFER |
| Time to execute Levenshtein function - 0.219314 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.384348 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027693 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037224 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000865 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |