| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| htafc (0) - 11 freq afc (2) - 27 freq tac (2) - 22 freq haec (2) - 1 freq hac (2) - 1 freq haft (2) - 2 freq haaf (2) - 34 freq haf (2) - 9 freq hrbfc (2) - 1 freq haff (2) - 4 freq taf (2) - 1 freq talc (2) - 1 freq htrfn (2) - 1 freq atfc (2) - 3 freq staff (2) - 109 freq taft (2) - 1 freq ontac (3) - 2 freq tams (3) - 4 freq htt (3) - 1 freq hlai (3) - 1 freq haav (3) - 1 freq hea (3) - 2 freq herc (3) - 1 freq tar (3) - 26 freq hofn (3) - 4 freq |
htafc (0) - 11 freq atfc (3) - 3 freq taft (4) - 1 freq tac (4) - 22 freq htrfn (4) - 1 freq afc (4) - 27 freq hitec (4) - 1 freq hate-c (4) - 2 freq hatefu (4) - 5 freq ictfc (4) - 3 freq talc (4) - 1 freq staff (4) - 109 freq haec (4) - 1 freq taf (4) - 1 freq haft (4) - 2 freq haaf (4) - 34 freq haf (4) - 9 freq hac (4) - 1 freq haff (4) - 4 freq hrbfc (4) - 1 freq huif (5) - 12 freq hqec (5) - 1 freq httle (5) - 1 freq hlf (5) - 2 freq halfa (5) - 2 freq |
SoundEx code - H312 https - 4789 freq haudybus - 1 freq hautboys - 1 freq 'https - 1 freq htafc - 11 freq haudbacks - 1 freq https - 1 freq |
MetaPhone code - TFK daffik - 2 freq dfc - 2 freq tveuk - 1 freq defeck - 1 freq tfqw - 1 freq tavok - 1 freq daveg - 1 freq ytvoc - 1 freq tevc - 1 freq htafc - 11 freq |
HTAFC |
| Time to execute Levenshtein function - 0.304766 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.719201 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.068788 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.041034 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.000878 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. |