| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| galilee (0) - 58 freq galilee' (1) - 1 freq galilei (1) - 1 freq galileo (1) - 3 freq galilie (1) - 2 freq gallae (2) - 1 freq gaeilge (2) - 2 freq galilean (2) - 2 freq gliblee (2) - 2 freq ganglee (2) - 1 freq galle (2) - 1 freq galley (2) - 4 freq gamie (3) - 12 freq aileen (3) - 7 freq vailye (3) - 6 freq gallop (3) - 12 freq malice (3) - 3 freq aller (3) - 1 freq guller (3) - 1 freq haliket (3) - 2 freq familie (3) - 1 freq ganie (3) - 6 freq valyee (3) - 1 freq calflie (3) - 1 freq glide (3) - 18 freq |
galilee (0) - 58 freq galilie (1) - 2 freq galileo (1) - 3 freq galilei (1) - 1 freq galle (2) - 1 freq galilee' (2) - 1 freq gallae (2) - 1 freq galley (2) - 4 freq gullie (3) - 9 freq gall (3) - 4 freq gillie (3) - 2 freq galla (3) - 2 freq gaeilge (3) - 2 freq galilean (3) - 2 freq gliblee (3) - 2 freq gelled (4) - 1 freq grille (4) - 1 freq halle (4) - 4 freq glipe (4) - 9 freq slolee (4) - 1 freq villee (4) - 1 freq galore (4) - 22 freq aglee (4) - 1 freq wallie (4) - 25 freq lile (4) - 1 freq |
SoundEx code - G440 galilee - 58 freq galilie - 2 freq gallowlie - 2 freq galilee' - 1 freq galileo - 3 freq galilei - 1 freq glyl - 1 freq |
MetaPhone code - KLL clelia - 5 freq galilee - 58 freq killylea - 1 freq killyleah - 1 freq galilie - 2 freq gallowlie - 2 freq galilee' - 1 freq galileo - 3 freq galilei - 1 freq kahlil - 1 freq glyl - 1 freq |
GALILEE |
| Time to execute Levenshtein function - 0.316944 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.594810 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.067465 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.042346 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.000866 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. |