Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lairstanes (0) - 1 freq lairstane (1) - 3 freq hailstanes (2) - 2 freq plainstanes (2) - 10 freq airnstane (3) - 1 freq lairistan (3) - 3 freq flagstanes (3) - 2 freq airtans (3) - 3 freq hailstones (3) - 1 freq harestanes (3) - 1 freq heidstanes (3) - 10 freq plainstane (3) - 1 freq brigstanes (3) - 1 freq hailstane (3) - 1 freq fairytales (3) - 1 freq hairstyles (3) - 2 freq laisted (4) - 3 freq lairned (4) - 14 freq airtcles (4) - 1 freq stanes (4) - 277 freq brigstones (4) - 1 freq gemstanes (4) - 1 freq sairgants (4) - 1 freq pairities (4) - 1 freq sairvants (4) - 4 freq |
lairstanes (0) - 1 freq lairstane (2) - 3 freq harestanes (4) - 1 freq lairistan (4) - 3 freq hailstanes (4) - 2 freq plainstanes (4) - 10 freq brigstanes (5) - 1 freq listins (5) - 1 freq heidstanes (5) - 10 freq hairstyles (5) - 2 freq listens (5) - 24 freq flagstanes (5) - 2 freq airtans (5) - 3 freq hailstones (5) - 1 freq plainstains (6) - 1 freq lairns (6) - 7 freq leckerstanes (6) - 1 freq airtins (6) - 8 freq listener (6) - 5 freq grunstanes (6) - 2 freq milestanes (6) - 6 freq airnstane (6) - 1 freq 'stanes (6) - 1 freq vairsions (6) - 10 freq listnen (6) - 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 - LRSTNS lairstanes - 1 freq |
LAIRSTANES |
Time to execute Levenshtein function - 0.306394 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.474450 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.028796 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.038817 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.000930 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. |