| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nfxt (0) - 1 freq nxt (1) - 38 freq nixt (1) - 473 freq next (1) - 955 freq nfxo (1) - 1 freq ntx (2) - 1 freq jfqxt (2) - 1 freq waxt (2) - 2 freq newt (2) - 1 freq ft (2) - 19 freq hft (2) - 1 freq 'nixt (2) - 1 freq not (2) - 733 freq nuxh (2) - 1 freq nxz (2) - 1 freq ”xt (2) - 1 freq -fit (2) - 1 freq neat (2) - 44 freq nfb (2) - 1 freq nuyt (2) - 1 freq eft (2) - 3 freq afft (2) - 1 freq xt (2) - 1 freq nit (2) - 10 freq nowt (2) - 116 freq |
nfxt (0) - 1 freq next (2) - 955 freq nfxo (2) - 1 freq nixt (2) - 473 freq nxt (2) - 38 freq neext (3) - 1 freq infit (3) - 1 freq neixt (3) - 3 freq unfit (3) - 1 freq nott (4) - 55 freq nait (4) - 1 freq sext (4) - 1 freq nkst (4) - 1 freq smxt (4) - 1 freq nsxo (4) - 1 freq hixt (4) - 1 freq ncht (4) - 5 freq noat (4) - 6 freq nxm (4) - 1 freq n't (4) - 2 freq taxt (4) - 3 freq fx (4) - 4 freq 'fit (4) - 41 freq nxr (4) - 1 freq nght (4) - 2 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 - NFKST nfxt - 1 freq |
NFXT |
| Time to execute Levenshtein function - 0.216292 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.369431 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.030246 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.039836 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.000899 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. |