| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chittered (0) - 12 freq whittered (1) - 1 freq hottered (2) - 6 freq maittered (2) - 7 freq hattered (2) - 7 freq slittered (2) - 3 freq chittert (2) - 3 freq chitter (2) - 14 freq littered (2) - 9 freq scaittered (2) - 2 freq claittered (2) - 2 freq shattered (2) - 23 freq clattered (2) - 14 freq chitters (2) - 7 freq chitterin (2) - 44 freq cattered (2) - 2 freq paittered (2) - 1 freq glittered (2) - 1 freq shuttered (2) - 2 freq plittered (2) - 1 freq chittery (2) - 1 freq chitterie (2) - 1 freq tittered (2) - 1 freq chartered (2) - 1 freq skittered (2) - 10 freq |
chittered (0) - 12 freq whittered (2) - 1 freq shuttered (3) - 2 freq cattered (3) - 2 freq chitters (3) - 7 freq chittery (3) - 1 freq chitterin (3) - 44 freq chartered (3) - 1 freq cluttered (3) - 2 freq shaittered (3) - 2 freq clattered (3) - 14 freq chitterie (3) - 1 freq chittled (3) - 1 freq shattered (3) - 23 freq hottered (3) - 6 freq hattered (3) - 7 freq chittert (3) - 3 freq chitter (3) - 14 freq claittered (3) - 2 freq chittran (4) - 1 freq chatter (4) - 11 freq chatterin (4) - 3 freq chittrin (4) - 1 freq chatted (4) - 3 freq shatterd (4) - 1 freq |
SoundEx code - C363 cut-throat - 1 freq chittert - 3 freq chittered - 12 freq cattered - 2 freq cottared - 5 freq chattert - 2 freq cauderwid - 2 freq cottert - 1 freq cathyritajones - 1 freq |
MetaPhone code - XTRT shattered - 23 freq shattert - 2 freq shoodered - 3 freq shuddered - 12 freq chittert - 3 freq chittered - 12 freq shiddert - 1 freq shatterit - 2 freq shiddered - 4 freq shuddert - 3 freq shaittered - 2 freq chattert - 2 freq shuttered - 2 freq shatterd - 1 freq shoodert - 1 freq |
CHITTERED |
| Time to execute Levenshtein function - 0.201453 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.413473 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.027868 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.074770 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.000842 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. |