| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| afjgillespie (0) - 1 freq gillespie (3) - 5 freq jwgillespie (3) - 1 freq g'lespie (5) - 1 freq glesgie (6) - 6 freq achilles' (6) - 1 freq aftfiles (6) - 1 freq 'sillerie (6) - 1 freq argillin (6) - 1 freq golspie (6) - 1 freq gleskie (6) - 3 freq glessie (6) - 3 freq gallerie (6) - 1 freq aillie (6) - 1 freq gillie (6) - 2 freq fillee (6) - 1 freq filletin (6) - 2 freq agirlspod (6) - 1 freq sillerie (6) - 15 freq fleshie (6) - 1 freq achilles (6) - 5 freq chrisleslie (6) - 2 freq alikeapie (6) - 1 freq ringinlie (7) - 1 freq villee (7) - 1 freq |
afjgillespie (0) - 1 freq jwgillespie (5) - 1 freq gillespie (5) - 5 freq g'lespie (8) - 1 freq golspie (9) - 1 freq frills (10) - 1 freq fufills (10) - 1 freq achilles (10) - 5 freq fleshie (10) - 1 freq fills (10) - 36 freq gills (10) - 8 freq angells (10) - 1 freq gillies (10) - 7 freq gillis (10) - 1 freq faills (10) - 1 freq fjellveien (10) - 1 freq angellis (10) - 1 freq fullest (10) - 2 freq gleskie (10) - 3 freq glessie (10) - 3 freq agirlspod (10) - 1 freq aftfiles (10) - 1 freq glesgie (10) - 6 freq achilles' (10) - 1 freq gallerie (10) - 1 freq |
SoundEx code - A124 absolute - 73 freq absolve - 3 freq absolutely - 140 freq abigail - 2 freq apocalypse - 10 freq aff-kilter - 1 freq absolved - 1 freq apocalyptic - 6 freq absolyute - 1 freq apskeelin - 2 freq apskeel - 2 freq absolution - 3 freq absolutists - 1 freq €œabsolutely - 3 freq abzolutelyabz - 2 freq absoluteginius - 1 freq auobglasgow - 1 freq afjgillespie - 1 freq aibsolutely - 1 freq afzal - 1 freq apashley - 4 freq |
MetaPhone code - AFJJLSP afjgillespie - 1 freq |
AFJGILLESPIE |
| Time to execute Levenshtein function - 0.209789 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.369089 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.028844 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.040987 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.000926 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. |