| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wazrl (0) - 1 freq warl (1) - 164 freq waul (2) - 1 freq darl (2) - 1 freq harl (2) - 5 freq wzrz (2) - 1 freq wael (2) - 9 freq hazel (2) - 51 freq warls (2) - 4 freq waarm (2) - 81 freq waur (2) - 223 freq wars (2) - 61 freq waars (2) - 2 freq wairn (2) - 2 freq azl (2) - 1 freq wal (2) - 24 freq mazr (2) - 1 freq pairl (2) - 3 freq warm (2) - 363 freq warle (2) - 1 freq waary (2) - 1 freq wazn (2) - 2 freq wart (2) - 4 freq waell (2) - 1 freq earl (2) - 31 freq |
wazrl (0) - 1 freq warl (2) - 164 freq whurl (3) - 2 freq worl (3) - 35 freq whirl (3) - 10 freq wurl (3) - 2 freq warle (3) - 1 freq wzrz (3) - 1 freq ware (4) - 27 freq warp (4) - 9 freq warg (4) - 1 freq waar (4) - 70 freq wary (4) - 11 freq ward (4) - 89 freq waurily (4) - 1 freq wall (4) - 79 freq varl (4) - 1 freq wizard (4) - 19 freq waarld (4) - 1 freq wairm (4) - 46 freq wahr (4) - 1 freq waarn (4) - 1 freq wail (4) - 9 freq waark (4) - 110 freq waall (4) - 1 freq |
SoundEx code - W264 wazrl - 1 freq whicrlin - 1 freq wxrulfmes - 1 freq |
MetaPhone code - WSRL wazrl - 1 freq |
WAZRL |
| Time to execute Levenshtein function - 0.254405 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.376757 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.032351 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.037674 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.000864 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. |