| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| luver (0) - 8 freq lover (1) - 27 freq lever (1) - 2 freq luved (1) - 70 freq luve (1) - 329 freq luvers (1) - 12 freq luves (1) - 16 freq liver (1) - 34 freq niver (2) - 849 freq quaver (2) - 2 freq luked (2) - 14 freq livet (2) - 1 freq lower (2) - 57 freq luive (2) - 9 freq gluve (2) - 1 freq duvet (2) - 20 freq bucer (2) - 1 freq luxe (2) - 1 freq 'luve' (2) - 1 freq lugar (2) - 4 freq sever (2) - 3 freq fiver (2) - 46 freq over (2) - 335 freq liner (2) - 4 freq livery (2) - 13 freq |
luver (0) - 8 freq lever (1) - 2 freq liver (1) - 34 freq lover (1) - 27 freq luved (2) - 70 freq livery (2) - 13 freq luves (2) - 16 freq luve (2) - 329 freq luvers (2) - 12 freq oliver (2) - 10 freq leper (3) - 2 freq quiver (3) - 6 freq ver (3) - 3 freq lived (3) - 145 freq ever (3) - 879 freq lave (3) - 227 freq cover (3) - 148 freq liker (3) - 9 freq live (3) - 418 freq aver (3) - 4 freq laer (3) - 1 freq liper (3) - 1 freq love (3) - 881 freq iwver (3) - 1 freq luvvy (3) - 5 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 |
LUVER |
| Time to execute Levenshtein function - 0.228860 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.369439 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.027120 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.036760 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.000750 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. |