| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quottit (0) - 1 freq quotit (1) - 11 freq jottit (2) - 1 freq trottit (2) - 4 freq nottit (2) - 3 freq hottit (2) - 1 freq puttit (2) - 1 freq rottit (2) - 9 freq slottit (2) - 2 freq blottit (2) - 1 freq knottit (2) - 6 freq quotin (2) - 9 freq cuttit (2) - 21 freq buttit (2) - 4 freq pottit (2) - 3 freq vottit (2) - 1 freq quoitin (2) - 1 freq quuttin (2) - 1 freq stottit (2) - 12 freq dottit (2) - 11 freq guttit (2) - 4 freq ruttit (2) - 3 freq quittin (2) - 1 freq squattit (2) - 1 freq spottit (2) - 24 freq |
quottit (0) - 1 freq quotit (2) - 11 freq vottit (3) - 1 freq pottit (3) - 3 freq buttit (3) - 4 freq quuttin (3) - 1 freq ruttit (3) - 3 freq squattit (3) - 1 freq quittin (3) - 1 freq cuttit (3) - 21 freq guttit (3) - 4 freq dottit (3) - 11 freq hottit (3) - 1 freq rottit (3) - 9 freq nottit (3) - 3 freq jottit (3) - 1 freq puttit (3) - 1 freq quotient (4) - 1 freq sattit (4) - 1 freq pattit (4) - 20 freq tuttet (4) - 2 freq guttet (4) - 8 freq pettit (4) - 13 freq pittit (4) - 2 freq fettit (4) - 1 freq |
SoundEx code - Q330 quoted - 9 freq quotit - 11 freq quieted - 1 freq quietude - 1 freq quottit - 1 freq quited - 1 freq |
MetaPhone code - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 9 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq coatit - 5 freq cutted - 1 freq cuddied - 1 freq quieted - 1 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
QUOTTIT |
| Time to execute Levenshtein function - 0.202264 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.363955 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.027586 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.037942 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.000889 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. |