| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fifelike (0) - 3 freq wiselike (2) - 6 freq fitlike (2) - 1 freq wicelike (2) - 11 freq kin-like (3) - 1 freq fierie (3) - 2 freq saelike (3) - 3 freq sichlike (3) - 1 freq wice-like (3) - 3 freq faceline (3) - 2 freq fine-lik (3) - 1 freq safilike (3) - 1 freq sic-like (3) - 11 freq finerie (3) - 2 freq saimelike (3) - 1 freq feline (3) - 16 freq saftlike (3) - 6 freq wycelike (3) - 12 freq wise-like (3) - 3 freq sik-like (3) - 2 freq siklike (3) - 1 freq likelie (3) - 11 freq somelike (3) - 2 freq finalise (3) - 2 freq ficklie (3) - 2 freq |
fifelike (0) - 3 freq fitlike (3) - 1 freq safilike (4) - 1 freq filikie (4) - 2 freq wiselike (4) - 6 freq wicelike (4) - 11 freq wicelik (5) - 1 freq siblike (5) - 15 freq filie (5) - 19 freq freelie (5) - 3 freq 'belike (5) - 3 freq daftlike (5) - 1 freq affline (5) - 2 freq samelike (5) - 2 freq siclike (5) - 90 freq dislike (5) - 6 freq offline (5) - 1 freq flake (5) - 7 freq finfolk (5) - 1 freq fluke (5) - 1 freq folke (5) - 1 freq belike (5) - 5 freq bienlike (5) - 2 freq fiftie (5) - 12 freq fidelity (5) - 1 freq |
SoundEx code - F142 fables - 10 freq feefles - 1 freq foibles - 2 freq fabulous - 9 freq foveoles - 1 freq fuffie-like - 2 freq fabils - 2 freq fufills - 1 freq fifelike - 3 freq |
MetaPhone code - FFLK fuffie-like - 2 freq fifelike - 3 freq |
FIFELIKE |
| Time to execute Levenshtein function - 0.291102 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.356666 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.030626 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.043189 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.000990 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. |