| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| housimiver (0) - 1 freq housomiver (1) - 1 freq fousomiver (2) - 13 freq hoosomiver (2) - 1 freq housumever (2) - 1 freq houainiver (2) - 1 freq hoosumiver (2) - 2 freq housomever (2) - 5 freq houaniver (3) - 11 freq housome'er (3) - 1 freq houanniver (3) - 3 freq hoosomever (3) - 1 freq houiver (3) - 17 freq hoosumivir (3) - 1 freq hoosumever (3) - 16 freq housummivver (3) - 1 freq hooniiver (3) - 1 freq hooseaiver (3) - 1 freq howsumever (3) - 1 freq houivver (3) - 3 freq hoosomivver (3) - 2 freq hoosumivver (3) - 17 freq hooiniver (3) - 58 freq housomdever (3) - 1 freq hoominiver (3) - 1 freq |
housimiver (0) - 1 freq housomiver (1) - 1 freq housomever (2) - 5 freq housumever (2) - 1 freq hoosumiver (2) - 2 freq hoosomiver (2) - 1 freq fousomiver (3) - 13 freq hoosumivir (3) - 1 freq hoosomever (3) - 1 freq hoosumever (3) - 16 freq hoosomivver (4) - 2 freq hooseaiver (4) - 1 freq howsumever (4) - 1 freq hoosaeiver (4) - 3 freq housome'er (4) - 1 freq hoosumivver (4) - 17 freq housomdever (4) - 1 freq houainiver (4) - 1 freq hoominiver (5) - 1 freq hoosoever (5) - 4 freq housomdevir (5) - 5 freq hooniniver (5) - 1 freq houivver (5) - 3 freq houanniver (5) - 3 freq hooiniver (5) - 58 freq |
SoundEx code - H251 hoosomivver - 2 freq housumever - 1 freq housomiver - 1 freq hoosumever - 16 freq hoosumivir - 1 freq hackum-plackum - 1 freq hoosumivver - 17 freq hoosumiver - 2 freq housimiver - 1 freq housomever - 5 freq hoosomiver - 1 freq housummivver - 1 freq howsumever - 1 freq hoosomever - 1 freq hkhmofknc - 1 freq hqmpoyxevq - 1 freq hogganfield - 1 freq hznpoguuwa - 1 freq hginvzuo - 1 freq |
MetaPhone code - HSMFR hoosomivver - 2 freq housumever - 1 freq housomiver - 1 freq hoosumever - 16 freq hoosumivir - 1 freq hoosumivver - 17 freq hoosumiver - 2 freq housimiver - 1 freq housomever - 5 freq hoosomiver - 1 freq housummivver - 1 freq howsumever - 1 freq hoosomever - 1 freq |
HOUSIMIVER |
| Time to execute Levenshtein function - 0.556186 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.664146 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.035697 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.051580 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.001222 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. |