| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quentin (0) - 6 freq queetin (1) - 1 freq quintin (1) - 1 freq questin (1) - 11 freq question (2) - 410 freq duntin (2) - 24 freq squintin (2) - 7 freq puntin (2) - 5 freq huntin (2) - 66 freq queuein (2) - 3 freq rentin (2) - 2 freq quoitin (2) - 1 freq wuntin (2) - 9 freq plentin (2) - 1 freq cuntin (2) - 1 freq duettin (2) - 1 freq quuttin (2) - 1 freq buntin (2) - 4 freq questins (2) - 1 freq quotin (2) - 9 freq queuin (2) - 3 freq glentin (2) - 34 freq fentin (2) - 2 freq tentin (2) - 10 freq quaitin (2) - 1 freq |
quentin (0) - 6 freq quintin (1) - 1 freq queetin (2) - 1 freq questin (2) - 11 freq tentin (3) - 10 freq fentin (3) - 2 freq quaitin (3) - 1 freq buntin (3) - 4 freq muntin (3) - 11 freq quotin (3) - 9 freq quiltin (3) - 1 freq quinnin (3) - 1 freq luntin (3) - 1 freq quuttin (3) - 1 freq quittin (3) - 1 freq pentin (3) - 23 freq hentin (3) - 4 freq huntin (3) - 66 freq rentin (3) - 2 freq puntin (3) - 5 freq squintin (3) - 7 freq question (3) - 410 freq quoitin (3) - 1 freq duntin (3) - 24 freq cuntin (3) - 1 freq |
SoundEx code - Q535 quentin - 6 freq quantum - 5 freq quintin - 1 freq |
MetaPhone code - KNTN continue - 71 freq countin - 13 freq gauntin - 2 freq gantin - 23 freq coontin - 47 freq contain - 15 freq kentna - 12 freq cuntin - 1 freq canteen - 20 freq 'continue - 1 freq cuntain - 1 freq canadian - 10 freq condone - 1 freq canton - 2 freq quentin - 6 freq coundna - 1 freq coontan - 3 freq kennitna - 1 freq quintin - 1 freq conteen - 3 freq countan - 1 freq conteenue - 2 freq cantin - 4 freq canadiane - 2 freq conteena - 3 freq continua - 1 freq contenna - 1 freq kindon - 1 freq |
QUENTIN |
| Time to execute Levenshtein function - 0.193252 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.330910 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.027536 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.038991 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.000956 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. |