| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cohabitation (0) - 1 freq cohabitatin (1) - 1 freq habitation (2) - 6 freq combination (3) - 23 freq cohabitate (3) - 1 freq agitation (4) - 5 freq connotation (4) - 3 freq compitition (4) - 1 freq habitautioun (4) - 2 freq sanitation (4) - 4 freq commination (4) - 2 freq consultation (4) - 74 freq complication (4) - 2 freq constipation (4) - 1 freq constitution (4) - 15 freq collaboration (4) - 5 freq colonisation (4) - 2 freq coalition (4) - 8 freq hesitation (4) - 12 freq combinations (4) - 5 freq localisation (4) - 4 freq citation (4) - 2 freq codification (4) - 3 freq compilation (4) - 3 freq gravitation (4) - 1 freq |
cohabitation (0) - 1 freq cohabitatin (1) - 1 freq habitation (3) - 6 freq cohabitate (4) - 1 freq habitautioun (5) - 2 freq combination (5) - 23 freq hesitation (6) - 12 freq chattin (6) - 22 freq citation (6) - 2 freq compitition (6) - 1 freq connotation (6) - 3 freq coordination (7) - 1 freq committin (7) - 2 freq competition (7) - 63 freq chaitin (7) - 3 freq celebration (7) - 46 freq chattan (7) - 1 freq inhibition (7) - 1 freq cantatation (7) - 1 freq gravitation (7) - 1 freq exhibition (7) - 25 freq habitats (7) - 4 freq connotatioun (7) - 1 freq codification (7) - 3 freq hesitatin (7) - 4 freq |
SoundEx code - C133 coveted - 4 freq cohabitate - 1 freq cohabitatin - 1 freq cohabitation - 1 freq |
MetaPhone code - KHBTXN cohabitation - 1 freq |
COHABITATION |
| Time to execute Levenshtein function - 0.446348 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.604290 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.030163 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.042409 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.000980 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. |