| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laurforsy (0) - 1 freq airforss (3) - 1 freq haufers (4) - 4 freq ejurors (4) - 1 freq lavroos (4) - 1 freq laurels (4) - 2 freq lairners' (4) - 3 freq jurors (4) - 24 freq laura's (4) - 6 freq larners (4) - 10 freq luxors (4) - 1 freq lawbors (4) - 1 freq authors (4) - 16 freq larry (4) - 105 freq lalors (4) - 1 freq fautors (4) - 1 freq ladrons (4) - 1 freq lairners (4) - 72 freq warriors (4) - 20 freq airforce (4) - 2 freq autopsy (4) - 2 freq laubor (4) - 1 freq aurora (4) - 10 freq lauren's (4) - 2 freq lavatory (4) - 5 freq |
laurforsy (0) - 1 freq larners (5) - 10 freq lairners (5) - 72 freq airforss (5) - 1 freq airforce (6) - 2 freq warriors (6) - 20 freq learners (6) - 6 freq liprosy (6) - 2 freq ruifers (6) - 1 freq larries (6) - 8 freq leprosy (6) - 1 freq lauras (6) - 4 freq lalors (6) - 1 freq lauren's (6) - 2 freq laurels (6) - 2 freq lairners' (6) - 3 freq larry (6) - 105 freq ejurors (6) - 1 freq haufers (6) - 4 freq jurors (6) - 24 freq lavroos (6) - 1 freq luxors (6) - 1 freq laura's (6) - 6 freq lawbors (6) - 1 freq lasers (7) - 2 freq |
SoundEx code - L616 loreburn - 2 freq loor-broo - 1 freq larbert - 2 freq laurforsy - 1 freq larberthigh - 1 freq |
MetaPhone code - LRFRS laurforsy - 1 freq |
LAURFORSY |
| Time to execute Levenshtein function - 0.247144 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.514004 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.035967 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.057319 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.000844 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. |