Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
exackly (0) - 51 freq exactly (1) - 321 freq exacklie (2) - 1 freq 'exactly (2) - 4 freq lackly (2) - 4 freq exack (2) - 7 freq crackly (2) - 3 freq puckly (3) - 12 freq lacky (3) - 1 freq sactly (3) - 1 freq euankay (3) - 1 freq prickly (3) - 2 freq leckly (3) - 2 freq enackin (3) - 2 freq knacky (3) - 3 freq erack (3) - 1 freq lickly (3) - 3 freq tackle (3) - 30 freq bracky (3) - 8 freq raclly (3) - 1 freq ackley (3) - 1 freq exactlhly (3) - 1 freq excel (3) - 3 freq 'ex-actly (3) - 3 freq tracky (3) - 12 freq |
exackly (0) - 51 freq exacklie (2) - 1 freq exactly (2) - 321 freq exack (3) - 7 freq lackly (3) - 4 freq tackle (4) - 30 freq ackley (4) - 1 freq wickly (4) - 2 freq excel (4) - 3 freq laeckly (4) - 1 freq muckly (4) - 1 freq lickly (4) - 3 freq rickly (4) - 1 freq sickly (4) - 6 freq ruckly (4) - 6 freq juickly (4) - 1 freq puckly (4) - 12 freq crackly (4) - 3 freq 'exactly (4) - 4 freq quickly (4) - 191 freq packle (4) - 1 freq exactlie (4) - 2 freq cackle (4) - 7 freq leckly (4) - 2 freq tickle (5) - 13 freq |
SoundEx code - E224 exackly - 51 freq ejaculating - 6 freq eeshogels - 1 freq ecisweel - 1 freq eiswecl - 1 freq ejaculation - 1 freq ejaculate - 1 freq eiss-shokkils - 1 freq ezekiel - 2 freq exacklie - 1 freq eqhqlivingston - 1 freq excusal - 1 freq |
MetaPhone code - EKSKL exackly - 51 freq exacklie - 1 freq |
EXACKLY |
Time to execute Levenshtein function - 0.194438 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.342292 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.027223 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.037289 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.000920 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. |