| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lassie-like (0) - 1 freq bessie-like (2) - 1 freq cannie-like (3) - 4 freq gutsie-like (3) - 1 freq lairdie-like (3) - 1 freq latchie-like (3) - 2 freq pensie-like (3) - 1 freq awfie-like (3) - 1 freq forcie-like (4) - 1 freq loesome-like (4) - 1 freq wyse-like (4) - 1 freq eerie-like (4) - 2 freq pawkie-lik (4) - 1 freq leisur-like (4) - 1 freq dwaamie-like (4) - 1 freq leukit-like (4) - 1 freq pensie-lik (4) - 1 freq casual-like (4) - 2 freq some-like (4) - 1 freq bonnie-like (4) - 1 freq puggie-like (4) - 1 freq paisley-like (4) - 1 freq fuffie-like (4) - 2 freq maze-like (4) - 1 freq cuttie-like (4) - 1 freq |
lassie-like (0) - 1 freq bessie-like (3) - 1 freq pensie-like (5) - 1 freq loesome-like (5) - 1 freq gutsie-like (5) - 1 freq lairdie-like (5) - 1 freq leisur-like (5) - 1 freq wise-like (6) - 3 freq lyfie-lik (6) - 1 freq some-like (6) - 1 freq sik-like (6) - 2 freq heistie-like (6) - 1 freq lassie'll (6) - 1 freq lassikie (6) - 2 freq maist-like (6) - 1 freq casual-like (6) - 2 freq sic-like (6) - 11 freq paisley-like (6) - 1 freq leukit-like (6) - 1 freq pensie-lik (6) - 1 freq wyse-like (6) - 1 freq awfie-like (6) - 1 freq cannie-like (6) - 4 freq latchie-like (6) - 2 freq dentie-like (7) - 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 - LSLK lassie-like - 1 freq |
LASSIE-LIKE |
| Time to execute Levenshtein function - 0.311297 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.559768 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.036845 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.040940 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.001010 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. |