| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairt-attack (0) - 1 freq cairt-track (3) - 1 freq pairt-tak (4) - 1 freq gait-track (4) - 1 freq hat-trick (5) - 2 freq hairtbrauk (5) - 1 freq hairt-glad (5) - 1 freq hairt-warm (5) - 1 freq hert-brack (5) - 1 freq cairt-trink (5) - 1 freq hairt-sair (5) - 3 freq hairstpark (5) - 1 freq hairy-tatties (5) - 1 freq tick-tack (6) - 1 freq di-a-lack (6) - 2 freq shitmarack (6) - 1 freq heirt-scaud (6) - 1 freq hairtfelt (6) - 1 freq heir-awaw (6) - 1 freq air-space (6) - 1 freq haystack (6) - 2 freq hert-touch (6) - 1 freq hairt-likin (6) - 1 freq hairst-time (6) - 1 freq fairy-tale (6) - 4 freq |
hairt-attack (0) - 1 freq cairt-track (5) - 1 freq hert-brack (7) - 1 freq hat-trick (7) - 2 freq gait-track (7) - 1 freq pairt-tak (7) - 1 freq cairt-trink (8) - 1 freq hairy-tatties (8) - 1 freq hert-touch (8) - 1 freq heirt-scaud (9) - 1 freq hartnett (9) - 1 freq haert-baet (9) - 1 freq portpatrick (9) - 2 freq prattick (9) - 18 freq hert-brak (9) - 1 freq hairstpark (9) - 1 freq hairt-glad (9) - 1 freq hairtbrauk (9) - 1 freq hairt-warm (9) - 1 freq hairt-sair (9) - 3 freq four-track (9) - 1 freq hey-stack (9) - 1 freq hairt-shaped (10) - 1 freq hairtbeat (10) - 5 freq pairt-takars (10) - 5 freq |
SoundEx code - H633 hurtit - 16 freq hereditary - 4 freq hertit - 18 freq herdit - 8 freq hearted - 5 freq hurtet - 2 freq hairtet - 1 freq haurd-heidit - 1 freq herted - 6 freq hurted - 2 freq hairy-tatties - 1 freq herdeth - 1 freq hard-edged - 1 freq hortative - 1 freq hairted - 2 freq hairt-attack - 1 freq hard-hittin - 1 freq herodotus - 1 freq hertitly - 1 freq herded - 1 freq hairtedly - 1 freq hertitsome - 1 freq hertitness - 1 freq hirded - 1 freq |
MetaPhone code - HRTTK hairt-attack - 1 freq |
HAIRT-ATTACK |
| Time to execute Levenshtein function - 0.217449 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.428400 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.031505 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.041507 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.001285 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. |