| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haizarts (0) - 1 freq faizart (2) - 1 freq hazards (2) - 1 freq hairts (2) - 62 freq halyards (3) - 1 freq haitts (3) - 1 freq airts (3) - 356 freq jamtarts (3) - 4 freq habitats (3) - 4 freq taewarts (3) - 1 freq haimers (3) - 2 freq hairms (3) - 2 freq hairs (3) - 38 freq bastarts (3) - 24 freq hairt's (3) - 7 freq tairts (3) - 5 freq hairns (3) - 8 freq hairps (3) - 2 freq haircuts (3) - 2 freq lazarus (3) - 20 freq haggart (3) - 3 freq hearts (3) - 32 freq haivers (3) - 32 freq lizards (3) - 4 freq phaisants (3) - 1 freq |
haizarts (0) - 1 freq hazards (3) - 1 freq hairts (3) - 62 freq faizart (4) - 1 freq haerts (4) - 19 freq hearts (4) - 32 freq hogwarts (5) - 1 freq chairts (5) - 8 freq hancairts (5) - 1 freq pairts (5) - 230 freq hair's (5) - 21 freq he'rts (5) - 4 freq cairts (5) - 34 freq hairsts (5) - 7 freq hazard (5) - 2 freq hairty (5) - 3 freq hazardous (5) - 1 freq hartis (5) - 1 freq hurts (5) - 17 freq hunerts (5) - 1 freq herts (5) - 119 freq hairth (5) - 26 freq hairt (5) - 341 freq haimert (5) - 1 freq hairths (5) - 1 freq |
SoundEx code - H263 hogwarts - 1 freq hie-cairt - 1 freq haggart - 3 freq hazardous - 1 freq hochered - 1 freq hazard - 2 freq hsard - 1 freq haizarts - 1 freq €˜hagrid - 1 freq highroad - 6 freq hazards - 1 freq haggardhawks - 2 freq haggard - 1 freq |
MetaPhone code - HSRTS hazardous - 1 freq haizarts - 1 freq hazards - 1 freq |
HAIZARTS |
| Time to execute Levenshtein function - 0.472086 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.986761 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.029841 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.092745 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.001041 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. |