Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
shortbreed (0) - 3 freq shortbreid (1) - 12 freq shortbread (1) - 6 freq shoartbreid (2) - 1 freq shortened (3) - 2 freq showbreid (3) - 2 freq horreed (3) - 1 freq shoehorned (4) - 1 freq shortlisted (4) - 1 freq shortlie (4) - 1 freq snorted (4) - 7 freq shuttered (4) - 2 freq mortifeed (4) - 1 freq shortages (4) - 1 freq shouted (4) - 248 freq snortled (4) - 1 freq shoured (4) - 1 freq shoodered (4) - 3 freq tortured (4) - 18 freq short-term (4) - 2 freq horrifeed (4) - 3 freq stoitered (4) - 1 freq oshortbreeds (4) - 1 freq shouteen (4) - 1 freq boortrees (4) - 7 freq |
shortbreed (0) - 3 freq shortbreid (1) - 12 freq shortbread (1) - 6 freq shoartbreid (2) - 1 freq showbreid (5) - 2 freq shortened (5) - 2 freq shaltered (6) - 2 freq shorthaund (6) - 1 freq shorthaand (6) - 1 freq shargered (6) - 1 freq shorter (6) - 24 freq shattered (6) - 23 freq sheltered (6) - 12 freq chartered (6) - 1 freq hertbrek (6) - 1 freq short-arse (6) - 1 freq shuttered (6) - 2 freq horreed (6) - 1 freq shortsome (7) - 2 freq sottered (7) - 1 freq shortage (7) - 6 freq shortleesa (7) - 2 freq stootered (7) - 2 freq shoarded (7) - 1 freq stottered (7) - 3 freq |
SoundEx code - S631 sword-fechtin - 1 freq screwtaps - 1 freq shortbread - 6 freq shortbreid - 12 freq screwed-up - 3 freq shortfaw - 1 freq scurtfoos - 3 freq shortbreed - 3 freq skurtfoo - 1 freq shoartbreid - 1 freq screw-tap-dancin - 1 freq skurtfu - 2 freq scarredparrot - 1 freq |
MetaPhone code - XRTBRT shortbread - 6 freq shortbreid - 12 freq shortbreed - 3 freq shoartbreid - 1 freq |
SHORTBREED |
Time to execute Levenshtein function - 0.220125 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.409034 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.027530 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.045242 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.001178 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. |