| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| npjt (0) - 1 freq nt (2) - 34 freq nait (2) - 1 freq pdt (2) - 1 freq pyt (2) - 2 freq npu (2) - 1 freq ncht (2) - 5 freq svjt (2) - 1 freq pst (2) - 1 freq appt (2) - 1 freq nixt (2) - 473 freq uppt (2) - 1 freq nzt (2) - 1 freq nint (2) - 4 freq ngpjw (2) - 1 freq nirt (2) - 1 freq pet (2) - 135 freq 'pit (2) - 15 freq np (2) - 5 freq nippt (2) - 5 freq nout (2) - 2 freq nowt (2) - 116 freq nest (2) - 81 freq npx (2) - 1 freq pjx (2) - 1 freq |
npjt (0) - 1 freq onpit (3) - 1 freq input (3) - 4 freq nept (3) - 1 freq inpit (3) - 49 freq nippt (3) - 5 freq sput (4) - 8 freq put (4) - 566 freq njc (4) - 1 freq pjw (4) - 1 freq opt (4) - 2 freq njl (4) - 1 freq pit (4) - 2571 freq pt (4) - 5 freq sjt (4) - 1 freq up't (4) - 1 freq spit (4) - 69 freq cpt (4) - 1 freq vpt (4) - 1 freq nvt (4) - 1 freq rpjj (4) - 1 freq 'put (4) - 5 freq pmt (4) - 3 freq npn (4) - 1 freq spet (4) - 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 - NPJT npjt - 1 freq |
NPJT |
| Time to execute Levenshtein function - 0.270344 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.433086 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.029672 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.053792 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.000884 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. |