| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navigate (0) - 7 freq navigator (2) - 1 freq 'navigate' (2) - 1 freq navigatin (2) - 2 freq nairae (3) - 8 freq nikkigate (3) - 1 freq negate (3) - 2 freq laminate (3) - 2 freq mitigate (3) - 1 freq walligate (3) - 1 freq naigie (3) - 1 freq tailgate (3) - 1 freq latinate (3) - 21 freq gravitate (3) - 1 freq validate (3) - 4 freq bathgate (3) - 4 freq castigate (3) - 1 freq onigate (3) - 1 freq salivate (3) - 1 freq narrate (3) - 3 freq navigation (3) - 2 freq frigate (3) - 1 freq inanimate (3) - 2 freq nominate (3) - 1 freq caviare (3) - 1 freq |
navigate (0) - 7 freq navigator (3) - 1 freq navigatin (3) - 2 freq navigation (4) - 2 freq negate (4) - 2 freq onigate (4) - 1 freq 'navigate' (4) - 1 freq navigatour (4) - 1 freq frigate (5) - 1 freq onygate (5) - 1 freq inanimate (5) - 2 freq waygate (5) - 1 freq agate (5) - 2 freq animate (5) - 1 freq invite (5) - 43 freq nominate (5) - 1 freq narrate (5) - 3 freq naigie (5) - 1 freq mitigate (5) - 1 freq naggit (5) - 1 freq tailgate (5) - 1 freq nikkigate (5) - 1 freq vaigit (5) - 1 freq ingate (5) - 4 freq overgate (6) - 3 freq |
SoundEx code - N123 navigation - 2 freq new-bocht - 2 freq navigate - 7 freq navigatin - 2 freq neep-shed - 1 freq 'navigate' - 1 freq nbeist - 1 freq navachitta - 12 freq navachitta's - 1 freq navigatour - 1 freq navigator - 1 freq newbiggit - 1 freq nbsjtfw - 1 freq nfegwdt - 1 freq npjt - 1 freq naefestivals - 1 freq nfustweets - 1 freq niupxzodx - 1 freq npqtpz - 1 freq nvwxtssdbe - 1 freq nfxt - 1 freq |
MetaPhone code - NFKT navigate - 7 freq 'navigate' - 1 freq |
NAVIGATE |
| Time to execute Levenshtein function - 0.186875 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.357857 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.027870 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.048705 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.000805 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. |