| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gallivantin (0) - 4 freq gallavantin (1) - 1 freq gallivanting (1) - 1 freq gallivanted (2) - 2 freq galavantin (2) - 1 freq gallivant (2) - 1 freq salivatin (3) - 5 freq gallant (4) - 3 freq captivatin (4) - 3 freq galavant (4) - 1 freq gallants (4) - 1 freq validatin (4) - 1 freq gallantly (4) - 2 freq ballantine (4) - 1 freq ballancin (4) - 1 freq glintin (4) - 15 freq gallantry (4) - 1 freq allocatin (4) - 1 freq gillypants (5) - 149 freq agitatin (5) - 2 freq glintit (5) - 1 freq anointin (5) - 1 freq alienatin (5) - 1 freq paintin (5) - 45 freq hallirackit (5) - 1 freq |
gallivantin (0) - 4 freq gallavantin (1) - 1 freq gallivanting (2) - 1 freq gallivant (3) - 1 freq galavantin (3) - 1 freq gallivanted (3) - 2 freq ballantine (6) - 1 freq glintin (6) - 15 freq gallantry (6) - 1 freq gallantly (6) - 2 freq gallants (6) - 1 freq salivatin (6) - 5 freq galavant (6) - 1 freq gallant (6) - 3 freq hallucinatin (7) - 2 freq glentin (7) - 34 freq ballantyne (7) - 8 freq pollination (7) - 1 freq wellinton (7) - 1 freq gallovidian (7) - 1 freq glintan (7) - 1 freq gluntin (7) - 1 freq tullimentan (7) - 4 freq ballancin (7) - 1 freq gillypants (7) - 149 freq |
SoundEx code - G415 gulpin - 4 freq galloping - 1 freq gualifyin - 1 freq gollopin - 2 freq gallivantin - 4 freq gallopin - 6 freq gleven - 1 freq galvanised - 4 freq gallivanted - 2 freq gallopan - 1 freq galavant - 1 freq glæpin - 1 freq gallavantin - 1 freq gilpin - 1 freq golfin - 2 freq gallivant - 1 freq galvanise - 1 freq glaepin - 1 freq galavantin - 1 freq golfmk - 1 freq gallivanting - 1 freq gallofunky - 2 freq gillypants - 149 freq |
MetaPhone code - KLFNTN gallivantin - 4 freq gallavantin - 1 freq galavantin - 1 freq |
GALLIVANTIN |
| Time to execute Levenshtein function - 0.223022 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.398279 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.028294 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.038124 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.000890 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. |