| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whitenin (0) - 3 freq whinin (2) - 8 freq whittin (2) - 8 freq whitin (2) - 25 freq shitein (2) - 2 freq hidenin (2) - 1 freq whiten (2) - 1 freq whiteen (2) - 7 freq whitevir (2) - 1 freq widenin (2) - 9 freq wierin (3) - 4 freq chitterin (3) - 44 freq bite-in (3) - 1 freq whitivir (3) - 9 freq waterin (3) - 7 freq listenin (3) - 177 freq whirlwin (3) - 1 freq shiverin (3) - 12 freq whimperin (3) - 1 freq whiting (3) - 1 freq whiddin (3) - 1 freq whiter (3) - 3 freq whistlin (3) - 22 freq worsenin (3) - 1 freq whitema (3) - 2 freq |
whitenin (0) - 3 freq whiteen (3) - 7 freq whitin (3) - 25 freq whiten (3) - 1 freq whittin (3) - 8 freq whinin (3) - 8 freq wattenn (4) - 1 freq whinneyin (4) - 1 freq whiting (4) - 1 freq whitins (4) - 1 freq whitna' (4) - 1 freq whitten (4) - 11 freq whitan (4) - 9 freq whitna (4) - 42 freq whit'n (4) - 1 freq hidenin (4) - 1 freq widenin (4) - 9 freq whitevir (4) - 1 freq whitsun (4) - 1 freq whitane (4) - 1 freq shitein (4) - 2 freq shiten (5) - 1 freq wharein (5) - 1 freq white (5) - 961 freq whitemaa (5) - 1 freq |
SoundEx code - W355 wutnman - 1 freq widenin - 9 freq weeda-wumman - 1 freq whitenin - 3 freq weidae-man - 2 freq woodnymphs - 1 freq wood-nymphs - 1 freq widmann - 1 freq weetammyinspain - 1 freq |
MetaPhone code - WTNN widenin - 9 freq whitenin - 3 freq |
WHITENIN |
| Time to execute Levenshtein function - 0.201987 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.392634 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.027606 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.046421 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.001096 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. |