| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leakylike (0) - 1 freq leaf-lik (3) - 1 freq lookalike (3) - 2 freq leddy-like (3) - 1 freq deathlike (3) - 1 freq easylyke (3) - 1 freq wean-like (3) - 1 freq meek-like (3) - 1 freq deadline (4) - 4 freq eurydike (4) - 1 freq wearilie (4) - 1 freq samelike (4) - 2 freq lyklie (4) - 1 freq fecklie (4) - 2 freq ideal-like (4) - 1 freq lookalikie (4) - 1 freq wershlike (4) - 1 freq belike (4) - 5 freq daftlike (4) - 1 freq lestlie (4) - 3 freq feartlyke (4) - 1 freq pearlie (4) - 1 freq leaking (4) - 4 freq leaky (4) - 2 freq bekalite (4) - 1 freq |
leakylike (0) - 1 freq lookalike (3) - 2 freq lookalikie (4) - 1 freq lykelie (5) - 1 freq beiklik (5) - 1 freq waeklike (5) - 1 freq liklie (5) - 3 freq luik-alike (5) - 1 freq likelie (5) - 11 freq lyklie (5) - 1 freq meek-like (5) - 1 freq easylyke (5) - 1 freq leaf-lik (5) - 1 freq siklike (5) - 1 freq llike (5) - 1 freq leakin (6) - 12 freq leukit-like (6) - 1 freq waa-like (6) - 1 freq hulk-like (6) - 1 freq saelike (6) - 3 freq blatelike (6) - 1 freq sik-like (6) - 2 freq unalike (6) - 12 freq deidlike (6) - 2 freq safilike (6) - 1 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lochalsh - 1 freq laich-liggin - 1 freq lookalike - 2 freq localised - 8 freq localism - 1 freq lookalikie - 1 freq look-alikes - 1 freq lugholes - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lauch-lauchin - 1 freq less-weil-kent - 1 freq lassie-like - 1 freq lowe-clok - 1 freq localspace - 1 freq localisation - 4 freq luik-alike - 1 freq lokals - 1 freq lzals - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq ljeeulgf - 1 freq |
MetaPhone code - LKLK lookalike - 2 freq lookalikie - 1 freq luik-alike - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq |
LEAKYLIKE |
| Time to execute Levenshtein function - 0.513301 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.866605 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.028317 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.086758 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.001008 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. |