| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairger (0) - 9 freq lairner (1) - 5 freq lairge (1) - 23 freq larger (1) - 3 freq clairer (2) - 1 freq wairmer (2) - 1 freq lairned (2) - 14 freq airier (2) - 1 freq gairter (2) - 1 freq cairier (2) - 1 freq lairne (2) - 2 freq lairie (2) - 2 freq darger (2) - 2 freq fairer (2) - 12 freq hairder (2) - 16 freq dairker (2) - 1 freq airer (2) - 1 freq tairget (2) - 10 freq laiter (2) - 4 freq laired (2) - 8 freq ligger (2) - 1 freq linger (2) - 5 freq langer (2) - 223 freq bairges (2) - 1 freq fairmer (2) - 61 freq |
lairger (0) - 9 freq larger (1) - 3 freq lairge (2) - 23 freq lairner (2) - 5 freq lairgely (3) - 5 freq darger (3) - 2 freq larder (3) - 9 freq lager (3) - 38 freq ligger (3) - 1 freq linger (3) - 5 freq langer (3) - 223 freq large (3) - 56 freq lairgs (3) - 2 freq bairge (4) - 2 freq burger (4) - 13 freq tairge (4) - 2 freq cairter (4) - 1 freq chairger (4) - 2 freq laicher (4) - 5 freq vaiger (4) - 1 freq largely (4) - 6 freq lairners (4) - 72 freq sairrer (4) - 1 freq langir (4) - 7 freq learner (4) - 7 freq |
SoundEx code - L626 lurcher - 1 freq lurchers - 1 freq lairger - 9 freq lurcher's - 1 freq largoward - 1 freq larger - 3 freq lorcrazycatlady - 150 freq |
MetaPhone code - LRJR lairger - 9 freq larger - 3 freq |
LAIRGER |
| Time to execute Levenshtein function - 0.307494 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.702397 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.027661 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.088247 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.000807 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. |