| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidquarters (0) - 5 freq headquarters (1) - 1 freq heid-quairters (2) - 1 freq hindquarters (2) - 1 freq heidsquares (3) - 1 freq heidwatters (3) - 1 freq heidbangers (4) - 1 freq heidsquare (4) - 2 freq threequarters (4) - 1 freq heidmaster (4) - 1 freq three-quarters (4) - 4 freq quarters (4) - 16 freq heid-bangers (4) - 3 freq three-quaarters (5) - 2 freq heaters (5) - 5 freq heidiepeers (5) - 1 freq quartert (5) - 7 freq heiddress (5) - 1 freq squatters (5) - 1 freq heid-dress (5) - 1 freq heidmaister (5) - 5 freq quaters (5) - 1 freq midstquarter (5) - 1 freq heidbummer (5) - 5 freq heidteacher (5) - 1 freq |
heidquarters (0) - 5 freq headquarters (1) - 1 freq hindquarters (3) - 1 freq heid-quairters (3) - 1 freq heidwatters (5) - 1 freq threequarters (6) - 1 freq quarters (6) - 16 freq heidsquares (6) - 1 freq quaarters (7) - 2 freq three-quarters (7) - 4 freq heidbangers (7) - 1 freq heidmaster (7) - 1 freq heidstanes (8) - 10 freq quarter's (8) - 1 freq quarter (8) - 68 freq headmaster (8) - 2 freq headteachers (8) - 1 freq heiders (8) - 4 freq deserters (8) - 2 freq heidatanes (8) - 1 freq headmaster's (8) - 2 freq quaaters (8) - 5 freq heidiepeers (8) - 1 freq quartert (8) - 7 freq quaters (8) - 1 freq |
SoundEx code - H326 headteachers - 1 freq heidteacher - 1 freq heidgear - 1 freq heidscarfs - 1 freq headie-craa - 1 freq heidquarters - 5 freq heidsquare - 2 freq heidsquares - 1 freq heddicraa - 1 freq heidcrest - 1 freq hoodie-craa - 1 freq headicraa - 2 freq heidscarf - 1 freq hoodiecraw - 1 freq heidcourt - 1 freq hatchery - 2 freq heid-quairters - 1 freq hedgerow - 2 freq heidscaurf - 1 freq hodgart - 1 freq hedgerows - 1 freq headquarters - 1 freq hatechristmasshopping - 1 freq heedgear - 1 freq |
MetaPhone code - HTKRTRS heidquarters - 5 freq heid-quairters - 1 freq headquarters - 1 freq |
HEIDQUARTERS |
| Time to execute Levenshtein function - 0.247924 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.420736 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.029210 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.045807 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.001196 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. |