| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowe-clok (0) - 1 freq ice-cloak (4) - 1 freq owertook (4) - 2 freq cowt-lik (4) - 1 freq owerlook (4) - 1 freq roweloks (4) - 1 freq owerclose (4) - 1 freq note-book (4) - 6 freq ower-come (5) - 1 freq jowells (5) - 3 freq overtook (5) - 1 freq lowein (5) - 1 freq loor-broo (5) - 1 freq lowest (5) - 10 freq o'cloke (5) - 1 freq owercast (5) - 2 freq owerlay (5) - 1 freq sour-dook (5) - 1 freq rome-no (5) - 1 freq o'cloak (5) - 1 freq sowel (5) - 1 freq owerly (5) - 1 freq lowse-up (5) - 1 freq wi-cot (5) - 1 freq lerook (5) - 4 freq |
lowe-clok (0) - 1 freq ice-cloak (6) - 1 freq lyfie-lik (7) - 1 freq life-cell (7) - 2 freq dowie-like (7) - 8 freq leaf-lik (7) - 1 freq owerclose (7) - 1 freq law-plea (7) - 2 freq slaw-lik (7) - 1 freq cowt-lik (7) - 1 freq owerlook (7) - 1 freq loack (8) - 9 freq ile-flow (8) - 1 freq life-cells (8) - 3 freq weck (8) - 1 freq sae-lik (8) - 2 freq some-like (8) - 1 freq fine-lik (8) - 1 freq soar-lik (8) - 1 freq luve-seik (8) - 4 freq towtie-lik (8) - 1 freq blate-lik (8) - 1 freq lee-wark (8) - 1 freq owrelook (8) - 1 freq law-lyin (8) - 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 - LWKLK lowe-clok - 1 freq |
LOWE-CLOK |
| Time to execute Levenshtein function - 0.516285 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.983446 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.086552 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.093857 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.001305 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. |