| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hauf-tuim (0) - 1 freq hauf-tuimt (1) - 1 freq hauf-time (2) - 1 freq hauf-muin (2) - 1 freq hauf-tume (2) - 1 freq hauf-deid (3) - 8 freq hauf-turnt (3) - 1 freq hauf-turnin (3) - 2 freq aff-tuik (3) - 2 freq hauf-blin (3) - 1 freq hauf-yin (3) - 10 freq hauf-leid (3) - 1 freq hauf-lit (3) - 4 freq hauf-fu (3) - 2 freq hauf-thrie (3) - 1 freq hauf-seas (4) - 1 freq half-blin (4) - 1 freq hauf-human (4) - 1 freq hauf-etten (4) - 2 freq hauf-cock (4) - 1 freq hauf-grue (4) - 1 freq hauf-wye (4) - 2 freq hauf-likit (4) - 1 freq half-full (4) - 1 freq half-deid (4) - 1 freq |
hauf-tuim (0) - 1 freq hauf-time (2) - 1 freq hauf-tume (2) - 1 freq hauf-tuimt (2) - 1 freq hauf-muin (4) - 1 freq hauf-lit (5) - 4 freq hauf-fu (5) - 2 freq hame-time (5) - 1 freq hauf-leid (5) - 1 freq hauf-thrie (5) - 1 freq hail-time (5) - 1 freq hauf-deid (5) - 8 freq hauf-yin (5) - 10 freq aff-tuik (5) - 2 freq hauf-mete (6) - 1 freq hauf-day (6) - 1 freq tay-tim (6) - 1 freq hauf-hour (6) - 3 freq haufdwam (6) - 1 freq hauf-three (6) - 1 freq hauf-mad (6) - 1 freq hauf-fou (6) - 1 freq hauf-smile (6) - 3 freq hauf-throu (6) - 1 freq hauf-way (6) - 1 freq |
SoundEx code - H135 hauf-hidden - 3 freq haufdwam - 1 freq hauf-tuimt - 1 freq hauf-tuim - 1 freq heftin - 41 freq haufdementit - 1 freq hauf-etten - 2 freq heftins - 1 freq hauf-tume - 1 freq hfetime - 1 freq hauf-time - 1 freq hvehdn - 1 freq hobbitoncentral - 3 freq |
MetaPhone code - HFTM hauf-tuim - 1 freq hauf-tume - 1 freq hauf-time - 1 freq |
HAUF-TUIM |
| Time to execute Levenshtein function - 0.215420 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.376797 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.028336 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.038613 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.000925 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. |