| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hilarious (0) - 18 freq vicarious (2) - 1 freq hilariously (2) - 1 freq various (3) - 59 freq hazardous (3) - 1 freq hillroun (3) - 1 freq hillaireous (3) - 1 freq sarious (3) - 1 freq glawrious (3) - 1 freq hillayerious (3) - 1 freq glorious (3) - 58 freq delirious (3) - 3 freq dilations (3) - 1 freq hilarity (3) - 5 freq salacious (3) - 1 freq scrious (4) - 1 freq hearins (4) - 1 freq haris (4) - 1 freq pluribus (4) - 1 freq relatiouns (4) - 1 freq horatius (4) - 1 freq melodious (4) - 1 freq thelonious (4) - 8 freq ginormous (4) - 4 freq impriour (4) - 2 freq |
hilarious (0) - 18 freq hilariously (3) - 1 freq hillayerious (4) - 1 freq hillaireous (4) - 1 freq glorious (4) - 58 freq delirious (4) - 3 freq vicarious (4) - 1 freq hilarity (4) - 5 freq hilary (5) - 2 freq polaris (5) - 3 freq valorous (5) - 2 freq belarus (5) - 3 freq deleerious (5) - 1 freq hillies (5) - 11 freq helios (5) - 5 freq salaries (5) - 3 freq harrouis (5) - 1 freq humorous (5) - 5 freq salacious (5) - 1 freq blairius (5) - 1 freq glawrious (5) - 1 freq sarious (5) - 1 freq hillroun (5) - 1 freq hazardous (5) - 1 freq haris (5) - 1 freq |
SoundEx code - H462 hallirackit - 1 freq hillayerious - 1 freq hillaireous - 1 freq hilariously - 1 freq hilarious - 18 freq hallyrackit - 1 freq howlers - 1 freq helliers - 1 freq hell-owercappin - 1 freq haillierakkit - 1 freq hallierackit - 5 freq haillerackit - 2 freq |
MetaPhone code - HLRS hillaireous - 1 freq hilarious - 18 freq howlers - 1 freq helliers - 1 freq |
HILARIOUS |
| Time to execute Levenshtein function - 0.191943 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.354434 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.027206 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.036930 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.000846 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. |