| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laybil (0) - 2 freq layby (2) - 3 freq layis (2) - 1 freq laevil (2) - 1 freq taibil (2) - 3 freq sybil (2) - 1 freq layin (2) - 47 freq caybul (2) - 1 freq label (2) - 57 freq lambin (2) - 19 freq habbil (2) - 1 freq lambie (2) - 3 freq bybil (2) - 1 freq lamb's (3) - 2 freq nabbin (3) - 2 freq oantil (3) - 1 freq yeil (3) - 1 freq ladybird (3) - 2 freq ladin (3) - 1 freq day-in (3) - 1 freq lazily (3) - 12 freq lankin (3) - 1 freq lawbur (3) - 1 freq laubor (3) - 1 freq raukil (3) - 1 freq |
laybil (0) - 2 freq label (2) - 57 freq layby (3) - 3 freq bybil (3) - 1 freq sybil (3) - 1 freq caybul (3) - 1 freq taibil (3) - 3 freq laevil (3) - 1 freq kabul (4) - 1 freq abel (4) - 7 freq lael (4) - 6 freq doubil (4) - 3 freq bil (4) - 1 freq nobil (4) - 1 freq loyal (4) - 19 freq yibbil (4) - 11 freq leitil (4) - 1 freq lyall (4) - 9 freq noabil (4) - 1 freq laurel (4) - 4 freq labels (4) - 6 freq labelt (4) - 2 freq onabil (4) - 1 freq mobil (4) - 1 freq ladel (4) - 3 freq |
SoundEx code - L140 label - 57 freq lovely - 165 freq level - 148 freq lively - 10 freq law-plea - 2 freq lawfully - 3 freq lawful - 3 freq luvely - 9 freq luvelie - 3 freq luvlee - 2 freq laybil - 2 freq luvuly - 1 freq luvulee - 1 freq lapel - 3 freq livvel - 2 freq luv'ly - 1 freq liable - 4 freq 'lovely - 1 freq luvly - 5 freq laevil - 1 freq lavell - 2 freq leafully - 1 freq lovel - 1 freq lvl - 1 freq lovell - 1 freq loaf'll - 1 freq luffly - 3 freq luvvly - 1 freq llvl - 1 freq |
MetaPhone code - LBL label - 57 freq laybil - 2 freq liable - 4 freq |
LAYBIL |
| Time to execute Levenshtein function - 0.198723 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.390458 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.032533 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.037185 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.000868 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. |