| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quotit (0) - 11 freq quottit (1) - 1 freq quotin (1) - 9 freq quitie (2) - 2 freq quaeit (2) - 1 freq quait (2) - 131 freq quhit (2) - 33 freq quota (2) - 1 freq votit (2) - 42 freq duntit (2) - 25 freq notit (2) - 12 freq quit (2) - 28 freq hurtit (2) - 16 freq quhyit (2) - 2 freq dootit (2) - 2 freq dotit (2) - 1 freq quoth (2) - 6 freq quotient (2) - 1 freq dustit (2) - 5 freq quoitin (2) - 1 freq quoted (2) - 8 freq quote (2) - 50 freq ruttit (2) - 3 freq cuttit (2) - 21 freq quotes (2) - 15 freq |
quotit (0) - 11 freq quottit (2) - 1 freq quotin (2) - 9 freq suitit (3) - 8 freq mutit (3) - 1 freq quotem (3) - 1 freq putit (3) - 2 freq lootit (3) - 1 freq quotes (3) - 15 freq mootit (3) - 1 freq queeit (3) - 2 freq ruitit (3) - 7 freq quotas (3) - 4 freq tootit (3) - 1 freq rootit (3) - 8 freq hootit (3) - 2 freq qtt (3) - 2 freq quote (3) - 50 freq quot (3) - 15 freq bootit (3) - 2 freq quehit (3) - 2 freq votit (3) - 42 freq notit (3) - 12 freq quit (3) - 28 freq quhyit (3) - 2 freq |
SoundEx code - Q330 quoted - 8 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 - 8 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq cuddied - 1 freq quieted - 1 freq coatit - 4 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 |
QUOTIT |
| Time to execute Levenshtein function - 0.192144 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.327516 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.027201 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.039022 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.001141 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. |