| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gabrielneil (0) - 1 freq gabriell (3) - 1 freq gabriel (4) - 8 freq gabriella (4) - 1 freq garrisoned (5) - 1 freq gardeners (5) - 10 freq galilei (5) - 1 freq gairdenin (5) - 8 freq briefness (5) - 1 freq bikerneil (5) - 4 freq grenein (5) - 1 freq gairdeners (5) - 28 freq adrienne (5) - 1 freq gabrielscally (5) - 1 freq gairdenfit (5) - 2 freq gaerdenin (5) - 1 freq grabbieness (5) - 1 freq gairdener (5) - 9 freq gardener (5) - 2 freq grevel (6) - 4 freq grien (6) - 3 freq gaberdine (6) - 1 freq bareley (6) - 1 freq gainnlin (6) - 1 freq brendin (6) - 1 freq |
gabrielneil (0) - 1 freq gabriell (4) - 1 freq gabriella (5) - 1 freq gabriel (6) - 8 freq gaberlunzie (7) - 5 freq gardener (8) - 2 freq gairdener (8) - 9 freq gbell (8) - 1 freq gaerdenin (8) - 1 freq gabblin (8) - 4 freq gaberdine (8) - 1 freq gabardine (8) - 1 freq brill (8) - 12 freq grill (8) - 5 freq galilei (8) - 1 freq gomrell (8) - 1 freq garrisoned (8) - 1 freq gairdenin (8) - 8 freq bikerneil (8) - 4 freq girnel (8) - 2 freq grille (8) - 1 freq grenein (8) - 1 freq gabrielscally (8) - 1 freq garfunkel (9) - 2 freq griens (9) - 1 freq |
SoundEx code - G164 gabriel - 8 freq gaberlunzie - 5 freq 'gaberlunzie' - 1 freq gaberlunzies - 2 freq gabriella - 1 freq gaberlunzieman - 1 freq gibraltar - 5 freq gabriell - 1 freq gavrilo - 1 freq gabrielneil - 1 freq gabrielscally - 1 freq gabrielsnapper - 1 freq |
MetaPhone code - KBRLNL gabrielneil - 1 freq |
GABRIELNEIL |
| Time to execute Levenshtein function - 0.422718 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.591903 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.028528 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.037646 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.000857 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. |