Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lower (0) - 57 freq tower (1) - 44 freq lawer (1) - 10 freq slower (1) - 13 freq lowen (1) - 2 freq bower (1) - 10 freq 'ower (1) - 12 freq mower (1) - 15 freq power (1) - 166 freq lowed (1) - 3 freq lowes (1) - 6 freq 'lower (1) - 1 freq blower (1) - 2 freq rower (1) - 2 freq loner (1) - 1 freq lover (1) - 27 freq cower (1) - 11 freq lowe (1) - 110 freq loser (1) - 4 freq lowers (1) - 6 freq flower (1) - 14 freq aower (1) - 1 freq glower (1) - 59 freq yower (1) - 3 freq sower (1) - 1 freq |
lower (0) - 57 freq lawer (1) - 10 freq glower (2) - 59 freq yower (2) - 3 freq aower (2) - 1 freq sower (2) - 1 freq lowers (2) - 6 freq loser (2) - 4 freq flower (2) - 14 freq ower (2) - 6224 freq layower (2) - 1 freq lowry (2) - 2 freq lowra (2) - 1 freq lowert (2) - 1 freq lowe (2) - 110 freq dower (2) - 2 freq fower (2) - 689 freq lawyer (2) - 33 freq tower (2) - 44 freq 'ower (2) - 12 freq lowen (2) - 2 freq slower (2) - 13 freq bower (2) - 10 freq cower (2) - 11 freq power (2) - 166 freq |
SoundEx code - L600 leerie - 22 freq lory - 42 freq lower - 57 freq leear - 16 freq lure - 6 freq lair - 57 freq lawer - 10 freq lere - 2 freq larry - 105 freq lawyer - 33 freq 'leear - 1 freq lairie - 2 freq laayer - 5 freq leir - 20 freq liar - 24 freq lorry - 14 freq lear - 107 freq lour - 5 freq lore - 12 freq leary - 1 freq lara - 1 freq laura - 190 freq laur - 1 freq lora - 1 freq leer - 4 freq laar - 2 freq lare - 7 freq layower - 1 freq loire - 8 freq loor - 2 freq layer - 13 freq lowry - 2 freq lowrie - 19 freq lyrie - 1 freq lowra - 1 freq lyare - 1 freq lire - 2 freq lauri - 1 freq laer - 1 freq lee-er - 1 freq l'or' - 1 freq lyre - 1 freq 'larry - 1 freq lawrie - 4 freq larrie - 2 freq lori - 1 freq larrea - 1 freq lir - 16 freq lr - 5 freq lurie - 1 freq ler - 1 freq lri - 1 freq 'lorry - 1 freq 'lower - 1 freq |
MetaPhone code - LWR lower - 57 freq lawer - 10 freq 'lower - 1 freq |
LOWER |
Time to execute Levenshtein function - 0.871210 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 - 1.300582 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.100582 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.100474 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.000973 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. |