| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liver (0) - 34 freq river (1) - 270 freq liter (1) - 1 freq livet (1) - 1 freq luver (1) - 8 freq diver (1) - 5 freq lever (1) - 2 freq iver (1) - 312 freq siver (1) - 2 freq wiver (1) - 1 freq live (1) - 424 freq lives (1) - 241 freq cliver (1) - 12 freq aiver (1) - 3 freq liker (1) - 9 freq sliver (1) - 8 freq liner (1) - 4 freq kiver (1) - 5 freq oliver (1) - 10 freq livert (1) - 1 freq niver (1) - 851 freq liper (1) - 1 freq fiver (1) - 46 freq lover (1) - 27 freq lived (1) - 150 freq |
liver (0) - 34 freq lever (1) - 2 freq lover (1) - 27 freq livery (1) - 13 freq luver (1) - 8 freq oliver (1) - 10 freq niver (2) - 851 freq kiver (2) - 5 freq livert (2) - 1 freq liper (2) - 1 freq live' (2) - 3 freq livari (2) - 1 freq livers (2) - 1 freq liner (2) - 4 freq fiver (2) - 46 freq lived (2) - 150 freq diver (2) - 5 freq iver (2) - 312 freq liter (2) - 1 freq river (2) - 270 freq sliver (2) - 8 freq siver (2) - 2 freq livet (2) - 1 freq wiver (2) - 1 freq liker (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 |
LIVER |
| Time to execute Levenshtein function - 0.259291 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.400485 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.027570 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.041494 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.000935 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. |