| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| conurbations (0) - 1 freq conurbation (1) - 1 freq conjuration (3) - 2 freq contributions (3) - 16 freq contractions (3) - 12 freq contraptions (3) - 4 freq convirsations (3) - 1 freq connotations (3) - 9 freq conversations (3) - 27 freq consultations (3) - 3 freq conotations (3) - 4 freq congregations (3) - 4 freq corrections (4) - 1 freq conversations' (4) - 1 freq contentions (4) - 1 freq contortions (4) - 2 freq collocations (4) - 2 freq conditions (4) - 35 freq confirmation (4) - 18 freq constructions (4) - 6 freq conventions (4) - 15 freq concoctions (4) - 6 freq combinations (4) - 5 freq contibution (4) - 1 freq conversation (4) - 144 freq |
conurbations (0) - 1 freq conurbation (2) - 1 freq contributions (4) - 16 freq conotations (5) - 4 freq contreibutions (5) - 2 freq contributiouns (5) - 1 freq conversations (5) - 27 freq congregations (5) - 4 freq connotations (5) - 9 freq contractions (5) - 12 freq contraptions (5) - 4 freq convirsations (5) - 1 freq generations (6) - 112 freq contribution (6) - 38 freq congregatioons (6) - 1 freq carnations (6) - 1 freq condeetions (6) - 7 freq connections (6) - 35 freq creations (6) - 3 freq convictions (6) - 1 freq contribution' (6) - 1 freq contreibutiouns (6) - 1 freq condeitions (6) - 4 freq contibution (6) - 1 freq conventions (6) - 15 freq |
SoundEx code - C561 conurbation - 1 freq conurbations - 1 freq conorbruce - 1 freq ckmrbpigrb - 1 freq |
MetaPhone code - KNRBXNS conurbations - 1 freq |
CONURBATIONS |
| Time to execute Levenshtein function - 0.245558 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.375370 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.027877 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.037524 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.000938 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. |