Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
half-bottle (0) - 1 freq hauf-bottle (1) - 2 freq half-rotten (3) - 1 freq half-mile (4) - 1 freq half-done (4) - 1 freq bluebottle (4) - 8 freq half-böts (4) - 1 freq half-smile (4) - 1 freq shelbottle (4) - 1 freq blue-bottle (4) - 1 freq half-ounce (4) - 1 freq bluebottles (5) - 3 freq hauf-uncle (5) - 1 freq half-past (5) - 7 freq half-cauld (5) - 1 freq hauf-etten (5) - 2 freq half-empty (5) - 1 freq half-dozen (5) - 1 freq bottle (5) - 381 freq hauf-brither (5) - 2 freq half-blin (5) - 1 freq half-echt (5) - 1 freq half-pint (5) - 1 freq half-full (5) - 1 freq half-cousin (5) - 1 freq |
half-bottle (0) - 1 freq hauf-bottle (2) - 2 freq half-rotten (5) - 1 freq blue-bottle (6) - 1 freq shelbottle (7) - 1 freq half-smile (7) - 1 freq half-böts (7) - 1 freq half-mile (7) - 1 freq bluebottle (7) - 8 freq half-shut (8) - 4 freq half-biggit (8) - 1 freq half-full (8) - 1 freq half-pint (8) - 1 freq half-believe (8) - 1 freq half-hoidit (8) - 1 freq half-echt (8) - 1 freq half-tirn (8) - 1 freq half-fill (8) - 1 freq half-eaten (8) - 2 freq half-wit (8) - 1 freq half-written (8) - 1 freq half-blin (8) - 1 freq half-past (8) - 7 freq half-ounce (8) - 1 freq half-done (8) - 1 freq |
SoundEx code - H413 helpit - 52 freq hole-bit - 1 freq helped - 92 freq halibut - 5 freq halved - 2 freq halfdemon-half-cherub - 1 freq halfdan - 5 freq halfdan's - 1 freq hallibit - 1 freq helpt - 9 freq half-eaten - 2 freq half-hidden - 1 freq helvetiscots - 1 freq halpt - 1 freq half-hoidit - 1 freq half-tirn - 1 freq half-deid - 1 freq halpit - 12 freq half-digested - 1 freq halped - 2 freq half-dön - 1 freq half-done - 1 freq half-böts - 1 freq half-thacket - 1 freq half-bottle - 1 freq half-day's - 1 freq half-hid - 1 freq half-wit - 1 freq €˜holo-videos - 1 freq half-dozen - 1 freq |
MetaPhone code - HLFBTL half-bottle - 1 freq |
HALF-BOTTLE |
Time to execute Levenshtein function - 0.247808 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.387114 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.029996 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.039395 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.000938 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. |