| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanluk (0) - 1 freq wanluck (1) - 1 freq wanlos (2) - 1 freq walk (2) - 483 freq wanlit (2) - 4 freq wauk (2) - 40 freq wanun (2) - 1 freq waulk (2) - 1 freq waalk (2) - 5 freq wanlas (2) - 1 freq wanlucky (2) - 1 freq manlik (2) - 1 freq wank (2) - 8 freq waned (3) - 6 freq value (3) - 65 freq wauf (3) - 1 freq waur (3) - 223 freq wails (3) - 6 freq waelz (3) - 1 freq watur (3) - 1 freq wankin (3) - 4 freq callum (3) - 81 freq bantu (3) - 1 freq wailit (3) - 1 freq wan (3) - 1 freq |
wanluk (0) - 1 freq wanluck (2) - 1 freq waalk (3) - 5 freq wanlucky (3) - 1 freq wank (3) - 8 freq waulk (3) - 1 freq manlik (3) - 1 freq wanlas (3) - 1 freq walk (3) - 483 freq wanlit (3) - 4 freq wanlos (3) - 1 freq whilk (4) - 193 freq winnok (4) - 9 freq wink (4) - 117 freq wainly (4) - 1 freq wnl (4) - 1 freq wlk (4) - 1 freq unlik (4) - 1 freq wenl (4) - 1 freq wulk (4) - 1 freq wauk (4) - 40 freq wanun (4) - 1 freq wanda (5) - 1 freq wangled (5) - 1 freq wanice (5) - 1 freq |
SoundEx code - W542 wanlos - 1 freq wameless - 1 freq wanless - 3 freq wanlessly - 1 freq wanluck - 1 freq whummles - 1 freq wean-like - 1 freq winless - 1 freq wanlockheid - 1 freq wanlas - 1 freq wanluk - 1 freq wanlucky - 1 freq winnelstrae - 1 freq |
MetaPhone code - WNLK wanluck - 1 freq wean-like - 1 freq wanluk - 1 freq wanlucky - 1 freq |
WANLUK |
| Time to execute Levenshtein function - 0.272455 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.444639 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.027930 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.037846 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.000892 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. |