| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rickle-o-banes (0) - 1 freq picket-lines (6) - 1 freq rig-banes (6) - 1 freq fine-baned (7) - 1 freq grice-ingans (7) - 1 freq kickenbacks (7) - 1 freq rickles (7) - 4 freq fingerbanes (7) - 1 freq bare-banes (7) - 1 freq muckle-scale (7) - 1 freq pickie-beds (7) - 1 freq rig-bane (7) - 2 freq richteousness (7) - 3 freq aipple-boxes (7) - 1 freq heckle-pins (7) - 4 freq brocklebank (7) - 1 freq rickedwards (7) - 2 freq windae-panes (7) - 2 freq chuckie-stanes (7) - 2 freq nicolaforbes (7) - 8 freq ricksons (7) - 1 freq river-bank (7) - 1 freq nickeledon's (7) - 1 freq ingle-stane (7) - 2 freq rattlestanes (7) - 1 freq |
rickle-o-banes (0) - 1 freq rock-a-bye (10) - 1 freq heckle-pins (10) - 4 freq heckle-peens (10) - 1 freq rig-banes (10) - 1 freq picket-lines (10) - 1 freq pickie-beds (11) - 1 freq knucklebones (11) - 1 freq ricksons (11) - 1 freq rickles (11) - 4 freq recklessness (11) - 2 freq brocklebank (11) - 1 freq pile-ons (12) - 1 freq coke-cans (12) - 2 freq link-stanes (12) - 1 freq caledones (12) - 1 freq whalebanes (12) - 1 freq mickle-ee (12) - 1 freq riggy-bane (12) - 2 freq rigbanes (12) - 3 freq reckons (12) - 8 freq brockelbank (12) - 1 freq rackless (12) - 1 freq airch-stanes (12) - 1 freq ruckles (12) - 1 freq |
SoundEx code - R241 resolve - 11 freq resolved - 8 freq rockliffe - 1 freq resolvit - 2 freq recleeved - 1 freq resolvan - 1 freq resslova - 2 freq rickle-o-banes - 1 freq rage-levels - 1 freq resolvin - 1 freq rqzlavszi - 1 freq resolving - 1 freq |
MetaPhone code - RKLBNS rickle-o-banes - 1 freq |
RICKLE-O-BANES |
| Time to execute Levenshtein function - 0.255940 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.422507 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.028466 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.037601 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.000881 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. |