| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanlos (0) - 1 freq wanlas (1) - 1 freq walls (2) - 29 freq walop (2) - 1 freq wails (2) - 6 freq hanles (2) - 1 freq wanis (2) - 3 freq carlos (2) - 3 freq waals (2) - 7 freq wall's (2) - 8 freq wanlit (2) - 4 freq wanton (2) - 2 freq winos (2) - 2 freq wan's (2) - 15 freq wals (2) - 1 freq gablos (2) - 1 freq waels (2) - 4 freq wanless (2) - 3 freq banjos (2) - 2 freq warls (2) - 4 freq mangos (2) - 1 freq wal's (2) - 1 freq wants (2) - 295 freq wans (2) - 175 freq waalls (2) - 1 freq |
wanlos (0) - 1 freq wanlas (1) - 1 freq wanless (3) - 3 freq waels (3) - 4 freq wands (3) - 7 freq wals (3) - 1 freq warls (3) - 4 freq wans (3) - 175 freq wants (3) - 295 freq wales (3) - 39 freq wanluk (3) - 1 freq wan's (3) - 15 freq winos (3) - 2 freq wanis (3) - 3 freq hanles (3) - 1 freq wails (3) - 6 freq waalls (3) - 1 freq waals (3) - 7 freq wanes (3) - 2 freq wanlit (3) - 4 freq walls (3) - 29 freq wanks (3) - 1 freq waen's (4) - 1 freq waands (4) - 1 freq wines (4) - 8 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 - WNLS wanlos - 1 freq wanless - 3 freq winless - 1 freq wanlas - 1 freq |
WANLOS |
| Time to execute Levenshtein function - 0.580302 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.796499 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.033891 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.069531 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.000866 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. |