| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| largely (0) - 6 freq lairgely (1) - 5 freq largest (2) - 4 freq large (2) - 56 freq larceny (2) - 1 freq barely (2) - 96 freq lately (2) - 57 freq lakely (2) - 2 freq larger (2) - 3 freq margery (2) - 1 freq langelt (2) - 1 freq lanely (2) - 31 freq hargey (2) - 7 freq rarely (2) - 43 freq sagely (2) - 2 freq sarely (2) - 1 freq lager (3) - 38 freq surgery (3) - 29 freq lively (3) - 10 freq lagers (3) - 2 freq warldly (3) - 4 freq laeckly (3) - 1 freq reely (3) - 9 freq marvel (3) - 6 freq argy (3) - 6 freq |
largely (0) - 6 freq lairgely (1) - 5 freq large (3) - 56 freq larger (3) - 3 freq argyle (4) - 5 freq lairge (4) - 23 freq lairger (4) - 9 freq largo (4) - 4 freq lairdly (4) - 2 freq gargle (4) - 3 freq laurel (4) - 4 freq lerge (4) - 1 freq lurgy (4) - 1 freq sarely (4) - 1 freq largs (4) - 4 freq jargle (4) - 1 freq lakely (4) - 2 freq sagely (4) - 2 freq lately (4) - 57 freq barely (4) - 96 freq largest (4) - 4 freq larceny (4) - 1 freq langelt (4) - 1 freq margery (4) - 1 freq hargey (4) - 7 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 |
LARGELY |
| Time to execute Levenshtein function - 0.408137 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.671460 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.026863 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.086231 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.000847 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. |