| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hockid-faced (0) - 1 freq rock-faced (3) - 1 freq hingit-faced (4) - 1 freq reid-faced (4) - 3 freq rid-faced (4) - 4 freq bold-faced (4) - 1 freq soor-faced (5) - 4 freq roun-faced (5) - 1 freq reed-faced (5) - 6 freq duck-face (5) - 1 freq mid-paced (5) - 1 freq fair-faced (5) - 3 freq din-faced (5) - 1 freq girnie-faced (5) - 1 freq torn-faced (5) - 4 freq solemn-faced (5) - 1 freq grim-faced (5) - 2 freq ridd-faced (5) - 2 freq poe-faced (5) - 3 freq toarn-faced (5) - 1 freq hornie-taed (5) - 1 freq baw-faced (6) - 1 freq greetin-faced (6) - 5 freq owerfaced (6) - 1 freq lang-faced (6) - 4 freq |
hockid-faced (0) - 1 freq rock-faced (5) - 1 freq rid-faced (7) - 4 freq bold-faced (7) - 1 freq reid-faced (7) - 3 freq hingit-faced (7) - 1 freq reed-faced (8) - 6 freq ridd-faced (8) - 2 freq duck-face (8) - 1 freq grim-faced (9) - 2 freq solemn-faced (9) - 1 freq toarn-faced (9) - 1 freq poe-faced (9) - 3 freq torn-faced (9) - 4 freq roun-faced (9) - 1 freq soor-faced (9) - 4 freq fair-faced (9) - 3 freq mid-paced (9) - 1 freq girnie-faced (9) - 1 freq din-faced (9) - 1 freq stern-faced (10) - 1 freq fite-faced (10) - 1 freq fresh-faced (10) - 3 freq cattie-face (10) - 14 freq bricht-faced (10) - 1 freq |
SoundEx code - H231 hoch-deep - 3 freq hiezed-up - 1 freq hauchtie-pauchtie - 1 freq hockid-faced - 1 freq hoose-taps - 1 freq howkit-up - 1 freq heized-up - 1 freq hxdav - 1 freq hwjkqdfty - 1 freq hxctfogc - 1 freq hostipal - 2 freq hywkoidptc - 2 freq hsdef - 1 freq hkgsdvx - 1 freq |
MetaPhone code - HKTFST hockid-faced - 1 freq |
HOCKID-FACED |
| Time to execute Levenshtein function - 0.221007 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.400116 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.028070 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.037354 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.000924 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. |