Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
waterfalls (0) - 1 freq waterfall (1) - 2 freq waterfas (2) - 1 freq watterfaalls (2) - 1 freq watterfaals (2) - 1 freq watermarks (3) - 1 freq materials (3) - 60 freq materially (3) - 1 freq watergaws (3) - 2 freq waterfaa (3) - 3 freq water'll (3) - 1 freq waterfaw (3) - 1 freq oxterfaes (4) - 1 freq caterans (4) - 5 freq watter-fillt (4) - 1 freq iterally (4) - 1 freq literally (4) - 42 freq wattergates (4) - 1 freq waterford (4) - 1 freq wattergaws (4) - 1 freq paternal (4) - 8 freq lateral (4) - 3 freq interfaces (4) - 1 freq maternal (4) - 11 freq intervals (4) - 2 freq |
waterfalls (0) - 1 freq waterfall (2) - 2 freq watterfaalls (3) - 1 freq watterfaals (4) - 1 freq waterfas (4) - 1 freq water'll (5) - 1 freq materials (6) - 60 freq water-lilies (6) - 1 freq waterfaw (6) - 1 freq watermarks (6) - 1 freq materially (6) - 1 freq watergaws (6) - 2 freq waterfaa (6) - 3 freq walter'll (7) - 1 freq waalls (7) - 1 freq waefully (7) - 4 freq wirsells (7) - 2 freq watersheds (7) - 1 freq materialise (7) - 2 freq internally (7) - 4 freq eternally (7) - 7 freq water's (7) - 4 freq trills (7) - 2 freq externally (7) - 1 freq trolls (7) - 6 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 - WTRFLS watterfaals - 1 freq watter-flees - 1 freq watterfaalls - 1 freq waterfalls - 1 freq |
WATERFALLS |
Time to execute Levenshtein function - 0.403640 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.485860 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.027595 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.055294 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.000889 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. |