Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
however (0) - 61 freq howiver (1) - 1 freq houever (1) - 39 freq hooever (1) - 31 freq howevir (1) - 1 freq hoween (2) - 1 freq howanever (2) - 23 freq howivver (2) - 21 freq houiver (2) - 17 freq whosever (2) - 1 freq hover (2) - 9 freq howder (2) - 1 freq howker (2) - 2 freq howiwver (2) - 2 freq hoover (2) - 18 freq hooiver (2) - 14 freq owver (2) - 1 freq ho'e'er (2) - 12 freq fooever (2) - 1 freq hoanever (2) - 1 freq forever (2) - 75 freq hever (2) - 2 freq 'hooever (2) - 1 freq whoever (2) - 15 freq bovver (3) - 6 freq |
however (0) - 61 freq howiver (1) - 1 freq howevir (1) - 1 freq hooever (2) - 31 freq houever (2) - 39 freq hooiver (3) - 14 freq hoover (3) - 18 freq owver (3) - 1 freq howiwver (3) - 2 freq hever (3) - 2 freq hoanever (3) - 1 freq howker (3) - 2 freq howivver (3) - 21 freq howanever (3) - 23 freq houewvir (3) - 1 freq houiver (3) - 17 freq hover (3) - 9 freq howder (3) - 1 freq houanever (4) - 7 freq hanover (4) - 5 freq haaver (4) - 4 freq houivver (4) - 3 freq weaver (4) - 12 freq hooinever (4) - 9 freq waver (4) - 1 freq |
SoundEx code - H160 however - 61 freq hooever - 31 freq happier - 18 freq hover - 9 freq hauf-oor - 8 freq haiver - 6 freq haver - 6 freq hoover - 18 freq houiver - 17 freq hyper - 4 freq hooivver - 51 freq haaver - 4 freq houever - 39 freq hooiver - 14 freq heavier - 10 freq hauf-hour - 3 freq heifer - 5 freq hebrew - 19 freq howevir - 1 freq howivver - 21 freq howiwver - 2 freq 'hip-hooray - 1 freq houewvir - 1 freq 'hooever - 1 freq hever - 2 freq hivvier - 2 freq havera - 2 freq heefer - 1 freq houivver - 3 freq heffer - 2 freq howfur - 2 freq howiver - 1 freq hauf-aware - 1 freq hubber - 1 freq hoo-ivver - 1 freq hoovur - 1 freq hiprah - 2 freq |
MetaPhone code - HWFR however - 61 freq howevir - 1 freq howivver - 21 freq howiwver - 2 freq howiver - 1 freq |
HOWEVER |
Time to execute Levenshtein function - 0.207794 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.393083 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.027671 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.037262 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.000887 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. |