| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| warily (0) - 3 freq waurily (1) - 1 freq warmly (1) - 4 freq waridly (1) - 1 freq wrily (1) - 1 freq wardly (1) - 1 freq wearily (1) - 1 freq warll (2) - 1 freq sarely (2) - 1 freq barely (2) - 97 freq wary (2) - 11 freq cariy (2) - 1 freq marilyn (2) - 4 freq wails (2) - 6 freq eardly (2) - 1 freq daily (2) - 110 freq drily (2) - 1 freq parly (2) - 2 freq wainly (2) - 1 freq wily (2) - 7 freq wardle (2) - 11 freq warty (2) - 1 freq darkly (2) - 3 freq lazily (2) - 12 freq haily (2) - 27 freq |
warily (0) - 3 freq wearily (1) - 1 freq waurily (1) - 1 freq wrily (1) - 1 freq warle (2) - 1 freq warl (2) - 164 freq wryly (2) - 1 freq warmly (2) - 4 freq waridly (2) - 1 freq wardly (2) - 1 freq warld (3) - 820 freq warls (3) - 4 freq aprily (3) - 2 freq warple (3) - 1 freq warid (3) - 5 freq warit (3) - 1 freq wally (3) - 48 freq wurl (3) - 2 freq warsil (3) - 2 freq worl (3) - 35 freq verily (3) - 2 freq wawly (3) - 1 freq waikly (3) - 3 freq warsle (3) - 24 freq warin (3) - 2 freq |
SoundEx code - W640 where'll - 1 freq warl - 164 freq whaur'll - 1 freq whirl - 10 freq warll - 1 freq wurl - 2 freq worl - 35 freq worl' - 25 freq waurily - 1 freq warlie - 2 freq warily - 3 freq wryly - 1 freq whurl - 2 freq wearily - 1 freq wearilie - 1 freq warle - 1 freq wrily - 1 freq whirlie - 2 freq |
MetaPhone code - WRL where'll - 1 freq warl - 164 freq whaur'll - 1 freq whirl - 10 freq warll - 1 freq wurl - 2 freq worl - 35 freq worl' - 25 freq waurily - 1 freq warlie - 2 freq warily - 3 freq whurl - 2 freq wearily - 1 freq wearilie - 1 freq warle - 1 freq whirlie - 2 freq |
WARILY |
| Time to execute Levenshtein function - 0.225781 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.380088 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.027760 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.040113 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.000941 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. |