| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| joliv (0) - 3 freq gliv (2) - 1 freq cliv (2) - 1 freq jolly (2) - 19 freq olav (2) - 1 freq josie (2) - 18 freq joni (2) - 3 freq goliev (2) - 1 freq jowin (2) - 4 freq jokin (2) - 46 freq folio (2) - 1 freq jslv (2) - 1 freq jylin (2) - 1 freq jolt (2) - 7 freq joris (2) - 1 freq joltin (2) - 2 freq holie (2) - 10 freq jobie (2) - 1 freq polis (2) - 264 freq olivy (2) - 1 freq jovi (2) - 1 freq rolis (2) - 1 freq julie (2) - 29 freq holin (2) - 2 freq jorim (2) - 3 freq |
joliv (0) - 3 freq olivy (3) - 1 freq jolt (3) - 7 freq jylin (3) - 1 freq julie (3) - 29 freq olive (3) - 16 freq liv (3) - 12 freq julia (3) - 2 freq jojv (3) - 1 freq jslv (3) - 1 freq jovi (3) - 1 freq goliev (3) - 1 freq jolly (3) - 19 freq cliv (3) - 1 freq olav (3) - 1 freq gliv (3) - 1 freq solve (4) - 9 freq jools (4) - 1 freq belive (4) - 2 freq ilev (4) - 1 freq jeelit (4) - 2 freq luiv (4) - 7 freq relive (4) - 1 freq julai (4) - 2 freq jyle (4) - 47 freq |
SoundEx code - J410 jallopy - 4 freq jallop - 1 freq jeelip - 2 freq joliv - 3 freq jalopy - 1 freq jslv - 1 freq |
MetaPhone code - JLF joliv - 3 freq |
JOLIV |
| Time to execute Levenshtein function - 0.613298 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.983633 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.027610 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.073048 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.000889 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. |