| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| howivver (0) - 21 freq hooivver (1) - 51 freq houivver (1) - 3 freq howiver (1) - 1 freq howiwver (1) - 2 freq fooivver (2) - 2 freq hoanivver (2) - 1 freq howanivver (2) - 2 freq houiver (2) - 17 freq hoo-ivver (2) - 1 freq hooiver (2) - 13 freq forivver (2) - 9 freq however (2) - 61 freq fanivver (3) - 6 freq finivver (3) - 3 freq whitivver (3) - 39 freq fa-ivver (3) - 2 freq nivver (3) - 976 freq 'nivver (3) - 3 freq faivver (3) - 4 freq howie (3) - 52 freq wiver (3) - 1 freq hivvier (3) - 2 freq whamivver (3) - 1 freq kivver (3) - 6 freq |
howivver (0) - 21 freq howiwver (2) - 2 freq howiver (2) - 1 freq hooivver (2) - 51 freq houivver (2) - 3 freq hoo-ivver (3) - 1 freq however (3) - 61 freq hoanivver (3) - 1 freq howanivver (3) - 2 freq houanivver (4) - 19 freq hooanivver (4) - 3 freq hoowinever (4) - 1 freq hounaivver (4) - 1 freq howanever (4) - 23 freq hooiver (4) - 13 freq houiver (4) - 17 freq fooivver (4) - 2 freq hivvier (4) - 2 freq forivver (4) - 9 freq howinevr (4) - 1 freq hooever (5) - 31 freq fitivver (5) - 31 freq pivver (5) - 1 freq hover (5) - 9 freq yivver (5) - 4 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 - 37 freq hooiver - 13 freq heavier - 9 freq hauf-hour - 3 freq heifer - 4 freq hebrew - 19 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 howivver - 21 freq howiwver - 2 freq howiver - 1 freq |
HOWIVVER |
| Time to execute Levenshtein function - 0.178722 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.327473 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.027326 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.038040 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.000811 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. |