| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waterfaw (0) - 1 freq waterfaa (1) - 3 freq watterfaw (1) - 11 freq waterfas (1) - 1 freq watergaw (1) - 12 freq watterfa (2) - 1 freq watterfaa (2) - 1 freq wattergaw (2) - 9 freq watergaws (2) - 2 freq waterfall (2) - 2 freq wattertap (3) - 1 freq cateran (3) - 3 freq efteraw (3) - 17 freq watery (3) - 8 freq waterford (3) - 1 freq fairfaw (3) - 1 freq waterin (3) - 7 freq wateries (3) - 1 freq waeran (3) - 1 freq asterbaw (3) - 8 freq watew (3) - 2 freq athraw (3) - 1 freq waterfalls (3) - 1 freq walterw (3) - 1 freq water' (3) - 1 freq |
waterfaw (0) - 1 freq watergaw (2) - 12 freq waterfas (2) - 1 freq waterfaa (2) - 3 freq watterfaw (2) - 11 freq waterfall (4) - 2 freq watergaws (4) - 2 freq wattergaw (4) - 9 freq watterfa (4) - 1 freq watterfaa (4) - 1 freq water (5) - 258 freq wasterfu (5) - 1 freq waters (5) - 18 freq wateren (5) - 2 freq water' (5) - 1 freq warsaw (5) - 1 freq water's (5) - 4 freq walterw (5) - 1 freq watering (5) - 1 freq waitterfa (5) - 1 freq oxterfae (5) - 1 freq waterthe (5) - 1 freq waterloo (5) - 26 freq watered (5) - 6 freq waterin (5) - 7 freq |
SoundEx code - W361 wathervane - 1 freq watterbend - 1 freq waterproof - 3 freq watterfront - 1 freq waterfaa - 3 freq watterfaals - 1 freq watterpreef - 1 freq waterfas - 1 freq watterfaa - 1 freq watter-flees - 1 freq watterfaw - 11 freq watterfaalls - 1 freq watterproof - 5 freq waterfalls - 1 freq wattir-pruif - 1 freq watter-proof - 1 freq watter-fillt - 1 freq wather-peltit - 1 freq watter-fuled - 1 freq waterproofs - 2 freq waterford - 1 freq waitterfa - 1 freq watterfa - 1 freq weatherby - 2 freq waterfall - 2 freq waterfaw - 1 freq whiterabbitt - 1 freq |
MetaPhone code - WTRF waterfaa - 3 freq watterfaa - 1 freq watterfaw - 11 freq waitterfa - 1 freq watterfa - 1 freq waterfaw - 1 freq |
WATERFAW |
| Time to execute Levenshtein function - 0.491447 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 - 1.007082 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.098006 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.117111 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.070080 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. |