| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owerhead (0) - 3 freq owerheard (1) - 4 freq owerheid (1) - 15 freq owerheed (1) - 1 freq owerseas (2) - 5 freq owerend (2) - 1 freq overheid (2) - 2 freq oerheid (2) - 1 freq ower-heid (2) - 2 freq pierhead (2) - 1 freq overheard (2) - 6 freq €™erheid (3) - 1 freq owerlay (3) - 1 freq lowered (3) - 25 freq owerreach (3) - 1 freq owersets (3) - 5 freq owermah (3) - 1 freq owerhang (3) - 2 freq owersman (3) - 1 freq overload (3) - 2 freq owersee (3) - 2 freq bowhead (3) - 2 freq peterhead (3) - 22 freq jowered (3) - 1 freq overhears (3) - 1 freq |
owerhead (0) - 3 freq owerheid (1) - 15 freq owerheed (1) - 1 freq owerheard (2) - 4 freq ower-heid (3) - 2 freq owreheid (3) - 2 freq oerheid (3) - 1 freq pierhead (3) - 1 freq owerend (3) - 1 freq overheid (3) - 2 freq pierheid (4) - 1 freq owerhyped (4) - 1 freq owergied (4) - 1 freq forehead (4) - 5 freq aerheid (4) - 1 freq owerdae (4) - 1 freq aweready (4) - 3 freq owermaheed (4) - 1 freq owerdid (4) - 1 freq muirhead (4) - 1 freq owerseas (4) - 5 freq overheard (4) - 6 freq washed (5) - 89 freq rhed (5) - 1 freq owerfar (5) - 1 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 |
OWERHEAD |
| Time to execute Levenshtein function - 0.296337 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.546626 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.027299 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.037381 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.000879 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. |