Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
shortbreid (0) - 12 freq shortbread (1) - 6 freq shoartbreid (1) - 1 freq shortbreed (1) - 3 freq showbreid (2) - 2 freq shore-heid (3) - 1 freq scottreid (3) - 1 freq shortened (3) - 2 freq shortenin (4) - 2 freq shattered (4) - 23 freq shuttered (4) - 2 freq snorted (4) - 7 freq scotsleid (4) - 3 freq shouted (4) - 248 freq snortled (4) - 1 freq shorthaund (4) - 1 freq chortled (4) - 2 freq tortered (4) - 1 freq sottered (4) - 1 freq shargered (4) - 1 freq chartered (4) - 1 freq shoodered (4) - 3 freq shortages (4) - 1 freq shoreheids (4) - 1 freq shooted (4) - 1 freq |
shortbreid (0) - 12 freq shortbreed (1) - 3 freq shoartbreid (1) - 1 freq shortbread (1) - 6 freq showbreid (4) - 2 freq shortened (5) - 2 freq whitebreid (6) - 1 freq shargered (6) - 1 freq shorthaund (6) - 1 freq shaltered (6) - 2 freq shorter (6) - 24 freq shorthaand (6) - 1 freq chartered (6) - 1 freq hertbrek (6) - 1 freq sheltered (6) - 12 freq scottreid (6) - 1 freq shore-heid (6) - 1 freq shuttered (6) - 2 freq shattered (6) - 23 freq stootered (7) - 2 freq shortlie (7) - 1 freq stoitered (7) - 1 freq thorture (7) - 2 freq short-term (7) - 2 freq sorted (7) - 75 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 |
SHORTBREID |
Time to execute Levenshtein function - 0.195525 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.359582 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.027088 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.036776 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.000837 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. |