| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exack (0) - 7 freq erack (1) - 1 freq exact (1) - 56 freq enack (1) - 1 freq exak (1) - 1 freq exac' (1) - 1 freq exac (1) - 2 freq track (2) - 127 freq whack (2) - 15 freq pack (2) - 114 freq smack (2) - 25 freq eyck (2) - 1 freq sack (2) - 43 freq eck (2) - 425 freq hack (2) - 13 freq glack (2) - 1 freq vack (2) - 1 freq cmack (2) - 1 freq edick (2) - 1 freq soack (2) - 1 freq exect (2) - 1 freq lack (2) - 135 freq execs (2) - 1 freq clack (2) - 9 freq loack (2) - 8 freq |
exack (0) - 7 freq exac (2) - 2 freq exak (2) - 1 freq exac' (2) - 1 freq exact (2) - 56 freq erack (2) - 1 freq enack (2) - 1 freq rack (3) - 19 freq cack (3) - 4 freq quack (3) - 7 freq fack (3) - 180 freq weeack (3) - 2 freq expeck (3) - 53 freq tack (3) - 43 freq eleck (3) - 4 freq jack (3) - 224 freq aback (3) - 41 freq back (3) - 6115 freq expek (3) - 1 freq mack (3) - 22 freq loack (3) - 8 freq alack (3) - 1 freq exackly (3) - 51 freq 'ack (3) - 2 freq ack (3) - 42 freq |
SoundEx code - E220 echoes - 26 freq 'excuse - 4 freq excuse - 77 freq easy-osie - 3 freq exack - 7 freq easy-oasy - 3 freq essex - 2 freq easy-osey - 1 freq echaes - 2 freq echas - 4 freq ecosse - 6 freq essays - 21 freq easy-osy - 2 freq eshes - 6 freq excess - 10 freq exac' - 1 freq exac - 2 freq exis - 1 freq exes - 3 freq egos - 3 freq excaise - 6 freq ekkoas - 1 freq eeses - 1 freq ecus - 1 freq eggyies - 1 freq easie-oasie - 1 freq esau's - 1 freq excuise - 10 freq €œexcuse - 6 freq eggies - 4 freq excuize - 2 freq excheege - 1 freq exkeese - 1 freq eisie-osie - 1 freq exak - 1 freq excuiss - 3 freq €˜excuse - 2 freq eccies - 3 freq echos - 2 freq €˜echoic - 2 freq ejwiaz - 7 freq eeukzwxs - 1 freq exoj - 1 freq execs - 1 freq escocia - 2 freq ekaoq - 1 freq |
MetaPhone code - EKSK exack - 7 freq exac' - 1 freq exac - 2 freq exak - 1 freq eksq - 1 freq eyxg - 1 freq |
EXACK |
| Time to execute Levenshtein function - 0.212330 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.344765 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.029056 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.037826 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.000845 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. |