| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lerrum (0) - 3 freq lerrit (2) - 2 freq warrum (2) - 1 freq gerrup (2) - 1 freq lendrum (2) - 1 freq furrum (2) - 1 freq serum (2) - 4 freq erum (2) - 1 freq arrum (2) - 7 freq kerry (3) - 47 freq warum (3) - 5 freq lerrin' (3) - 1 freq quorum (3) - 1 freq leart (3) - 4 freq ferrly (3) - 28 freq errol (3) - 2 freq erran (3) - 3 freq lemm (3) - 2 freq learie (3) - 1 freq leegue (3) - 2 freq nerrer (3) - 2 freq hercus (3) - 1 freq rum (3) - 32 freq werr (3) - 5 freq nerra (3) - 33 freq |
lerrum (0) - 3 freq arrum (3) - 7 freq furrum (3) - 1 freq warrum (3) - 1 freq lerrit (3) - 2 freq lurred (4) - 1 freq larrea (4) - 1 freq larrie (4) - 2 freq alarum (4) - 1 freq warrim (4) - 1 freq lorry (4) - 14 freq laserium (4) - 1 freq lendrum (4) - 1 freq gerrup (4) - 1 freq serum (4) - 4 freq erum (4) - 1 freq larry (4) - 105 freq marram (4) - 2 freq terr' (5) - 1 freq letham (5) - 6 freq herry (5) - 2 freq herrs (5) - 1 freq terre (5) - 1 freq flerr (5) - 4 freq kerrit (5) - 1 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 - LRM lerrum - 3 freq lrmy - 1 freq |
LERRUM |
| Time to execute Levenshtein function - 0.640129 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.130095 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.082606 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.089432 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.000892 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. |