| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lover (0) - 27 freq lever (1) - 2 freq love' (1) - 2 freq sover (1) - 1 freq love (1) - 881 freq mover (1) - 1 freq hover (1) - 9 freq lovel (1) - 1 freq dover (1) - 15 freq plover (1) - 9 freq loves (1) - 63 freq luver (1) - 8 freq loser (1) - 4 freq lovers (1) - 20 freq loner (1) - 1 freq lower (1) - 57 freq liver (1) - 34 freq clover (1) - 17 freq lovey (1) - 1 freq rover (1) - 12 freq over (1) - 335 freq cover (1) - 148 freq loved (1) - 186 freq sojer (2) - 23 freq looker (2) - 8 freq |
lover (0) - 27 freq liver (1) - 34 freq luver (1) - 8 freq lever (1) - 2 freq clover (2) - 17 freq lower (2) - 57 freq lovey (2) - 1 freq cover (2) - 148 freq livery (2) - 13 freq oliver (2) - 10 freq loved (2) - 186 freq loner (2) - 1 freq over (2) - 335 freq rover (2) - 12 freq love (2) - 881 freq hover (2) - 9 freq lovers (2) - 20 freq sover (2) - 1 freq love' (2) - 2 freq lovel (2) - 1 freq mover (2) - 1 freq loves (2) - 63 freq loser (2) - 4 freq dover (2) - 15 freq plover (2) - 9 freq |
SoundEx code - L160 labour - 276 freq livery - 13 freq laubour - 2 freq lover - 27 freq leper - 2 freq liver - 34 freq labour' - 1 freq liefer - 5 freq luver - 8 freq lipper - 14 freq libary - 1 freq liper - 1 freq lapper - 1 freq libra - 2 freq laebor - 1 freq lifier - 1 freq lever - 2 freq Álvaro - 1 freq libre - 1 freq leifer - 2 freq lebor - 1 freq libree - 4 freq lawborrow - 2 freq lawbur - 1 freq laubor - 1 freq lawburrow - 1 freq lawbour - 5 freq libarry - 1 freq 'labour - 1 freq livari - 1 freq louvre - 1 freq live-wire - 1 freq loafer - 1 freq labor - 1 freq lpr - 1 freq libr - 1 freq |
MetaPhone code - LFR livery - 13 freq laugher - 1 freq lover - 27 freq liver - 34 freq liefer - 5 freq luver - 8 freq lifier - 1 freq lever - 2 freq Álvaro - 1 freq leifer - 2 freq livari - 1 freq louvre - 1 freq loafer - 1 freq |
LOVER |
| Time to execute Levenshtein function - 0.347422 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.533274 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.028738 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.072107 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.000793 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. |