| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| natives (0) - 13 freq native (1) - 94 freq natures (2) - 3 freq nytimes (2) - 1 freq nives (2) - 2 freq captives (2) - 2 freq latimes (2) - 1 freq motives (2) - 4 freq aatimes (2) - 1 freq neives (2) - 10 freq nasties (2) - 1 freq noties (2) - 2 freq negatives (2) - 3 freq satires (2) - 5 freq waives (2) - 1 freq fativer (2) - 1 freq naitves (2) - 1 freq notices (2) - 16 freq navies (2) - 1 freq nations (2) - 65 freq naimes (2) - 5 freq naive (2) - 11 freq noticet (3) - 1 freq satins (3) - 1 freq daies (3) - 2 freq |
natives (0) - 13 freq naitves (2) - 1 freq native (2) - 94 freq negatives (3) - 3 freq noties (3) - 2 freq navies (3) - 1 freq nations (3) - 65 freq notices (3) - 16 freq neives (3) - 10 freq nives (3) - 2 freq nytimes (3) - 1 freq motives (3) - 4 freq natures (3) - 3 freq notis (4) - 1 freq notions (4) - 40 freq nieves (4) - 15 freq taves (4) - 4 freq natiouns (4) - 2 freq nats (4) - 2 freq nativities (4) - 1 freq nat's (4) - 1 freq nutties (4) - 1 freq naturs (4) - 1 freq naters (4) - 1 freq nerves (4) - 44 freq |
SoundEx code - N312 notebook - 14 freq note-book - 6 freq notebooks - 1 freq notebuik - 1 freq natives - 13 freq nottbook - 1 freq nott-book - 1 freq notebeuk - 1 freq ndpbs - 3 freq notification - 1 freq notifications - 4 freq notebuiks - 1 freq naitves - 1 freq |
MetaPhone code - NTFS natives - 13 freq naitves - 1 freq |
NATIVES |
| Time to execute Levenshtein function - 0.187317 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.368001 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.027507 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.036918 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.000923 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. |