| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| capernoitit (0) - 1 freq capernoitie (1) - 1 freq capernoited (2) - 1 freq 'capernoited (3) - 1 freq aperitif (4) - 2 freq cokernit (5) - 1 freq exploitit (5) - 2 freq approchit (5) - 1 freq co-editit (5) - 1 freq creditit (5) - 4 freq yae-fuitit (5) - 1 freq inheritit (5) - 3 freq pertectit (5) - 1 freq apenit (5) - 1 freq capercaillie (5) - 1 freq peintit (5) - 8 freq caperin (5) - 3 freq eternitie (5) - 8 freq permeetit (5) - 1 freq laceratit (5) - 1 freq parrotit (5) - 1 freq copyrichtit (5) - 1 freq clertit (5) - 1 freq connotit (5) - 1 freq paperweight (5) - 1 freq |
capernoitit (0) - 1 freq capernoitie (2) - 1 freq capernoited (3) - 1 freq 'capernoited (5) - 1 freq raportit (7) - 2 freq appintit (7) - 1 freq pentit (7) - 44 freq cairtit (7) - 11 freq pertit (7) - 2 freq speeritit (7) - 1 freq capernaum (7) - 15 freq spentit (7) - 1 freq permitiet (7) - 1 freq approbatit (7) - 3 freq cairpetit (7) - 2 freq spiritit (7) - 1 freq confrontit (7) - 11 freq accreditit (7) - 1 freq capering (7) - 1 freq percentit (7) - 1 freq appointit (7) - 4 freq cantit (7) - 1 freq prentit (7) - 81 freq sprintit (7) - 4 freq imprintit (7) - 2 freq |
SoundEx code - C165 caperin - 3 freq coverin - 29 freq capering - 1 freq cavern - 4 freq covering - 6 freq cuveren - 1 freq cayperen - 1 freq chaperone - 1 freq capernoitie - 1 freq copernicus's - 1 freq cuprinol - 1 freq cap'rin - 1 freq capernaum - 15 freq 'capernoited - 1 freq caverns - 4 freq coveran - 2 freq coverin' - 1 freq caperan - 1 freq capernoited - 1 freq cuiverin - 1 freq cheeperin - 1 freq cybermen - 1 freq capernoitit - 1 freq co-brandit - 1 freq cyber-een - 1 freq coburn - 3 freq coverangersfc - 1 freq cobramanu - 1 freq cfreun - 1 freq |
MetaPhone code - KPRNTT 'capernoited - 1 freq capernoited - 1 freq capernoitit - 1 freq |
CAPERNOITIT |
| Time to execute Levenshtein function - 0.382960 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.595221 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.029681 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.074523 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.000908 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. |