| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wuidlans (0) - 1 freq wuidlands (1) - 2 freq wuidland (1) - 1 freq willans (2) - 1 freq muirlans (2) - 1 freq widlands (2) - 2 freq widland (2) - 10 freq heidlans (2) - 1 freq widlan (2) - 2 freq wuidins (2) - 1 freq whillans (2) - 1 freq guidars (3) - 2 freq wittans (3) - 2 freq heidlan (3) - 1 freq wuidwark (3) - 2 freq widdas (3) - 1 freq wuidrims (3) - 1 freq widdins (3) - 1 freq heilans (3) - 8 freq shillans (3) - 2 freq weidaes (3) - 2 freq wuidness (3) - 2 freq wudbins (3) - 1 freq widlaunds (3) - 1 freq musiclans (3) - 1 freq |
wuidlans (0) - 1 freq wuidland (2) - 1 freq wuidlands (2) - 2 freq heidlans (3) - 1 freq widlan (3) - 2 freq widland (3) - 10 freq wuidins (3) - 1 freq widlands (3) - 2 freq willans (3) - 1 freq widlaunds (4) - 1 freq widdins (4) - 1 freq wudbins (4) - 1 freq woodland (4) - 1 freq muirlans (4) - 1 freq hidlins (4) - 10 freq whillans (4) - 1 freq wuiden (5) - 24 freq widda's (5) - 3 freq widbank (5) - 1 freq millans (5) - 1 freq uplans (5) - 2 freq guidless (5) - 3 freq midlands (5) - 3 freq wuidnae (5) - 33 freq waddlan (5) - 1 freq |
SoundEx code - W345 widlaunds - 1 freq widland - 10 freq wheetlin - 1 freq wheedlin - 2 freq wuidlands - 2 freq waddlan - 1 freq waddlin - 2 freq widlan - 2 freq weedlin - 1 freq wuidland - 1 freq widlands - 2 freq wuidlans - 1 freq waddling - 1 freq widdlaun - 1 freq wetlands - 1 freq €œwiidlan - 1 freq whuttlin - 2 freq woodland - 1 freq wat-lint - 1 freq |
MetaPhone code - WTLNS wuidlans - 1 freq |
WUIDLANS |
| Time to execute Levenshtein function - 0.245791 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.412530 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.030544 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.037261 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.000947 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. |