Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kilns (0) - 1 freq kills (1) - 19 freq milns (1) - 1 freq kins (1) - 15 freq kilos (1) - 1 freq kirns (1) - 2 freq kilts (1) - 15 freq kiln (1) - 7 freq kill- (2) - 3 freq til's (2) - 6 freq films (2) - 39 freq wilny (2) - 2 freq tins (2) - 38 freq files (2) - 108 freq oiles (2) - 1 freq wilno (2) - 2 freq ains (2) - 14 freq kilo (2) - 1 freq binns (2) - 2 freq pirns (2) - 1 freq pins (2) - 15 freq kiang (2) - 1 freq kill (2) - 215 freq killy (2) - 9 freq mills (2) - 33 freq |
kilns (0) - 1 freq kirns (2) - 2 freq kiln (2) - 7 freq kilos (2) - 1 freq kilts (2) - 15 freq kins (2) - 15 freq kills (2) - 19 freq milns (2) - 1 freq kitlins (3) - 6 freq kles (3) - 2 freq kains (3) - 1 freq kyles (3) - 3 freq kells (3) - 7 freq kelng (3) - 1 freq eilins (3) - 4 freq lins (3) - 3 freq klines (3) - 1 freq lions (3) - 35 freq kines (3) - 21 freq kens (3) - 531 freq ailins (3) - 1 freq kyns (3) - 2 freq killins (3) - 1 freq kaens (3) - 2 freq kailas (3) - 1 freq |
SoundEx code - K452 killing - 7 freq killins - 1 freq klankan - 1 freq killinchy - 3 freq killin-strang - 1 freq klyms - 1 freq kelng - 1 freq kilns - 1 freq killings - 2 freq kleenex - 3 freq klinsmann - 3 freq klinsmann's - 2 freq klinsman - 1 freq kilncadzow-kincadie - 1 freq klingons - 1 freq kalonji - 1 freq killingeve - 1 freq klines - 1 freq kilngranny - 1 freq |
MetaPhone code - KLNS glance - 47 freq glence - 4 freq cleans - 9 freq glen's - 4 freq clowns - 16 freq clancy - 24 freq gallons - 13 freq glenn's - 1 freq clans - 26 freq glens - 43 freq killins - 1 freq colonsay - 1 freq cuilness - 1 freq cleanse - 3 freq colonies - 7 freq colin's - 5 freq collins - 3 freq clan's - 3 freq gleans - 1 freq coulness - 1 freq kilns - 1 freq glency - 1 freq colonise - 2 freq clean's - 1 freq clannies - 1 freq clones - 1 freq clynes - 1 freq 'glance' - 1 freq klines - 1 freq |
KILNS |
Time to execute Levenshtein function - 0.404980 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.710745 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.083749 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.086228 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.000777 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. |