| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navigatour (0) - 1 freq navigator (1) - 1 freq nairator (3) - 1 freq mairatour (3) - 1 freq navigate (3) - 7 freq navigation (3) - 3 freq navigatin (3) - 2 freq salvatour (4) - 1 freq vigour (4) - 6 freq narrator (4) - 30 freq mairattour (4) - 2 freq negator (4) - 6 freq saviour (4) - 14 freq litigator (4) - 1 freq garitour (4) - 3 freq 'navigate' (4) - 1 freq neighbour (4) - 42 freq naitur (4) - 75 freq radiator (4) - 10 freq alligator (4) - 3 freq instigator (4) - 1 freq langtoun (5) - 1 freq vibrator (5) - 1 freq motivator (5) - 1 freq savour (5) - 18 freq |
navigatour (0) - 1 freq navigator (1) - 1 freq navigate (4) - 7 freq navigation (4) - 3 freq navigatin (4) - 2 freq negator (5) - 6 freq nairator (5) - 1 freq mairatour (6) - 1 freq 'navigate' (6) - 1 freq invigilator (6) - 2 freq naitur (6) - 75 freq litigator (6) - 1 freq instigator (6) - 1 freq vigour (6) - 6 freq alligator (6) - 3 freq narrator (6) - 30 freq inventor (7) - 6 freq avatar (7) - 2 freq nagarr (7) - 2 freq lavatory (7) - 5 freq avontuur (7) - 1 freq visitor (7) - 23 freq naiture (7) - 4 freq naiter (7) - 2 freq notour (7) - 5 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 - NFKTR navigatour - 1 freq navigator - 1 freq |
NAVIGATOUR |
| Time to execute Levenshtein function - 0.247607 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.430630 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.027834 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.037509 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.000917 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. |