| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beanieforindy (0) - 1 freq janforindy (4) - 3 freq bridgesforindy (5) - 2 freq outforindy (6) - 1 freq meandering (6) - 1 freq branderin (6) - 1 freq seniority (6) - 1 freq landoflindy (6) - 1 freq meanderin (6) - 1 freq benefitin (6) - 2 freq meaninfully (7) - 1 freq bearing (7) - 6 freq santerin (7) - 1 freq blabberin (7) - 2 freq bonnieheid (7) - 1 freq uninformed (7) - 1 freq daanerin (7) - 1 freq envelopin (7) - 1 freq 'california (7) - 1 freq featherin (7) - 2 freq seanmorod (7) - 1 freq badderin (7) - 1 freq monitorin (7) - 3 freq chanterin (7) - 1 freq dannerin (7) - 4 freq |
beanieforindy (0) - 1 freq janforindy (5) - 3 freq outforindy (8) - 1 freq benefitin (8) - 2 freq befriend (8) - 1 freq boyfriend (9) - 36 freq bedford (9) - 1 freq benefitted (9) - 1 freq deifferand (9) - 8 freq bantered (9) - 1 freq binnerin (9) - 1 freq uniformed (9) - 1 freq ranforced (9) - 1 freq uninformed (9) - 1 freq enforced (9) - 3 freq baneyerd (9) - 1 freq benefited (9) - 2 freq landoflindy (9) - 1 freq branderin (9) - 1 freq meandering (9) - 1 freq bridgesforindy (9) - 2 freq banefire (9) - 3 freq meanderin (9) - 1 freq banefed (9) - 2 freq reinforced (9) - 1 freq |
SoundEx code - B516 bombers - 7 freq bonfires - 8 freq bonfire - 28 freq banefire - 3 freq bumper - 3 freq bonaparte - 2 freq bambrick - 1 freq bumper's - 1 freq bonnieburgh - 4 freq 'bombardment - 1 freq bomber's - 1 freq bombardments - 1 freq bombardment - 1 freq bonefire - 1 freq bonaparty - 1 freq bomber - 3 freq bonfrost - 1 freq bombards - 1 freq bumbard - 1 freq bonnybrig - 1 freq bamber - 2 freq bonfire-bit - 1 freq bombardit - 1 freq binfire - 1 freq beanieforindy - 1 freq |
MetaPhone code - BNFRNT beanieforindy - 1 freq |
BEANIEFORINDY |
| Time to execute Levenshtein function - 0.217461 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.491330 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.041353 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.077690 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.000863 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. |