Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hoosumever (0) - 16 freq hoosumiver (1) - 2 freq howsumever (1) - 1 freq housumever (1) - 1 freq hoosomever (1) - 1 freq hoosoever (2) - 4 freq housomever (2) - 5 freq hoosumivver (2) - 17 freq hoosomiver (2) - 1 freq hoosumivir (2) - 1 freq hooever (3) - 31 freq housomdever (3) - 1 freq 'hoosoever (3) - 1 freq hoowinever (3) - 1 freq houever (3) - 37 freq hooseaiver (3) - 1 freq housimiver (3) - 1 freq housomiver (3) - 1 freq hoosomivver (3) - 2 freq hooanever (3) - 51 freq hooinever (3) - 9 freq housome'er (3) - 1 freq hoosaeiver (3) - 3 freq whasumever (3) - 1 freq housummivver (4) - 1 freq |
hoosumever (0) - 16 freq housumever (1) - 1 freq hoosomever (1) - 1 freq hoosumiver (1) - 2 freq housomever (2) - 5 freq howsumever (2) - 1 freq hoosumivir (2) - 1 freq hoosomiver (2) - 1 freq housomiver (3) - 1 freq hoosumivver (3) - 17 freq hoosoever (3) - 4 freq housimiver (3) - 1 freq housome'er (4) - 1 freq hoosaeiver (4) - 3 freq whasumever (4) - 1 freq hoosomivver (4) - 2 freq housomdever (4) - 1 freq hooseaiver (4) - 1 freq housomdevir (5) - 5 freq fousomiver (5) - 13 freq 'hoosoever (5) - 1 freq hooever (5) - 31 freq hoowinever (5) - 1 freq houever (5) - 37 freq hooinever (5) - 9 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 |
HOOSUMEVER |
Time to execute Levenshtein function - 0.192757 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.353040 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.028734 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.037309 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.000890 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. |