| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navigatin (0) - 2 freq navigation (1) - 3 freq navigator (2) - 1 freq navigate (2) - 7 freq navigatour (3) - 1 freq negatin (3) - 2 freq nominatin (3) - 1 freq agitatin (3) - 2 freq davygavin (3) - 33 freq 'navigate' (3) - 1 freq radiatin (3) - 3 freq salivatin (3) - 5 freq validatin (3) - 1 freq nigglin (4) - 3 freq advocatin (4) - 1 freq invitin (4) - 16 freq laigh-in (4) - 1 freq vitamin (4) - 34 freq invitation (4) - 27 freq maitin (4) - 1 freq motivatin (4) - 2 freq oangawin (4) - 1 freq animatit (4) - 3 freq saitin (4) - 3 freq airtin (4) - 36 freq |
navigatin (0) - 2 freq navigation (1) - 3 freq navigate (3) - 7 freq navigator (3) - 1 freq negatin (4) - 2 freq navigatour (4) - 1 freq invigoratin (5) - 1 freq invitin (5) - 16 freq negation (5) - 2 freq invitation (5) - 27 freq 'navigate' (5) - 1 freq davygavin (5) - 33 freq novation (5) - 1 freq nominatin (5) - 1 freq nittin (6) - 3 freq oangaein (6) - 6 freq nyiggin (6) - 1 freq delegatin (6) - 1 freq vaigin (6) - 4 freq avertin (6) - 1 freq ianhigton (6) - 1 freq angstin (6) - 1 freq variation (6) - 18 freq naition (6) - 1 freq neighin (6) - 1 freq |
SoundEx code - N123 navigation - 3 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 - NFKTN navigatin - 2 freq |
NAVIGATIN |
| Time to execute Levenshtein function - 0.368362 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.619334 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.037231 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.051438 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.001010 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. |