| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kilmartin (0) - 1 freq raemartin (3) - 1 freq dmartin (3) - 4 freq fulmartis (3) - 1 freq plartin (3) - 1 freq martin (3) - 47 freq leemartin (3) - 1 freq €œmartin (3) - 1 freq clartin (3) - 4 freq gilmerton (3) - 1 freq cartin (4) - 1 freq markin (4) - 17 freq fleatin (4) - 1 freq skartin (4) - 4 freq divertin (4) - 6 freq kidnappin (4) - 1 freq i'mornin (4) - 4 freq €œlearnin (4) - 1 freq giltin (4) - 2 freq smartie (4) - 1 freq martins (4) - 2 freq mairtin (4) - 1 freq disportin (4) - 1 freq kincardine (4) - 5 freq sillerin (4) - 4 freq |
kilmartin (0) - 1 freq leemartin (4) - 1 freq gilmerton (4) - 1 freq €œmartin (5) - 1 freq clartin (5) - 4 freq kilmarotary (5) - 1 freq martin (5) - 47 freq raemartin (5) - 1 freq dmartin (5) - 4 freq plartin (5) - 1 freq fulmartis (5) - 1 freq clarten (6) - 1 freq dalmatian (6) - 1 freq flirtin (6) - 5 freq blirtin (6) - 2 freq killertron (6) - 1 freq kloorin (6) - 1 freq martian (6) - 7 freq fulmart (6) - 1 freq martyn (6) - 1 freq kelman (6) - 6 freq kelterin (6) - 1 freq smarten (6) - 1 freq martino (6) - 1 freq formartine (6) - 1 freq |
SoundEx code - K456 kilmarnock - 18 freq killonerry - 1 freq keel-marks - 1 freq kilmartin - 1 freq kilmaurnock - 5 freq kylemuirhead - 2 freq kilmarotary - 1 freq kilmarnockfc - 3 freq kilmarnockwfc - 1 freq kilmarnockrfc - 1 freq |
MetaPhone code - KLMRTN kilmartin - 1 freq |
KILMARTIN |
| Time to execute Levenshtein function - 0.226310 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.411196 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.030861 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.040326 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.000939 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. |