| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elijah (0) - 25 freq delilah (2) - 2 freq elija's (2) - 1 freq abijah (2) - 5 freq liga (3) - 1 freq lilac (3) - 3 freq elicit (3) - 1 freq lah (3) - 1 freq hijab (3) - 2 freq ella (3) - 26 freq sliga (3) - 3 freq lieth (3) - 2 freq lisa (3) - 16 freq eijit (3) - 1 freq jah (3) - 2 freq ilia (3) - 1 freq slipach (3) - 1 freq glidan (3) - 1 freq elic (3) - 2 freq plish (3) - 2 freq isiah (3) - 1 freq elmar (3) - 2 freq ouija (3) - 7 freq ellan (3) - 2 freq elivin (3) - 1 freq |
elijah (0) - 25 freq abijah (3) - 5 freq ljh (3) - 1 freq elisha (4) - 1 freq elph (4) - 1 freq jah (4) - 2 freq eilish (4) - 1 freq allah (4) - 1 freq leah (4) - 1 freq elija's (4) - 1 freq lieth (4) - 2 freq eilidh (4) - 1 freq lith (4) - 1 freq lah (4) - 1 freq delilah (4) - 2 freq liath (4) - 1 freq aljaz (4) - 1 freq liam (5) - 31 freq jeh (5) - 1 freq alyth (5) - 2 freq luath (5) - 16 freq alph (5) - 1 freq laigh (5) - 15 freq liga' (5) - 1 freq lyh (5) - 1 freq |
SoundEx code - E420 else - 723 freq elsie - 62 freq eels - 11 freq elegie - 3 freq els - 11 freq elijah - 25 freq elisha - 1 freq ella's - 10 freq 'elsie - 9 freq 'elise - 1 freq elise - 1 freq elic - 2 freq eyls - 3 freq eulogy - 4 freq else' - 1 freq eliska - 1 freq elegy - 6 freq eleck - 4 freq €˜elegy - 1 freq €œelsie - 1 freq elk - 5 freq elaiss - 1 freq elks - 2 freq €œelk - 1 freq eyeless - 1 freq €™else - 1 freq eilish - 1 freq elxy - 1 freq ellis - 2 freq eilse - 1 freq elke - 3 freq elc - 5 freq elouise - 9 freq elkie - 1 freq |
MetaPhone code - ELJ elegie - 3 freq elijah - 25 freq eulogy - 4 freq elegy - 6 freq €˜elegy - 1 freq |
ELIJAH |
| Time to execute Levenshtein function - 0.236816 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.348377 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.027773 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.037752 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.000835 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. |