| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| livvzezhz (0) - 1 freq livveens (4) - 1 freq livvel (4) - 2 freq livveen (4) - 1 freq lizzie (5) - 113 freq divven (5) - 1 freq ivver (5) - 276 freq luvvie (5) - 1 freq fivver (5) - 4 freq ivve (5) - 1 freq hivvens (5) - 14 freq hivvier (5) - 2 freq divvied (5) - 2 freq hivvenly (5) - 6 freq pivvered (5) - 1 freq lieve (5) - 1 freq rizvzz (5) - 1 freq lives' (5) - 1 freq liver's (5) - 2 freq lvfeze (5) - 1 freq linkedhd (5) - 1 freq hivven' (5) - 1 freq livet (5) - 1 freq livener (5) - 1 freq liver (5) - 34 freq |
livvzezhz (0) - 1 freq livveen (8) - 1 freq livvel (8) - 2 freq livveens (8) - 1 freq lvfeze (9) - 1 freq livvy's (9) - 3 freq rizvzz (9) - 1 freq luvvers (9) - 1 freq livvin (9) - 3 freq lizz (9) - 1 freq livvys (9) - 1 freq lavvie (9) - 18 freq livvy (9) - 49 freq luvved (9) - 4 freq alzzz (9) - 1 freq lovvve (9) - 1 freq lavvies (9) - 10 freq sivventh (9) - 1 freq luvvie (9) - 1 freq lizzie (9) - 113 freq lizzy (9) - 1 freq lizzik (9) - 1 freq lavvyheid (9) - 2 freq vzzj (10) - 1 freq lizzie's (10) - 9 freq |
SoundEx code - L122 life-size - 2 freq lyfejacket - 1 freq lifejacket - 1 freq life-jaickets - 1 freq life-sized - 1 freq lovesick - 2 freq life-cycle - 1 freq luve-seik - 4 freq lvcocktvr - 1 freq loveiyjess - 1 freq livvzezhz - 1 freq lpcugpmsnp - 1 freq |
MetaPhone code - LFSSS livvzezhz - 1 freq |
LIVVZEZHZ |
| Time to execute Levenshtein function - 0.422596 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.681868 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.030744 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.071010 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.000915 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. |