Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
layen (0) - 2 freq lawen (1) - 1 freq laen (1) - 3 freq playen (1) - 2 freq layin (1) - 47 freq laren (1) - 21 freq lyen (1) - 2 freq layer (1) - 15 freq sayen (1) - 13 freq layan (1) - 1 freq layed (1) - 16 freq hayen (1) - 13 freq laymen (1) - 1 freq laden (1) - 13 freq bayan (2) - 4 freq ayn (2) - 3 freq laein (2) - 9 freq lyan (2) - 29 freq waken (2) - 9 freq laern (2) - 13 freq alen (2) - 1 freq label (2) - 57 freq -aye (2) - 3 freq laying (2) - 8 freq lare (2) - 7 freq |
layen (0) - 2 freq lyen (1) - 2 freq layan (1) - 1 freq layin (1) - 47 freq laen (1) - 3 freq lane (2) - 240 freq leen (2) - 18 freq lain (2) - 18 freq lyon (2) - 2 freq alen (2) - 1 freq len (2) - 74 freq laan (2) - 9 freq laun (2) - 76 freq lyn (2) - 17 freq alaen (2) - 10 freq lan (2) - 139 freq lyan (2) - 29 freq layed (2) - 16 freq laren (2) - 21 freq sayen (2) - 13 freq layer (2) - 15 freq hayen (2) - 13 freq laymen (2) - 1 freq lyin (2) - 332 freq laein (2) - 9 freq |
SoundEx code - L500 lyin - 332 freq lan - 139 freq lean - 48 freq lum - 140 freq liam - 31 freq lion - 147 freq leam - 17 freq lown - 59 freq layin - 47 freq loon - 669 freq laun - 76 freq line - 497 freq lowin - 31 freq luim - 6 freq len - 74 freq lin - 10 freq lane - 240 freq loun - 62 freq lowny - 1 freq lain - 18 freq lima - 2 freq louin - 1 freq loan - 42 freq leain - 23 freq laein - 9 freq lammie - 8 freq loonie - 35 freq laan - 9 freq leon - 2 freq lone - 9 freq linn - 26 freq lan' - 8 freq lm - 5 freq loe'n - 1 freq leein - 29 freq loon' - 2 freq leen - 18 freq lumn - 1 freq lona - 1 freq 'lain - 1 freq laen - 3 freq lame - 10 freq limn - 2 freq lime - 29 freq lawn - 16 freq ln - 7 freq lyn - 17 freq lino - 6 freq loam - 5 freq lyan - 29 freq loom - 14 freq lowen - 2 freq lyne - 21 freq lawen - 1 freq lyen - 2 freq laam - 1 freq lyin' - 2 freq layin' - 2 freq 'lm - 1 freq lann - 1 freq looney - 3 freq leanne - 31 freq limo - 9 freq lea'in - 1 freq line' - 3 freq lehin - 4 freq layan - 1 freq lym - 1 freq lon - 2 freq lene - 2 freq lun - 1 freq lenn - 2 freq loma - 2 freq lawin - 2 freq lame' - 1 freq lem - 5 freq leone - 1 freq lowan - 6 freq loanie - 2 freq liein - 3 freq lamm - 3 freq lyoun - 1 freq 'leanne - 3 freq 'leanne' - 1 freq lena - 2 freq lenny - 9 freq lee'in - 1 freq laem - 1 freq leino - 1 freq lemm - 2 freq lenna - 1 freq lowein - 1 freq lume - 1 freq luna - 2 freq linnie - 3 freq lyme - 1 freq lemme - 4 freq €™lin - 1 freq lanie - 1 freq lynne - 2 freq lama - 17 freq leim - 2 freq layen - 2 freq lane' - 2 freq linne - 1 freq lyon - 2 freq lynn - 1 freq €˜lion - 1 freq 'lion - 1 freq lnm - 1 freq loney - 1 freq lamh - 1 freq lumi - 2 freq limmy - 2 freq lina - 1 freq lyno - 2 freq lna - 1 freq lam - 1 freq lhihm - 1 freq lhan - 1 freq 'lowin - 1 freq loony - 1 freq lennie - 4 freq lhhn - 2 freq lny - 1 freq llion - 57 freq |
MetaPhone code - LYN lyin - 332 freq layin - 47 freq lyan - 29 freq lyen - 2 freq lyin' - 2 freq layin' - 2 freq layan - 1 freq lyoun - 1 freq layen - 2 freq lyon - 2 freq |
LAYEN |
Time to execute Levenshtein function - 0.202009 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.363820 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.027889 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.038038 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.000928 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. |