| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wha-ivir (0) - 6 freq whanivir (1) - 2 freq wharivir (1) - 1 freq whativir (1) - 2 freq whaiver (2) - 30 freq whitivir (2) - 9 freq whaniver (2) - 108 freq whinivir (2) - 1 freq whaarivir (2) - 1 freq whativer (2) - 15 freq whariver (2) - 1 freq whitevir (3) - 1 freq whitivvir (3) - 1 freq farivir (3) - 5 freq faivir (3) - 2 freq fanivir (3) - 1 freq wharvin (3) - 1 freq whamivver (3) - 1 freq whaarivvir (3) - 1 freq haivin (3) - 3 freq whiriver (3) - 2 freq whenevir (3) - 1 freq whatever (3) - 57 freq wheniver (3) - 3 freq whi'evir (3) - 1 freq |
wha-ivir (0) - 6 freq whanivir (2) - 2 freq whativir (2) - 2 freq wharivir (2) - 1 freq whativer (3) - 15 freq whariver (3) - 1 freq whinivir (3) - 1 freq whaarivir (3) - 1 freq whaiver (3) - 30 freq whitivir (3) - 9 freq whaniver (3) - 108 freq whauriver (4) - 5 freq whutiver (4) - 22 freq whaever (4) - 12 freq whi'evir (4) - 1 freq whutevir (4) - 1 freq whitiver (4) - 39 freq wheniver (4) - 3 freq whaivver (4) - 5 freq whuriver (4) - 1 freq whuniver (4) - 1 freq whiniver (4) - 3 freq whanever (4) - 8 freq whaeever (4) - 1 freq whatever (4) - 57 freq |
SoundEx code - W160 whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq wyver - 2 freq wapper - 2 freq €œwhaever - 1 freq weber - 1 freq wavery - 1 freq waahfer - 1 freq whopper - 3 freq wyper - 1 freq |
MetaPhone code - WFR whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq €œwhaever - 1 freq wavery - 1 freq waahfer - 1 freq |
WHA-IVIR |
| Time to execute Levenshtein function - 0.515540 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.614828 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.063441 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.039684 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.000865 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. |