| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| conorbruce (0) - 1 freq nodbruce (3) - 1 freq confrence (4) - 1 freq construck (4) - 1 freq honorarie (4) - 1 freq honorre (4) - 1 freq construct (4) - 4 freq contribute (4) - 21 freq concordance (4) - 3 freq fionabruce (4) - 1 freq conserve (5) - 2 freq concordances (5) - 2 freq conclude (5) - 11 freq motorbike (5) - 3 freq coortlie (5) - 2 freq coherence (5) - 2 freq cooperate (5) - 2 freq correct (5) - 40 freq coorse (5) - 831 freq conrie (5) - 1 freq honorar (5) - 1 freq nourice (5) - 3 freq confluence (5) - 3 freq fortrace (5) - 7 freq bruce (5) - 352 freq |
conorbruce (0) - 1 freq nodbruce (5) - 1 freq fionabruce (6) - 1 freq conspiracy (7) - 11 freq concordance (7) - 3 freq centerprece (7) - 1 freq cenrre (7) - 1 freq contribute (7) - 21 freq honorre (7) - 1 freq construck (7) - 1 freq confrence (7) - 1 freq construct (7) - 4 freq honorarie (7) - 1 freq canonbie (8) - 1 freq contrar (8) - 10 freq conurbation (8) - 1 freq conveniece (8) - 1 freq confeirance (8) - 2 freq conveence (8) - 1 freq cynosure (8) - 1 freq concience (8) - 1 freq contributed (8) - 7 freq conveyance (8) - 1 freq consairve (8) - 2 freq correck (8) - 3 freq |
SoundEx code - C561 conurbation - 1 freq conurbations - 1 freq conorbruce - 1 freq ckmrbpigrb - 1 freq |
MetaPhone code - KNRBRS conorbruce - 1 freq |
CONORBRUCE |
| Time to execute Levenshtein function - 0.225147 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.436367 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.029819 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.039232 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.000882 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. |