Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wanlockheid (0) - 1 freq walloched (3) - 1 freq wallochin (4) - 1 freq blackheid (4) - 1 freq lochheid (4) - 1 freq unlocked (4) - 4 freq yelloched (5) - 34 freq wedowheid (5) - 1 freq waached (5) - 2 freq wyceheid (5) - 1 freq blocked (5) - 40 freq wackend (5) - 2 freq wadlock (5) - 1 freq blockeed (5) - 1 freq clocked (5) - 32 freq waa-heid (5) - 1 freq ransacked (5) - 2 freq locheil (5) - 3 freq walloped (5) - 7 freq knockid (5) - 1 freq flocked (5) - 1 freq waatched (5) - 43 freq walcumed (5) - 2 freq dockhead (5) - 1 freq nocked (5) - 1 freq |
wanlockheid (0) - 1 freq walloched (5) - 1 freq blackheid (6) - 1 freq unlocked (6) - 4 freq wanlucky (7) - 1 freq winched (7) - 4 freq wanluck (7) - 1 freq lochheid (7) - 1 freq wallochin (7) - 1 freq warlockry (8) - 3 freq slocked (8) - 2 freq bleckleid (8) - 1 freq walloch (8) - 1 freq binkheid (8) - 1 freq unlockin (8) - 2 freq walked (8) - 285 freq warlock (8) - 43 freq warlock's (8) - 8 freq locked (8) - 48 freq warlocks (8) - 5 freq lochhead (8) - 24 freq wattched (8) - 1 freq smackheid (8) - 4 freq walkid (8) - 1 freq lockid (8) - 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 - WNLKHT wanlockheid - 1 freq |
WANLOCKHEID |
Time to execute Levenshtein function - 0.220031 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.389975 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.033377 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.040457 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.001047 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. |