Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
owerheid (0) - 15 freq owerhead (1) - 3 freq ower-heid (1) - 2 freq overheid (1) - 2 freq owerheed (1) - 1 freq oerheid (1) - 1 freq owerdid (2) - 1 freq aerheid (2) - 1 freq pierheid (2) - 1 freq €™erheid (2) - 1 freq owerheard (2) - 4 freq owreheid (2) - 2 freq owerend (2) - 1 freq owerspreid (3) - 2 freq owerseer (3) - 5 freq owertim (3) - 1 freq owerset (3) - 81 freq jowered (3) - 1 freq foreheid (3) - 23 freq owerhung (3) - 1 freq owerwhelm (3) - 1 freq towered (3) - 1 freq overpaid (3) - 3 freq overdid (3) - 1 freq peterheid (3) - 26 freq |
owerheid (0) - 15 freq owerheed (1) - 1 freq owerhead (1) - 3 freq owreheid (2) - 2 freq ower-heid (2) - 2 freq oerheid (2) - 1 freq overheid (2) - 2 freq owerend (3) - 1 freq owerheard (3) - 4 freq pierheid (3) - 1 freq owerdid (3) - 1 freq aerheid (3) - 1 freq owreheids (4) - 1 freq pierhead (4) - 1 freq owergied (4) - 1 freq foreheid (4) - 23 freq owerhyped (4) - 1 freq owermaheed (4) - 1 freq €™erheid (4) - 1 freq aweready (5) - 3 freq braeheid (5) - 3 freq warned (5) - 36 freq worned (5) - 1 freq wurked (5) - 6 freq wirked (5) - 35 freq |
SoundEx code - O630 owerdue - 3 freq oerdue - 1 freq owerheid - 15 freq oer-het - 1 freq owreheid - 2 freq owrehet - 1 freq owrte - 1 freq ower't - 2 freq owerdae - 1 freq oort - 8 freq ower-heid - 2 freq owerheed - 1 freq owerhead - 3 freq owredue - 2 freq oerheid - 1 freq oreat - 1 freq ort - 2 freq orty - 1 freq owerth' - 1 freq orta - 1 freq orti - 1 freq |
MetaPhone code - OWRHT owerheid - 15 freq ower-heid - 2 freq owerheed - 1 freq owerhead - 3 freq |
OWERHEID |
Time to execute Levenshtein function - 0.419502 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.723442 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.063698 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.039170 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.001078 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. |