| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keirsimmonsitv (0) - 1 freq keeriosity (6) - 1 freq dismoontit (7) - 1 freq summonit (7) - 2 freq eisie-osie (7) - 1 freq versions (7) - 36 freq fitzsimmons (7) - 1 freq reprimandit (7) - 1 freq vairsions (7) - 10 freq simmons (7) - 1 freq testimonie (8) - 4 freq miscoontit (8) - 1 freq personality (8) - 21 freq kettilonia (8) - 4 freq meessions (8) - 1 freq curiosity (8) - 34 freq sessions (8) - 22 freq trimmins (8) - 5 freq weiriors (8) - 1 freq persist (8) - 9 freq ceremonial (8) - 1 freq recommendit (8) - 15 freq ammonite (8) - 1 freq kirsenin (8) - 1 freq summons (8) - 3 freq |
keirsimmonsitv (0) - 1 freq simmons (11) - 1 freq summonit (11) - 2 freq keeriosity (11) - 1 freq simmans (12) - 1 freq trimmins (12) - 5 freq lordimmunitas (12) - 2 freq kirstent (12) - 1 freq oversensitive (12) - 1 freq krissint (12) - 1 freq summons (12) - 3 freq simmins (12) - 1 freq recommendit (12) - 15 freq kirsent (12) - 2 freq vairsions (12) - 10 freq reprimandit (12) - 1 freq fitzsimmons (12) - 1 freq versions (12) - 36 freq summont (12) - 2 freq kirstenins (12) - 1 freq kimmins (12) - 1 freq dismoontit (12) - 1 freq esslemont (13) - 3 freq 'commonity (13) - 1 freq kervins (13) - 6 freq |
SoundEx code - K625 kirkmaiden - 3 freq kirk-gangin - 1 freq kirk-goin - 1 freq kirsent - 2 freq kerosene - 2 freq kirkness - 1 freq kraikin - 1 freq kerrjin - 2 freq krissint - 1 freq kirsen - 2 freq kirkconnel - 3 freq kirsenin - 1 freq kirkmen - 2 freq kargem - 1 freq kirkmabreeke - 2 freq krissent - 1 freq kirkman - 1 freq krisamas - 6 freq kirkintilloch - 1 freq krishnas - 5 freq krishna - 11 freq kirkmuirhill - 1 freq keirsimmonsitv - 1 freq kerryjaneellis - 1 freq krishnan - 1 freq kerrycann - 1 freq krazkmr - 8 freq kkrcnnzbuj - 1 freq kriskiwim - 4 freq |
MetaPhone code - KRSMNSTF keirsimmonsitv - 1 freq |
KEIRSIMMONSITV |
| Time to execute Levenshtein function - 0.249990 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.425476 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.027440 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.044040 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.001124 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. |