| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lasagne (0) - 11 freq lasagna (1) - 2 freq lasgie (2) - 4 freq lausanne (2) - 1 freq lanfine (3) - 1 freq laaghs (3) - 3 freq asang (3) - 1 freq laavie (3) - 1 freq lassve (3) - 1 freq lastin (3) - 9 freq sage (3) - 9 freq lashin (3) - 8 freq laang (3) - 3 freq laant (3) - 1 freq massage (3) - 17 freq lairge (3) - 23 freq laand (3) - 69 freq sarne (3) - 1 freq lalapie (3) - 1 freq waage (3) - 1 freq larne (3) - 19 freq savage (3) - 18 freq laaght (3) - 1 freq losan (3) - 2 freq saasage (3) - 8 freq |
lasagne (0) - 11 freq lasagna (1) - 2 freq lausanne (3) - 1 freq lasgie (3) - 4 freq losan (4) - 2 freq lagan (4) - 3 freq lashin (4) - 8 freq lastin (4) - 9 freq lashan (4) - 1 freq lasgies (4) - 3 freq lustan (5) - 1 freq lane (5) - 240 freq lairne (5) - 2 freq uisage (5) - 9 freq yaisage (5) - 4 freq basan (5) - 1 freq resign (5) - 2 freq loasin (5) - 6 freq large (5) - 56 freq lestin (5) - 2 freq lassie (5) - 771 freq dosage (5) - 3 freq lashins (5) - 3 freq layan (5) - 1 freq leanne (5) - 31 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 - LSKN lasagne - 11 freq lasagna - 2 freq |
LASAGNE |
| Time to execute Levenshtein function - 0.239336 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.404569 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.027047 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.039291 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.000821 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. |