| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairpins (0) - 1 freq hairpin (1) - 3 freq wairnins (2) - 1 freq hippins (2) - 3 freq pairins (2) - 1 freq gairdins (2) - 2 freq haiflins (2) - 1 freq hairin (2) - 3 freq shairpens (2) - 1 freq mairgins (2) - 1 freq hairline (2) - 4 freq mairtins (2) - 1 freq pairtins (2) - 1 freq hairies (2) - 4 freq mairkins (2) - 1 freq hairps (2) - 2 freq hainins (2) - 1 freq fairins (2) - 7 freq happins (2) - 3 freq hairns (2) - 8 freq lairnins (2) - 1 freq airtins (2) - 8 freq haippens (2) - 2 freq mairjins (2) - 1 freq pairris (3) - 2 freq |
hairpins (0) - 1 freq hairpin (2) - 3 freq haippens (3) - 2 freq shairpens (3) - 1 freq hairps (3) - 2 freq happins (3) - 3 freq hairns (3) - 8 freq hippins (3) - 3 freq harpoons (3) - 3 freq mairjins (4) - 1 freq harrans (4) - 1 freq harps (4) - 1 freq helpins (4) - 3 freq herrins (4) - 2 freq hirples (4) - 7 freq herdins (4) - 3 freq harns (4) - 52 freq sharpens (4) - 2 freq hairdnes (4) - 1 freq happens (4) - 207 freq hippens (4) - 5 freq hearins (4) - 1 freq hapens (4) - 1 freq hairline (4) - 4 freq airtins (4) - 8 freq |
SoundEx code - H615 horfinn - 1 freq hairpins - 1 freq harbinger - 2 freq harpoon - 8 freq harpooner - 5 freq harpoons - 3 freq harbingers - 2 freq hairpin - 3 freq harpooned - 1 freq hairband - 1 freq hrvmam - 1 freq |
MetaPhone code - HRPNS hairpins - 1 freq harpoons - 3 freq |
HAIRPINS |
| Time to execute Levenshtein function - 0.230355 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.398304 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.027471 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.038228 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.000946 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. |