| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hijacked (0) - 2 freq jacked (2) - 2 freq hijack (2) - 1 freq hijackers (2) - 1 freq hacked (2) - 9 freq attacked (3) - 13 freq whacked (3) - 5 freq cloacked (3) - 11 freq nicked (3) - 14 freq clacked (3) - 1 freq shoacked (3) - 2 freq lacked (3) - 1 freq haiked (3) - 1 freq tracked (3) - 8 freq mirackled (3) - 1 freq backed (3) - 27 freq hickled (3) - 1 freq chacked (3) - 2 freq kicked (3) - 63 freq hocked (3) - 1 freq stacked (3) - 7 freq wicked (3) - 25 freq ticked (3) - 5 freq jacket (3) - 29 freq loacked (3) - 4 freq |
hijacked (0) - 2 freq hijack (3) - 1 freq hacked (3) - 9 freq jacked (3) - 2 freq hocked (4) - 1 freq hijackers (4) - 1 freq hinked (5) - 1 freq hanked (5) - 1 freq jaiked (5) - 2 freq wracked (5) - 5 freq smacked (5) - 7 freq hiked (5) - 2 freq picked (5) - 189 freq cracked (5) - 41 freq packed (5) - 59 freq racked (5) - 5 freq doacked (5) - 1 freq chicked (5) - 1 freq sacked (5) - 9 freq hockid (5) - 1 freq jockd (5) - 1 freq hacket (5) - 1 freq quacked (5) - 1 freq licked (5) - 10 freq craacked (5) - 1 freq |
SoundEx code - H223 heichest - 24 freq housecoat - 2 freq highest - 21 freq hugest - 1 freq hijacked - 2 freq heich-stannèrt - 1 freq heighest - 2 freq hege-syde - 1 freq high-status - 2 freq heychesters - 2 freq heychester - 1 freq hescastle - 1 freq hoosecoat - 2 freq hoosecoats - 1 freq |
MetaPhone code - HJKT hijacked - 2 freq |
HIJACKED |
| Time to execute Levenshtein function - 0.390002 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.685550 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.086491 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.086466 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.000871 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. |