| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gilbert (0) - 15 freq gilberto (1) - 1 freq filbert (1) - 3 freq 'albert (2) - 1 freq gibbet (2) - 5 freq fibert (2) - 2 freq sillert (2) - 1 freq albert (2) - 25 freq guldert (2) - 13 freq libert (2) - 1 freq githert (2) - 3 freq gollert (2) - 7 freq halbert (2) - 2 freq gilbert's (2) - 1 freq glert (2) - 1 freq gullert (2) - 18 freq €˜gilbert (2) - 1 freq gimmer (3) - 2 freq lingert (3) - 2 freq silent (3) - 140 freq timmert (3) - 1 freq gleers (3) - 1 freq gaithert (3) - 79 freq gleet (3) - 8 freq cindert (3) - 1 freq |
gilbert (0) - 15 freq gilberto (1) - 1 freq filbert (2) - 3 freq gollert (3) - 7 freq halbert (3) - 2 freq glert (3) - 1 freq gullert (3) - 18 freq libert (3) - 1 freq guldert (3) - 13 freq 'albert (3) - 1 freq albert (3) - 25 freq glaurt (4) - 1 freq glowert (4) - 21 freq alberto (4) - 2 freq alberta (4) - 1 freq gilbertese (4) - 1 freq liberty (4) - 31 freq githert (4) - 3 freq fibert (4) - 2 freq gibbet (4) - 5 freq gilbert's (4) - 1 freq sillert (4) - 1 freq €˜gilbert (4) - 1 freq yollert (5) - 2 freq gallery (5) - 23 freq |
SoundEx code - G416 gale-force' - 1 freq gilbert - 15 freq golfer - 1 freq glaiberin - 1 freq gilbert's - 1 freq gilberto - 1 freq golfers - 2 freq gulliver's - 3 freq gilbertese - 1 freq gallowayforestpark - 1 freq galbraith - 2 freq galbraith's - 1 freq galbraiths - 1 freq glabber - 1 freq €˜gilbert - 1 freq gulberwick - 1 freq gilbertsongrant - 1 freq gallowayforest - 1 freq |
MetaPhone code - JLBRT gilbert - 15 freq gilberto - 1 freq €˜gilbert - 1 freq |
GILBERT |
| Time to execute Levenshtein function - 0.189467 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.323833 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.027595 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.036815 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.000836 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. |