| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| joshhall (0) - 1 freq shall (3) - 123 freq soshal (3) - 4 freq soshwal (3) - 3 freq downhall (3) - 2 freq rosehill (3) - 3 freq joshua (3) - 13 freq goodhall (3) - 1 freq 'shall (3) - 1 freq domnhall (3) - 1 freq joshcar (3) - 1 freq 'she'll (4) - 8 freq fooball (4) - 1 freq toonhill (4) - 1 freq rosemill (4) - 1 freq ashvale (4) - 3 freq swaall (4) - 1 freq shi'll (4) - 1 freq jovial (4) - 1 freq €˜sall (4) - 1 freq no-he'll (4) - 1 freq schale (4) - 1 freq shawl (4) - 26 freq foswell (4) - 6 freq highball (4) - 1 freq |
joshhall (0) - 1 freq rosehill (5) - 3 freq shall (5) - 123 freq 'shall (5) - 1 freq jhill (6) - 19 freq solihull (6) - 1 freq westhill (6) - 3 freq shell (6) - 39 freq acshull (6) - 1 freq shill (6) - 4 freq sho'll (6) - 2 freq fish'll (6) - 1 freq shull (6) - 6 freq mishell (6) - 2 freq 'shell (6) - 1 freq ashmill (6) - 3 freq she'll (6) - 211 freq earshall (6) - 1 freq schull (6) - 1 freq shalla (6) - 9 freq shu'll (6) - 2 freq dasheill (6) - 1 freq shrill (6) - 20 freq goodhall (6) - 1 freq joshua (6) - 13 freq |
SoundEx code - J240 jekyll - 14 freq jougle - 1 freq joogle - 6 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jacquel - 3 freq joogal” - 1 freq jackal - 1 freq jajahl - 1 freq juggle - 1 freq joshhall - 1 freq |
MetaPhone code - JXL jchelle - 1 freq joshhall - 1 freq |
JOSHHALL |
| Time to execute Levenshtein function - 0.217197 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.410621 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.027708 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.037341 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. |