| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| warricker (0) - 1 freq farrier (3) - 2 freq warker (3) - 7 freq wicker (3) - 2 freq warwick (3) - 7 freq earrier (3) - 1 freq tarrier (3) - 1 freq carrier (3) - 15 freq worrier (3) - 1 freq warrior (3) - 27 freq barrister (3) - 1 freq carrick (3) - 6 freq harrier (3) - 2 freq particler (3) - 1 freq warriour (3) - 1 freq barrier (3) - 13 freq waiker (3) - 5 freq warrender (3) - 1 freq panicked (4) - 13 freq musicker (4) - 7 freq laicher (4) - 5 freq swacker (4) - 1 freq wisker (4) - 1 freq wicket (4) - 2 freq barrie (4) - 15 freq |
warricker (0) - 1 freq warrior (5) - 27 freq warriour (5) - 1 freq warrender (5) - 1 freq werrocks (5) - 1 freq warlockry (5) - 3 freq worrier (5) - 1 freq carrick (5) - 6 freq wicker (5) - 2 freq warwick (5) - 7 freq warker (5) - 7 freq arrochar (6) - 1 freq ferrick (6) - 1 freq barracks (6) - 9 freq trickery (6) - 1 freq rocker (6) - 3 freq derrick (6) - 18 freq warlock (6) - 43 freq widpecker (6) - 2 freq iancrocker (6) - 1 freq wurker (6) - 3 freq craacker (6) - 3 freq werker (6) - 2 freq tirrick (6) - 6 freq worker (6) - 24 freq |
SoundEx code - W626 wirkers - 20 freq workers - 34 freq worker - 24 freq wirker - 5 freq werker - 2 freq wurker - 3 freq wurkers - 6 freq warker - 7 freq warkers - 43 freq warkers' - 1 freq wurkhoarse - 1 freq wirk-rochened - 1 freq workers' - 3 freq 'warkers - 1 freq worser - 3 freq wirk-a-wark - 1 freq waarkers - 4 freq warkrooms - 1 freq wurkur - 3 freq wirkers' - 2 freq warkar - 1 freq warwickshire-born - 1 freq wark-oors - 1 freq wurkirs - 1 freq warricker - 1 freq |
MetaPhone code - WRKR worker - 24 freq wirker - 5 freq werker - 2 freq wurker - 3 freq warker - 7 freq wurkur - 3 freq warkar - 1 freq warricker - 1 freq |
WARRICKER |
| Time to execute Levenshtein function - 0.387076 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.829188 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.087718 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.102115 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.001021 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. |