| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairistan (0) - 3 freq lairstane (2) - 3 freq osirisan (3) - 1 freq laurieston (3) - 2 freq hairstin (3) - 14 freq tairtan (3) - 2 freq arisan (3) - 1 freq lampstan (3) - 1 freq lairstanes (3) - 1 freq tristan (3) - 15 freq lairin (3) - 2 freq airnstane (3) - 1 freq lairit (3) - 2 freq pairtisan (3) - 1 freq christan (3) - 1 freq lairnan (3) - 3 freq airtan (3) - 2 freq airtisan (3) - 1 freq airrsman (3) - 1 freq raisistin (3) - 1 freq pakistan (3) - 3 freq kirsten (4) - 4 freq resistan (4) - 1 freq burstan (4) - 1 freq cairtin (4) - 7 freq |
lairistan (0) - 3 freq lairstane (2) - 3 freq laurieston (3) - 2 freq lairstanes (4) - 1 freq tristan (4) - 15 freq hairstin (4) - 14 freq lustan (5) - 1 freq firsten (5) - 16 freq listen (5) - 491 freq crestan (5) - 1 freq burstan (5) - 1 freq kirsten (5) - 4 freq limestane (5) - 2 freq ristin (5) - 3 freq arrestin (5) - 2 freq pakistan (5) - 3 freq larsson (5) - 7 freq leisten (5) - 3 freq restan (5) - 4 freq unerstan (5) - 1 freq lairin (5) - 2 freq raisistin (5) - 1 freq lairit (5) - 2 freq lampstan (5) - 1 freq arisan (5) - 1 freq |
SoundEx code - L623 lurched - 2 freq laurieston - 2 freq lurked - 4 freq lirkit - 7 freq lairstane - 3 freq lairistan - 3 freq lurkt - 1 freq lairstanes - 1 freq lrst - 1 freq |
MetaPhone code - LRSTN laurieston - 2 freq lairstane - 3 freq lairistan - 3 freq |
LAIRISTAN |
| Time to execute Levenshtein function - 0.248033 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.710608 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.082144 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.091873 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.001212 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. |