| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowerin (0) - 12 freq lowein (1) - 1 freq gowerin (1) - 1 freq lowrin (1) - 2 freq powerin (1) - 3 freq cowerin (1) - 5 freq lowerit (1) - 1 freq lowering (1) - 2 freq lowderin (1) - 1 freq glowerin (1) - 61 freq towerin (1) - 12 freq lowin (2) - 31 freq showerin (2) - 1 freq hooerin (2) - 1 freq glowering (2) - 1 freq hoverin (2) - 23 freq lower (2) - 57 freq flowetin (2) - 1 freq lowered (2) - 25 freq owerins (2) - 1 freq pooerin (2) - 1 freq lowpin (2) - 91 freq giowerin (2) - 1 freq lounerin (2) - 1 freq coverin (2) - 29 freq |
lowerin (0) - 12 freq lowrin (1) - 2 freq lowering (2) - 2 freq lowderin (2) - 1 freq towerin (2) - 12 freq lowerit (2) - 1 freq glowerin (2) - 61 freq cowerin (2) - 5 freq lowein (2) - 1 freq gowerin (2) - 1 freq powerin (2) - 3 freq lowsin (3) - 47 freq lowert (3) - 1 freq aswerin (3) - 1 freq lowrie (3) - 19 freq cowrin (3) - 5 freq layerin (3) - 1 freq lourin (3) - 8 freq cowarin (3) - 2 freq lowers (3) - 7 freq lowdin (3) - 1 freq gloweran (3) - 3 freq leerin (3) - 5 freq lewderin (3) - 1 freq lowen (3) - 2 freq |
SoundEx code - L650 learn - 294 freq lorina - 3 freq lourin - 8 freq lern - 3 freq leerin - 5 freq lairn - 134 freq lowerin - 12 freq lorraine - 6 freq larne - 19 freq lorne - 6 freq learin - 8 freq lairne - 2 freq larn - 16 freq lorna - 20 freq lauren - 21 freq laureen - 4 freq laern - 13 freq leirin - 1 freq lurno - 1 freq lerne - 1 freq lairin - 2 freq lorn - 1 freq luewarm - 1 freq layerin - 1 freq leern - 1 freq louran - 1 freq lowrin - 2 freq lerrum - 3 freq lerrin' - 1 freq lew-warm - 1 freq lerone - 1 freq learn - 1 freq laren - 21 freq laren - 1 freq laran - 2 freq lairn - 2 freq learn - 1 freq leirna - 1 freq lornawi - 2 freq 'lorne - 1 freq lwrni - 1 freq lrmy - 1 freq lorrain - 1 freq |
MetaPhone code - LWRN lowerin - 12 freq |
LOWERIN |
| Time to execute Levenshtein function - 0.188521 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.326685 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.027507 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.037245 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.000899 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. |