| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leg-bail (0) - 1 freq lang-tail (3) - 1 freq legal (3) - 85 freq lug-babs (3) - 1 freq tel-tail (3) - 1 freq lug-buik (3) - 1 freq e-mail (3) - 42 freq lang-tails (4) - 1 freq iegil (4) - 1 freq pee-bags (4) - 1 freq legit (4) - 4 freq lethal (4) - 3 freq highball (4) - 1 freq 'egil (4) - 2 freq wagtail (4) - 5 freq detail (4) - 43 freq blekmail (4) - 1 freq lizbain (4) - 1 freq verball (4) - 1 freq email (4) - 51 freq u-bait (4) - 1 freq lerbin (4) - 2 freq leetral (4) - 1 freq laybil (4) - 2 freq leil (4) - 5 freq |
leg-bail (0) - 1 freq lug-buik (4) - 1 freq legible (5) - 3 freq lug-babs (5) - 1 freq lang-tail (5) - 1 freq legal (5) - 85 freq lug-in (6) - 4 freq peeg-baby (6) - 1 freq log-in (6) - 1 freq laybil (6) - 2 freq let-be (6) - 1 freq lqbal (6) - 2 freq legally (6) - 13 freq gerbil (6) - 10 freq e-mail (6) - 42 freq logical (6) - 11 freq tel-tail (6) - 1 freq rig-bane (6) - 2 freq lug-hole (6) - 1 freq bailbail (7) - 1 freq leggid (7) - 1 freq leitil (7) - 1 freq egil (7) - 4 freq lexical (7) - 25 freq 'legal (7) - 1 freq |
SoundEx code - L214 lichfield - 1 freq legpullin - 1 freq likeable - 2 freq leg-bail - 1 freq lik'able - 1 freq legible - 3 freq lauchabil - 2 freq lauchfully - 1 freq lauchfulle - 1 freq lauchful - 2 freq lauchfull - 2 freq laich-flett - 1 freq ljubljana - 1 freq lauchable- - 1 freq lqbal - 2 freq lisafaulkner - 1 freq lisboalions - 1 freq ljployalist - 1 freq laughable - 1 freq |
MetaPhone code - LKBL likeable - 2 freq leg-bail - 1 freq lik'able - 1 freq lqbal - 2 freq |
LEG-BAIL |
| Time to execute Levenshtein function - 0.199633 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.420590 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.030232 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.038487 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.000956 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. |