| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lochkengallery (0) - 1 freq lochgelly (6) - 18 freq tolquhongallery (6) - 1 freq pocketsiller (6) - 1 freq legally (7) - 13 freq nichtingales (7) - 1 freq lichen-pale (7) - 1 freq lichteners (7) - 1 freq lochinver (7) - 1 freq back-alley (7) - 1 freq lichenometry (7) - 1 freq hellery (7) - 3 freq lochnagar (7) - 6 freq summerhallery (7) - 1 freq chevaliers (7) - 1 freq beckenbauer (7) - 1 freq accidentally (7) - 13 freq incidentally (7) - 1 freq conteenually (7) - 1 freq ochkenny (7) - 1 freq mochbaalled (7) - 1 freq longley (7) - 2 freq lochaber (7) - 5 freq lookingless (7) - 1 freq lichen-covert (7) - 2 freq |
lochkengallery (0) - 1 freq tolquhongallery (9) - 1 freq lochgelly (9) - 18 freq lochnagar (10) - 6 freq pocketsiller (10) - 1 freq lochinvar (11) - 1 freq lookingless (11) - 1 freq techincally (11) - 1 freq chancellor (11) - 8 freq chenille (11) - 1 freq nichtingale's (11) - 4 freq mockingly (11) - 1 freq nichtingale (11) - 28 freq lichenometry (11) - 1 freq nichtingales (11) - 1 freq lochinver (11) - 1 freq lichen-pale (11) - 1 freq chantelle (12) - 29 freq schiller (12) - 1 freq luckully (12) - 1 freq mackellar (12) - 1 freq chagall (12) - 1 freq chandler (12) - 2 freq locking (12) - 3 freq mechanically (12) - 1 freq |
SoundEx code - L225 lasagne - 11 freq lasagna - 2 freq lauchsm - 1 freq loughshannagh - 1 freq lassies-in-waitin - 4 freq lexicon - 9 freq lisaknappmusic - 1 freq lukejenglish - 2 freq lucyjanewheeler - 1 freq lisasmith - 1 freq lochkengallery - 1 freq ljesmsbrs - 1 freq |
MetaPhone code - LXKNKLR lochkengallery - 1 freq |
LOCHKENGALLERY |
| Time to execute Levenshtein function - 0.235435 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.423970 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.027806 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.037414 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.000961 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. |