| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairglearning (0) - 1 freq gairdening (5) - 1 freq lingering (5) - 3 freq lairning (5) - 3 freq languagelearning (5) - 1 freq learning (5) - 33 freq unlearning (5) - 1 freq cairrying (6) - 3 freq €œlearnin (6) - 1 freq word-learnin (6) - 1 freq overweaning (6) - 1 freq langstaunin (6) - 1 freq dairkenin (6) - 1 freq cairling (6) - 1 freq leaning (6) - 5 freq gleanins (6) - 1 freq clearing (6) - 3 freq lichtening (6) - 1 freq slaigerin (6) - 2 freq hairt-warmin (6) - 1 freq laernin (6) - 5 freq sairgeant (6) - 1 freq rehearsing (6) - 1 freq early-learnin (6) - 1 freq lairger (6) - 9 freq |
lairglearning (0) - 1 freq languagelearning (7) - 1 freq learning (8) - 33 freq unlearning (8) - 1 freq lairning (8) - 3 freq lingering (8) - 3 freq lightning (9) - 9 freq burgerking (9) - 1 freq lightening (9) - 1 freq gairdening (9) - 1 freq margarine (10) - 10 freq lairnins (10) - 1 freq littering (10) - 1 freq learnin' (10) - 2 freq word-learnin (10) - 1 freq law-breaking (10) - 1 freq tailoring (10) - 1 freq cleaning (10) - 14 freq hardening (10) - 1 freq barbering (10) - 1 freq fingering (10) - 1 freq airlannn (10) - 2 freq learnin (10) - 106 freq listening (10) - 47 freq lang-rinnin (10) - 1 freq |
SoundEx code - L624 lyrical - 5 freq largely - 6 freq lyricals - 1 freq law-resolution - 1 freq lairgely - 5 freq laurakyle - 1 freq lrhiklzaaa - 1 freq lairglearning - 1 freq |
MetaPhone code - LRKLRNNK lairglearning - 1 freq |
LAIRGLEARNING |
| Time to execute Levenshtein function - 0.266710 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.676326 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.033904 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.074606 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.001389 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. |