| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairgely (0) - 5 freq largely (1) - 6 freq lairdly (2) - 2 freq lairgest (2) - 9 freq lairge (2) - 23 freq lairger (2) - 9 freq nairly (3) - 1 freq lakely (3) - 2 freq larger (3) - 3 freq barely (3) - 96 freq laistly (3) - 2 freq bairnly (3) - 1 freq larceny (3) - 1 freq laithly (3) - 2 freq rairly (3) - 1 freq bairges (3) - 1 freq bairge (3) - 2 freq laurel (3) - 4 freq cairtel (3) - 1 freq paircel (3) - 10 freq lively (3) - 10 freq lainsel (3) - 2 freq margery (3) - 1 freq sarely (3) - 1 freq lairne (3) - 2 freq |
lairgely (0) - 5 freq largely (1) - 6 freq lairge (3) - 23 freq lairger (3) - 9 freq lairdly (3) - 2 freq large (4) - 56 freq larger (4) - 3 freq lairgest (4) - 9 freq lairgs (4) - 2 freq laurel (4) - 4 freq pairtly (5) - 15 freq sairly (5) - 28 freq lairner (5) - 5 freq mairvel (5) - 2 freq clairly (5) - 2 freq likely (5) - 305 freq fairly (5) - 233 freq sirely (5) - 1 freq bairged (5) - 6 freq laired (5) - 8 freq hargey (5) - 7 freq fairley (5) - 1 freq rarely (5) - 43 freq largs (5) - 4 freq jargle (5) - 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 - LRJL largely - 6 freq lairgely - 5 freq |
LAIRGELY |
| Time to execute Levenshtein function - 0.207699 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.354788 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.027757 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.039663 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.000963 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. |