| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| native (0) - 94 freq naive (1) - 11 freq natives (1) - 13 freq naïve (2) - 5 freq nature (2) - 113 freq negative (2) - 41 freq nave (2) - 1 freq gatie (2) - 1 freq naise (2) - 2 freq neive (2) - 21 freq naetime (2) - 1 freq notice (2) - 175 freq katie (2) - 34 freq paive (2) - 1 freq laive (2) - 3 freq active (2) - 33 freq waive (2) - 3 freq alive (2) - 160 freq etive (2) - 1 freq nate (2) - 9 freq gaive (2) - 1 freq captive (2) - 4 freq narie (2) - 1 freq saive (2) - 1 freq nation (2) - 144 freq |
native (0) - 94 freq natives (2) - 13 freq naive (2) - 11 freq etive (3) - 1 freq active (3) - 33 freq nation (3) - 144 freq notie (3) - 8 freq natale (3) - 1 freq notice (3) - 175 freq natir (3) - 1 freq nate (3) - 9 freq negative (3) - 41 freq nature (3) - 113 freq naetime (3) - 1 freq nave (3) - 1 freq neive (3) - 21 freq nato (4) - 5 freq acteive (4) - 1 freq stiv (4) - 1 freq nieve (4) - 29 freq nato- (4) - 1 freq steive (4) - 12 freq anytime (4) - 29 freq naitves (4) - 1 freq nyte (4) - 1 freq |
SoundEx code - N310 native - 94 freq needfu - 12 freq netbaw - 1 freq nyatf - 1 freq needfu' - 43 freq nitb - 1 freq ntbppp - 1 freq nthf - 1 freq |
MetaPhone code - NTF native - 94 freq needfu - 12 freq needfu' - 43 freq |
NATIVE |
| Time to execute Levenshtein function - 0.178902 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.324329 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.028730 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.037521 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.000929 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. |