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