| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wokir (0) - 1 freq owir (2) - 7 freq lokin (2) - 1 freq worker (2) - 23 freq yokit (2) - 72 freq pokit (2) - 7 freq wiker (2) - 1 freq inkir (2) - 1 freq oki (2) - 5 freq wkr (2) - 1 freq yokin (2) - 24 freq w'ir (2) - 17 freq soir (2) - 1 freq workin (2) - 178 freq whair (2) - 12 freq toker (2) - 1 freq bokin (2) - 5 freq moir (2) - 1 freq wooer (2) - 3 freq motir (2) - 12 freq wooit (2) - 1 freq lookir (2) - 1 freq workie (2) - 1 freq nokia (2) - 2 freq joker (2) - 7 freq |
wokir (0) - 1 freq wkr (2) - 1 freq wiker (2) - 1 freq woken (3) - 7 freq wok (3) - 1 freq okr (3) - 1 freq wiki (3) - 5 freq wuir (3) - 4 freq whir (3) - 11 freq wakin (3) - 19 freq weir (3) - 139 freq woke (3) - 90 freq kir (3) - 2 freq ackir (3) - 1 freq wor (3) - 20 freq wookie (3) - 1 freq wokey (3) - 1 freq waaker (3) - 1 freq waiker (3) - 5 freq poker (3) - 21 freq wir (3) - 2162 freq gokr (3) - 1 freq weeir (3) - 3 freq weaker (3) - 4 freq hoker (3) - 1 freq |
SoundEx code - W260 wycer - 6 freq wiser - 26 freq waiker - 5 freq wisker - 1 freq washer - 5 freq washer' - 1 freq wheecher - 2 freq wager - 9 freq weaker - 4 freq wicker - 2 freq whacker - 1 freq waaker - 1 freq whiskery - 1 freq wajer - 1 freq wokir - 1 freq wiker - 1 freq wauger - 3 freq wikker - 1 freq waeker - 1 freq whisker - 1 freq wheeker - 25 freq wasser - 1 freq wyacry - 1 freq wkr - 1 freq wwjr - 1 freq |
MetaPhone code - WKR waiker - 5 freq weaker - 4 freq wicker - 2 freq whacker - 1 freq waaker - 1 freq wokir - 1 freq wiker - 1 freq wikker - 1 freq waeker - 1 freq wheeker - 25 freq |
WOKIR |
| Time to execute Levenshtein function - 0.591581 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 - 1.104554 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.092399 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.180318 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.001750 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. |