| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoominiver (0) - 1 freq hooiniver (1) - 58 freq hooniniver (1) - 1 freq hooinever (2) - 9 freq hooaniver (2) - 58 freq hooniiver (2) - 1 freq hoowinever (2) - 1 freq houainiver (2) - 1 freq houanniver (3) - 3 freq hooivver (3) - 51 freq hoosomiver (3) - 1 freq hooseaiver (3) - 1 freq hooanivver (3) - 3 freq hoosumiver (3) - 2 freq hoo-ivver (3) - 1 freq hoosaeiver (3) - 3 freq houaniver (3) - 11 freq hooiver (3) - 13 freq housimiver (3) - 1 freq hooanever (3) - 51 freq howiver (4) - 1 freq dominies (4) - 23 freq hoosomever (4) - 1 freq fooivver (4) - 2 freq hominid (4) - 1 freq |
hoominiver (0) - 1 freq hooniniver (2) - 1 freq hooiniver (2) - 58 freq houainiver (3) - 1 freq hoowinever (3) - 1 freq hooaniver (3) - 58 freq hooniiver (3) - 1 freq hooinever (3) - 9 freq houaniver (4) - 11 freq hooanever (4) - 51 freq houanniver (4) - 3 freq howinevr (5) - 1 freq houanever (5) - 7 freq hoosomiver (5) - 1 freq howanever (5) - 23 freq houanaver (5) - 1 freq housimiver (5) - 1 freq hoanever (5) - 1 freq hoosumiver (5) - 2 freq hooanivver (5) - 3 freq hooseaiver (5) - 1 freq hooiver (5) - 13 freq hoo-ivver (5) - 1 freq hoosaeiver (5) - 3 freq hooivver (5) - 51 freq |
SoundEx code - H551 hooniniver - 1 freq hoominiver - 1 freq |
MetaPhone code - HMNFR hoominiver - 1 freq |
HOOMINIVER |
| Time to execute Levenshtein function - 0.240551 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.380344 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.034606 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.037841 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.000889 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. |