| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gabriel (0) - 8 freq gabriell (1) - 1 freq abril (2) - 1 freq garpel (2) - 1 freq gabriella (2) - 1 freq ariel (2) - 5 freq aeriel (2) - 1 freq umbriel (2) - 1 freq gabbie (2) - 1 freq gamrie (2) - 5 freq gabsie (2) - 1 freq garret (3) - 4 freq grizel (3) - 15 freq gruel (3) - 3 freq gadie (3) - 5 freq larries (3) - 8 freq gabblet (3) - 1 freq girnel (3) - 2 freq barrel (3) - 42 freq lairie (3) - 2 freq abdie (3) - 1 freq gabbled (3) - 1 freq rabies (3) - 2 freq habbie' (3) - 1 freq harrier (3) - 2 freq |
gabriel (0) - 8 freq gabriell (2) - 1 freq umbriel (3) - 1 freq gabriella (3) - 1 freq abril (3) - 1 freq baurel (4) - 2 freq gruel (4) - 3 freq gabble (4) - 1 freq gavrilo (4) - 1 freq brel (4) - 2 freq gable (4) - 8 freq gabbie (4) - 1 freq ariel (4) - 5 freq aeriel (4) - 1 freq garpel (4) - 1 freq gamrie (4) - 5 freq gabsie (4) - 1 freq girl (5) - 76 freq brill (5) - 12 freq april (5) - 117 freq gried (5) - 8 freq gael (5) - 2 freq mareel (5) - 3 freq abreed (5) - 5 freq beerial (5) - 10 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 - KBRL gabriel - 8 freq gabriella - 1 freq gabriell - 1 freq |
GABRIEL |
| Time to execute Levenshtein function - 0.200685 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.423148 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.028572 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.039601 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.001092 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. |