| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| julianbrans (0) - 3 freq sultanas (5) - 1 freq tullaghans (5) - 2 freq libran (5) - 1 freq julian (5) - 6 freq muinbeams (5) - 1 freq librars (5) - 3 freq lanrang (5) - 2 freq julierems (5) - 2 freq jbriancraig (5) - 1 freq lantrens (5) - 2 freq muirlans (6) - 1 freq linens (6) - 1 freq albanian (6) - 1 freq ninians (6) - 3 freq wuidlans (6) - 1 freq flanns (6) - 1 freq almanacs (6) - 1 freq laebrak (6) - 1 freq lifespans (6) - 1 freq 'julian (6) - 1 freq seabraes (6) - 1 freq jubiter's (6) - 1 freq ignorant (6) - 37 freq obrans (6) - 1 freq |
julianbrans (0) - 3 freq lantrens (7) - 2 freq lanrang (8) - 2 freq librars (8) - 3 freq julierems (8) - 2 freq libran (8) - 1 freq lanterns (8) - 7 freq unicorns (9) - 9 freq alanbrazil (9) - 1 freq hildebrand (9) - 6 freq klingons (9) - 1 freq poloandsons (9) - 1 freq allanbri (9) - 1 freq belangins (9) - 6 freq glenburn (9) - 2 freq joiners (9) - 7 freq liners (9) - 2 freq laerns (9) - 4 freq lanns (9) - 2 freq blintrin (9) - 1 freq planteens (9) - 1 freq leibrars (9) - 1 freq granbairns (9) - 11 freq clarebrand (9) - 1 freq ladrons (9) - 1 freq |
SoundEx code - J451 joelampard - 1 freq julianbrans - 3 freq |
MetaPhone code - JLNBRNS julianbrans - 3 freq |
JULIANBRANS |
| Time to execute Levenshtein function - 0.227959 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.388489 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.028571 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.036977 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.000853 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. |