| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quïzzin (0) - 1 freq cuzzin (3) - 1 freq buzzin (3) - 39 freq puzziin (4) - 1 freq quït (4) - 3 freq quittin (4) - 1 freq quaitin (4) - 1 freq cizzin (4) - 1 freq quintin (4) - 1 freq quizzes (4) - 4 freq quakin (4) - 3 freq sïttin (4) - 8 freq blazzin (4) - 1 freq rizzin (4) - 1 freq kïllin (4) - 2 freq rïppin (4) - 1 freq fizzin (4) - 8 freq quentin (4) - 6 freq uizin (4) - 12 freq quinnin (4) - 1 freq queuein (4) - 3 freq 'fizzin (4) - 1 freq brïngin (4) - 6 freq puzzian (4) - 1 freq bizzin (4) - 17 freq |
quïzzin (0) - 1 freq buzzin (6) - 39 freq cuzzin (6) - 1 freq quïck (7) - 6 freq rïggin (7) - 1 freq bïddin (7) - 1 freq puzzian (7) - 1 freq fïshin (7) - 1 freq bizzin (7) - 17 freq fïttin (7) - 1 freq kïssin (7) - 1 freq kizzin (7) - 1 freq quizzed (7) - 1 freq 'fizzin (7) - 1 freq whizzin (7) - 5 freq dizzin (7) - 1 freq birzzin (7) - 1 freq quizzes (7) - 4 freq cizzin (7) - 1 freq blazzin (7) - 1 freq puzziin (7) - 1 freq rizzin (7) - 1 freq kïllin (7) - 2 freq rïppin (7) - 1 freq sïttin (7) - 8 freq |
SoundEx code - Q250 quisson - 3 freq quakin - 3 freq quaik'an - 1 freq quïzzin - 1 freq quicken - 4 freq quicksaun - 2 freq quicksan - 1 freq qasiiimh - 2 freq qwagwm - 1 freq qkoszm - 1 freq qoycm - 1 freq |
MetaPhone code - KSN kizzen - 10 freq quisson - 3 freq guessin - 18 freq gazin - 18 freq guisin - 30 freq cousin - 100 freq causin - 14 freq cuisin - 1 freq kissin - 24 freq cassen - 27 freq 'cousin' - 1 freq gacin - 1 freq causen - 3 freq caasen - 1 freq kcyna - 1 freq kcyn - 1 freq caizzen - 1 freq cuisine - 6 freq casino - 9 freq caasin - 3 freq casin - 3 freq quïzzin - 1 freq kïssin - 1 freq cassin - 4 freq gazan - 2 freq cuzzin - 1 freq coseen - 1 freq cuissen - 1 freq cassini - 2 freq kesson - 2 freq guysin - 7 freq kizzin - 1 freq cassino - 2 freq guisin' - 1 freq hxn - 1 freq wxen - 1 freq |
QUÏZZIN |
| Time to execute Levenshtein function - 0.216794 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.376359 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.028939 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.038213 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.000891 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. |