Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
warmer (0) - 25 freq warmed (1) - 16 freq farmer (1) - 9 freq wairmer (1) - 1 freq warker (1) - 7 freq warder (1) - 3 freq waarmer (1) - 6 freq warner (1) - 1 freq waster (2) - 13 freq wauner (2) - 2 freq garter (2) - 2 freq armur (2) - 1 freq carer (2) - 10 freq wame (2) - 74 freq warked (2) - 23 freq barber (2) - 7 freq waiker (2) - 5 freq wagner (2) - 1 freq carter (2) - 3 freq wurker (2) - 3 freq arm'er (2) - 1 freq water (2) - 252 freq yarder (2) - 1 freq caumer (2) - 1 freq warmly (2) - 4 freq |
warmer (0) - 25 freq wairmer (1) - 1 freq waarmer (1) - 6 freq farmer (2) - 9 freq warmed (2) - 16 freq warner (2) - 1 freq warder (2) - 3 freq warker (2) - 7 freq wormed (3) - 1 freq werker (3) - 2 freq wirmed (3) - 2 freq wardar (3) - 1 freq dormer (3) - 2 freq werner (3) - 1 freq fermer (3) - 194 freq warmit (3) - 2 freq warms (3) - 8 freq warmt (3) - 2 freq warm (3) - 355 freq waarmed (3) - 3 freq warmin (3) - 30 freq former (3) - 38 freq hermer (3) - 1 freq warkar (3) - 1 freq fairmer (3) - 61 freq |
SoundEx code - W656 warmer - 25 freq waarmer - 6 freq wairmer - 1 freq werner - 1 freq warm-hairtit - 1 freq warner - 1 freq |
MetaPhone code - WRMR warmer - 25 freq waarmer - 6 freq wairmer - 1 freq |
WARMER |
Time to execute Levenshtein function - 0.405116 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.969735 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.028001 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.164470 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.001124 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. |