| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| navachitta (0) - 12 freq navachitta's (2) - 1 freq capacity (5) - 38 freq lauchit (5) - 3 freq alacrity (5) - 1 freq sauchieha (5) - 1 freq acacia (5) - 2 freq natalia (5) - 2 freq hatchit (5) - 2 freq parachutin (5) - 1 freq broachit (5) - 1 freq laachter (5) - 3 freq mairchit (5) - 5 freq masochist (5) - 1 freq capacitie (5) - 1 freq bavaria (5) - 2 freq laichit (5) - 1 freq bauchilt (5) - 2 freq nichit (5) - 1 freq mauchit (5) - 2 freq patchito (5) - 1 freq nacht (5) - 2 freq machina (5) - 1 freq breachit (5) - 1 freq attachit (5) - 1 freq |
navachitta (0) - 12 freq navachitta's (4) - 1 freq avochat (7) - 1 freq nichit (7) - 1 freq anarchist (7) - 14 freq chitty (7) - 1 freq naucht (7) - 3 freq nacht (7) - 2 freq nanicht (7) - 1 freq nichtfa (7) - 2 freq nichty (8) - 3 freq nyackit (8) - 1 freq chett (8) - 1 freq necht (8) - 5 freq anarchists (8) - 2 freq fechtt (8) - 1 freq reachit (8) - 2 freq nicht' (8) - 2 freq pauchilt (8) - 1 freq parachutes (8) - 4 freq chatte (8) - 6 freq marchit (8) - 2 freq nochts (8) - 1 freq unsichtit (8) - 1 freq laacht (8) - 6 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 - NFXT navachitta - 12 freq |
NAVACHITTA |
| Time to execute Levenshtein function - 0.201546 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.411986 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.027773 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.038590 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.000986 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. |