Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
knives (0) - 18 freq knipes (1) - 3 freq nives (1) - 2 freq knifes (1) - 3 freq snipes (2) - 3 freq nines (2) - 11 freq fives (2) - 7 freq snuves (2) - 1 freq muives (2) - 7 freq knits (2) - 1 freq gives (2) - 19 freq unites (2) - 4 freq leives (2) - 3 freq kniped (2) - 1 freq wives (2) - 37 freq reives (2) - 2 freq kines (2) - 21 freq klines (2) - 1 freq kites (2) - 5 freq kiver (2) - 3 freq knave (2) - 48 freq olives (2) - 17 freq rives (2) - 4 freq niven (2) - 3 freq knife (2) - 99 freq |
knives (0) - 18 freq knifes (2) - 3 freq nives (2) - 2 freq knipes (2) - 3 freq nieves (3) - 14 freq knees (3) - 166 freq knave (3) - 48 freq knits (3) - 1 freq kines (3) - 21 freq knowes (3) - 23 freq snuves (3) - 1 freq neives (3) - 9 freq kness (4) - 1 freq kains (4) - 1 freq keings (4) - 9 freq knuts (4) - 1 freq knobs (4) - 5 freq invis (4) - 1 freq kins (4) - 13 freq knos (4) - 1 freq knuse (4) - 1 freq knaws (4) - 4 freq kinks (4) - 12 freq kinds (4) - 75 freq knows (4) - 146 freq |
SoundEx code - K512 knives - 18 freq kemp's - 1 freq knifes - 3 freq knapsack - 4 freq kemp-stanes - 1 freq knaps - 4 freq knobs - 5 freq k'napsek - 1 freq knipes - 3 freq kempves - 1 freq kenefick - 1 freq kemps - 4 freq kinfowk - 1 freq kin-fowk - 1 freq knobbies - 2 freq konfyeusd - 1 freq kennyofceltic - 1 freq knappis - 1 freq khympstuar - 1 freq |
MetaPhone code - NFS knives - 18 freq nieves - 14 freq neives - 9 freq knifes - 3 freq nephews - 6 freq nevis - 2 freq nephew's - 2 freq 'nephews' - 1 freq novice - 4 freq nives - 2 freq naevius - 1 freq navies - 1 freq noviss - 1 freq nava's - 2 freq niviews - 1 freq nghs - 1 freq nfias - 1 freq |
KNIVES |
Time to execute Levenshtein function - 0.165993 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.328975 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.027219 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.037612 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.000979 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. |