| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quinnin (0) - 1 freq quinnie (1) - 7 freq quintin (1) - 1 freq winnin (2) - 90 freq chinnin (2) - 1 freq quiltin (2) - 1 freq quinne (2) - 2 freq erinnin (2) - 1 freq quinie (2) - 82 freq spinnin (2) - 55 freq sunnin (2) - 5 freq thinnin (2) - 1 freq grinnin (2) - 63 freq pinnin (2) - 4 freq tuinin (2) - 1 freq sinnin (2) - 2 freq runnin (2) - 219 freq innin (2) - 34 freq finnin (2) - 40 freq squintin (2) - 7 freq cunnin (2) - 6 freq wunnin (2) - 10 freq quentin (2) - 6 freq punnin (2) - 1 freq funnin (2) - 7 freq |
quinnin (0) - 1 freq quintin (2) - 1 freq quinnie (2) - 7 freq wunnin (3) - 10 freq quentin (3) - 6 freq cunnin (3) - 6 freq innin (3) - 34 freq punnin (3) - 1 freq finnin (3) - 40 freq linnin (3) - 2 freq tinnin (3) - 1 freq rinnin (3) - 331 freq liinnin (3) - 1 freq runnin (3) - 219 freq funnin (3) - 7 freq lunnin (3) - 1 freq quinne (3) - 2 freq sinnin (3) - 2 freq winnin (3) - 90 freq sunnin (3) - 5 freq erinnin (3) - 1 freq pinnin (3) - 4 freq omainnin (4) - 3 freq maunnin (4) - 1 freq runnan (4) - 25 freq |
SoundEx code - Q550 quinnin - 1 freq |
MetaPhone code - KNN kennin - 297 freq cunnin - 6 freq cannon - 13 freq canaan - 3 freq canon' - 2 freq gainin - 11 freq ken-nae - 3 freq ken-an - 3 freq keenin - 10 freq canine - 3 freq kennen - 2 freq 'kennin' - 1 freq kennin' - 1 freq connin - 1 freq canon - 11 freq ken'an - 1 freq kennan - 14 freq cainan - 4 freq kenan - 3 freq cunnin' - 2 freq gaanin - 3 freq kinnen - 4 freq gannan - 1 freq quinnin - 1 freq gainan - 1 freq kenin - 2 freq kaenin - 2 freq cownan - 1 freq ken-no - 1 freq keneen - 2 freq cannen - 3 freq kanani - 1 freq cannin - 3 freq coinin - 1 freq connin' - 1 freq €œcannon - 1 freq kanin - 1 freq kinnon - 12 freq |
QUINNIN |
| Time to execute Levenshtein function - 0.256342 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.364015 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.028800 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.041290 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.000885 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. |