Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hedder-berries (0) - 1 freq ellerberries (4) - 1 freq hedder-kowes (5) - 1 freq roddenberrie (5) - 12 freq straeberries (6) - 3 freq hiddenaberdeen (6) - 12 freq blaeberries (6) - 3 freq gooseberries (6) - 3 freq fedder-sarpint (6) - 1 freq leeberties (6) - 1 freq wedder-ei (6) - 1 freq reverberates (6) - 1 freq elderberry (6) - 10 freq crowberries (7) - 1 freq house-feres (7) - 1 freq adversaries (7) - 1 freq deliveries (7) - 4 freq argie-bargies (7) - 1 freq meesteries (7) - 3 freq bleckberrie (7) - 1 freq higger-lassies (7) - 1 freq wedder-cocks (7) - 1 freq straaberries (7) - 1 freq herbrie (7) - 6 freq herries (7) - 4 freq |
hedder-berries (0) - 1 freq hedder-kowes (8) - 1 freq ellerberries (8) - 1 freq roddenberrie (9) - 12 freq elderberry (10) - 10 freq straeberries (10) - 3 freq hiddenaberdeen (10) - 12 freq pooder-blues (11) - 1 freq leader-writers (11) - 1 freq hodden-grey (11) - 1 freq wedder-cocks (11) - 1 freq strawberries (11) - 10 freq leddy-friens (11) - 1 freq harder-wirkin (11) - 1 freq straaberries (11) - 1 freq gooseberries (11) - 3 freq fedder-sarpint (11) - 1 freq crowberries (11) - 1 freq reverberates (11) - 1 freq blaeberries (11) - 3 freq wedder-ei (11) - 1 freq heiddress (12) - 1 freq hairber's (12) - 1 freq rodd-rowers (12) - 1 freq skooshberries (12) - 1 freq |
SoundEx code - H361 heather-happit - 2 freq heather-bleat - 1 freq heatherbleat - 1 freq heather-broon - 1 freq hedder-berries - 1 freq hether-blether - 1 freq hate-warped - 1 freq heatheryfold - 1 freq heidowerbollocks - 1 freq hwdrioaf - 1 freq htrfn - 1 freq |
MetaPhone code - HTRBRS hedder-berries - 1 freq |
HEDDER-BERRIES |
Time to execute Levenshtein function - 0.333631 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.563108 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.037680 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.047267 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.001128 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. |