| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ulrika (0) - 2 freq lika (2) - 1 freq ultima (2) - 4 freq afrika (2) - 5 freq erika (2) - 1 freq ulrich (2) - 1 freq luikna (3) - 1 freq prima (3) - 7 freq -like (3) - 1 freq likk (3) - 9 freq roka (3) - 3 freq eureka (3) - 3 freq merida (3) - 1 freq ucia (3) - 1 freq erica (3) - 1 freq rikk (3) - 14 freq briks (3) - 30 freq lariks (3) - 1 freq rlia (3) - 1 freq uik (3) - 1 freq tlrcsa (3) - 1 freq urinal (3) - 6 freq ria (3) - 1 freq blaik (3) - 80 freq cleiks (3) - 4 freq |
ulrika (0) - 2 freq afrika (3) - 5 freq erika (3) - 1 freq lika (3) - 1 freq lorina (4) - 3 freq trike (4) - 2 freq ilkka (4) - 1 freq uork (4) - 1 freq llike (4) - 1 freq lokka (4) - 1 freq laike (4) - 33 freq parka (4) - 2 freq uerk (4) - 1 freq erik (4) - 2 freq lark (4) - 23 freq burka (4) - 1 freq lik (4) - 1617 freq alaska (4) - 2 freq alike (4) - 26 freq dorik (4) - 5 freq eliska (4) - 1 freq laik (4) - 62 freq luik (4) - 347 freq ilka (4) - 865 freq lanka (4) - 7 freq |
SoundEx code - U462 ulrika - 2 freq ulrich - 1 freq |
MetaPhone code - ULRK ulrika - 2 freq |
ULRIKA |
| Time to execute Levenshtein function - 0.335900 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.587959 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.032770 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.078396 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.001025 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. |