| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hap-wairms (0) - 1 freq hancairts (4) - 1 freq hamewards (4) - 2 freq hauncairts (4) - 1 freq awairds (4) - 3 freq alairms (4) - 10 freq tapewirm (4) - 1 freq hairms (4) - 2 freq hauf-wits (5) - 1 freq swarms (5) - 2 freq waarms (5) - 1 freq hallmarks (5) - 2 freq backwirds (5) - 2 freq ee-wharms (5) - 1 freq hazards (5) - 1 freq shipyairds (5) - 5 freq tacwards (5) - 1 freq upwards (5) - 12 freq happenins (5) - 10 freq hawaiian (5) - 1 freq car-pairk (5) - 3 freq awards (5) - 35 freq tawards (5) - 7 freq handcairt (5) - 1 freq heemwards (5) - 1 freq |
hap-wairms (0) - 1 freq hit-forms (7) - 1 freq tapewirm (7) - 1 freq hairms (7) - 2 freq hamewards (7) - 2 freq heemwards (8) - 1 freq len-wirds (8) - 4 freq warms (8) - 8 freq homewards (8) - 1 freq lew-warm (8) - 1 freq upwarts (8) - 2 freq wirms (8) - 13 freq mauk-wirm (8) - 1 freq upwards (8) - 12 freq hairt-warm (8) - 1 freq hogwarts (8) - 1 freq waarms (8) - 1 freq han-looms (8) - 1 freq alairms (8) - 10 freq swarms (8) - 2 freq hauf-wits (8) - 1 freq awairds (8) - 3 freq hauncairts (8) - 1 freq wh-wirds (8) - 1 freq ee-wharms (8) - 1 freq |
SoundEx code - H165 hap-wairms - 1 freq haverin - 25 freq haiverins - 2 freq hoverin - 23 freq haiverin - 18 freq hovering - 7 freq huif-prents - 1 freq hepburn - 6 freq hibernate - 6 freq hovernut - 3 freq hovernuts - 2 freq hibernatin - 6 freq hooverin - 5 freq hooveran - 1 freq hoveran - 1 freq hepburns - 1 freq hubberin - 1 freq havering - 2 freq haparanda - 1 freq hyperion - 1 freq hibernians - 1 freq €˜hiberno-inglish - 1 freq hiberno-inglish - 9 freq hypernova - 1 freq hovrin - 2 freq hyperion's - 1 freq hibernation - 1 freq haverin' - 2 freq hoovering - 2 freq hiberno - 1 freq hibernianfc - 5 freq hypermobile - 1 freq hibeernian - 1 freq hibernating - 1 freq |
MetaPhone code - HPWRMS hap-wairms - 1 freq |
HAP-WAIRMS |
| Time to execute Levenshtein function - 0.250807 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.387710 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.028606 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.037720 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.001081 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. |