| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twa-an-a-hauf (0) - 2 freq oor-an-a-hauf (3) - 2 freq mile-an-a-hauf (4) - 1 freq seeven-an-a-hauf (6) - 1 freq lo-an-behaud (6) - 1 freq eleven-an-a-hauf (6) - 1 freq twal-hour (7) - 2 freq haun-in-haun (7) - 1 freq wan-aff (7) - 2 freq twa-fur-wan (7) - 1 freq twa-faul (7) - 1 freq a-a-ah (7) - 1 freq twaa-year-aul (7) - 2 freq wheat-shaef (7) - 2 freq ten-in-a-row (7) - 3 freq tae-haud (7) - 1 freq eleeven-an-a-hauf (7) - 1 freq twa-month-aald (7) - 1 freq bwaahahaha (7) - 1 freq near-at-haun (7) - 2 freq haand-hadd (7) - 1 freq fore-a-haun (7) - 1 freq twaa-three (7) - 1 freq waash-han (7) - 1 freq twa-staup (7) - 1 freq |
twa-an-a-hauf (0) - 2 freq oor-an-a-hauf (5) - 2 freq mile-an-a-hauf (6) - 1 freq seeven-an-a-hauf (9) - 1 freq eleven-an-a-hauf (9) - 1 freq ten-in-a-row (10) - 3 freq eleeven-an-a-hauf (10) - 1 freq lo-an-behaud (10) - 1 freq oan-and-aff (11) - 1 freq twaa-three (11) - 1 freq haun-in-haun (11) - 1 freq wheat-shaef (11) - 2 freq twaa-year-aul (11) - 2 freq wan-aff (11) - 2 freq twa-fur-wan (11) - 1 freq twal-hour (11) - 2 freq then-a-days (11) - 1 freq twae-thrie (12) - 1 freq twantie-ane (12) - 2 freq twenty-four (12) - 7 freq twinty-sax (12) - 2 freq twae-three (12) - 6 freq twinty-four (12) - 1 freq out-and-out (12) - 1 freq whun-hud (12) - 1 freq |
SoundEx code - T510 thump - 33 freq thumb - 25 freq tomb - 31 freq tomboy - 1 freq tump - 1 freq tempo - 4 freq temp - 734 freq twa-an-a-hauf - 2 freq thomp - 1 freq thoomb - 6 freq tumb - 1 freq timpo - 1 freq temp- - 7 freq tmv - 1 freq tnv - 1 freq tomb - 1 freq tmmf - 1 freq timehop - 1 freq tenv - 1 freq tywanb - 1 freq tonyip - 1 freq |
MetaPhone code - TWNHF twa-an-a-hauf - 2 freq |
TWA-AN-A-HAUF |
| Time to execute Levenshtein function - 0.440210 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.759845 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.027630 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.074406 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.000875 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. |