| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reek-bleckened (0) - 1 freq smoke-blackened (5) - 1 freq bleckened (5) - 5 freq seeckened (6) - 1 freq re-checked (6) - 1 freq reed-bleedit (6) - 1 freq blackened (6) - 7 freq weel-blessed (6) - 1 freq faem-flecked (6) - 1 freq mirk-bleck (7) - 1 freq expleened (7) - 1 freq reed-faced (7) - 6 freq peekie-kind (7) - 1 freq beckoned (7) - 4 freq deep-seasoned (7) - 1 freq reid-fuskered (7) - 1 freq dew-decked (7) - 1 freq reeseeved (7) - 1 freq weel-plenished (7) - 1 freq raed-blooded (7) - 1 freq deep-layered (7) - 1 freq re-opened (7) - 1 freq tree-lined (7) - 2 freq beelin-eened (7) - 2 freq reek-free (7) - 1 freq |
reek-bleckened (0) - 1 freq smoke-blackened (7) - 1 freq bleckened (8) - 5 freq blackened (9) - 7 freq mirk-bleck (10) - 1 freq re-checked (10) - 1 freq faem-flecked (10) - 1 freq blackend (10) - 1 freq raed-blooded (11) - 1 freq reckoned (11) - 10 freq erse-lickin (11) - 1 freq slockened (11) - 2 freq refleckin (11) - 4 freq slackened (11) - 2 freq blockeed (11) - 1 freq republicanes (11) - 1 freq wirk-rochened (11) - 1 freq peekie-kind (11) - 1 freq seeckened (11) - 1 freq reed-bleedit (11) - 1 freq beckoned (11) - 4 freq jet-bleck (11) - 1 freq weel-blessed (11) - 1 freq grey-bleached (11) - 1 freq blocked (12) - 40 freq |
SoundEx code - R214 reek-bleckened - 1 freq rockpools - 1 freq resplendent - 4 freq re-spell - 1 freq risible - 1 freq respellin - 1 freq roosevelt - 1 freq re-shuffle - 2 freq rrjvalentine - 1 freq rihcpl - 1 freq roezvlrkac - 1 freq |
MetaPhone code - RKBLKNT reek-bleckened - 1 freq |
REEK-BLECKENED |
| Time to execute Levenshtein function - 0.500059 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.768144 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.031781 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.042145 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.001110 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. |