| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| humans (0) - 55 freq wumans (1) - 1 freq humane (1) - 4 freq human (1) - 317 freq wuman (2) - 40 freq haman (2) - 1 freq wuman's (2) - 5 freq hans (2) - 206 freq hums (2) - 3 freq haans (2) - 26 freq sumane (2) - 4 freq cuman (2) - 2 freq huvane (2) - 1 freq womans (2) - 5 freq queans (2) - 5 freq huband (2) - 1 freq hume's (2) - 3 freq demans (2) - 1 freq wumann (2) - 1 freq huang (2) - 2 freq mans (2) - 21 freq humps (2) - 3 freq €œhumans (2) - 1 freq humanly (2) - 1 freq roumans (2) - 2 freq |
humans (0) - 55 freq human (2) - 317 freq hymns (2) - 19 freq humane (2) - 4 freq wumans (2) - 1 freq ermans (3) - 1 freq womans (3) - 5 freq huns (3) - 10 freq demans (3) - 1 freq lemans (3) - 1 freq hume's (3) - 3 freq haans (3) - 26 freq roumans (3) - 2 freq haman (3) - 1 freq romans (3) - 44 freq hans (3) - 206 freq hums (3) - 3 freq humps (3) - 3 freq mans (3) - 21 freq humanly (3) - 1 freq hielans (4) - 17 freq harns (4) - 52 freq moans (4) - 7 freq humours (4) - 1 freq omens (4) - 3 freq |
SoundEx code - H552 hainins - 1 freq humans - 55 freq humankind - 5 freq haining - 6 freq humankin - 2 freq hemingway - 4 freq hoymansquoy - 1 freq hummingbird - 1 freq hinemaist - 1 freq homemaker - 1 freq €œhumans - 1 freq humming - 3 freq humongesest - 1 freq humansafari - 3 freq henningwehn - 1 freq |
MetaPhone code - HMNS humans - 55 freq €œhumans - 1 freq |
HUMANS |
| Time to execute Levenshtein function - 0.213521 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.318630 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.030544 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.037206 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.001115 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. |