| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uberhonda (0) - 1 freq beyond (4) - 102 freq ronda (4) - 1 freq rhona (4) - 36 freq behynde (4) - 1 freq 'beyond (4) - 1 freq behinds (4) - 1 freq bermuda (4) - 2 freq persona (4) - 7 freq aberdonian (4) - 10 freq deerhund (4) - 1 freq veranda (4) - 5 freq bronde (4) - 1 freq deerhunds (4) - 1 freq tronda (4) - 1 freq oberon (4) - 1 freq broona (4) - 1 freq laberdonia (4) - 5 freq behold (4) - 14 freq behind (4) - 261 freq rhoda (4) - 3 freq 'behind' (4) - 1 freq brenda (4) - 14 freq deerhound (4) - 1 freq overhung (5) - 1 freq |
uberhonda (0) - 1 freq deerhund (5) - 1 freq bronde (5) - 1 freq behynde (5) - 1 freq deerhound (5) - 1 freq behind (5) - 261 freq brenda (5) - 14 freq brynd (6) - 2 freq rhind (6) - 1 freq behiynd (6) - 1 freq nearhand (6) - 2 freq brendy (6) - 1 freq birnand (6) - 2 freq burgandy (6) - 2 freq greyhound (6) - 3 freq burgundy (6) - 6 freq braandy (6) - 1 freq brandy (6) - 24 freq brand (6) - 51 freq rhoda (6) - 3 freq beachend (6) - 1 freq aberdonian (6) - 10 freq tronda (6) - 1 freq deerhunds (6) - 1 freq veranda (6) - 5 freq |
SoundEx code - U165 upbring - 1 freq upbringin - 5 freq up-brandy - 1 freq upfront - 1 freq uppermair - 4 freq uppermost - 6 freq upper-maist - 1 freq uppermaist - 2 freq upbringing - 4 freq uberhonda - 1 freq |
MetaPhone code - UBRHNT uberhonda - 1 freq |
UBERHONDA |
| Time to execute Levenshtein function - 0.391686 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.465349 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.028306 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.041570 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.000944 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. |