| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidcrest (0) - 1 freq heichest (2) - 24 freq heiddress (2) - 1 freq heidmaist (3) - 40 freq heidies (3) - 4 freq reidbriest (3) - 2 freq reidbreist (3) - 2 freq heidaches (3) - 2 freq heidcourt (3) - 1 freq increst (3) - 1 freq heidless (3) - 12 freq herdest (3) - 1 freq deidliest (3) - 1 freq heidfirst (3) - 2 freq heid-dress (3) - 1 freq heiders (3) - 4 freq heidet (3) - 1 freq seicret (3) - 3 freq heighest (3) - 2 freq heidcases (3) - 1 freq heides (3) - 1 freq heidwey (4) - 4 freq richest (4) - 8 freq sairest (4) - 4 freq reid-het (4) - 5 freq |
heidcrest (0) - 1 freq heidcourt (4) - 1 freq heidfirst (4) - 2 freq heiddress (4) - 1 freq heichest (4) - 24 freq heidcases (5) - 1 freq heedfirst (5) - 1 freq heidmaist (5) - 40 freq reidbriest (5) - 2 freq increst (5) - 1 freq heiders (5) - 4 freq reidbreist (5) - 2 freq heidaches (5) - 2 freq heid-first (6) - 2 freq crest (6) - 7 freq ruidbreist (6) - 1 freq hedonist (6) - 1 freq hirst (6) - 2 freq heid-furst (6) - 1 freq hiatrist (6) - 1 freq herst (6) - 6 freq hidmast (6) - 11 freq hidmaist (6) - 2 freq harprest (6) - 1 freq sincerest (6) - 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 - HTKRST heidcrest - 1 freq |
HEIDCREST |
| Time to execute Levenshtein function - 0.370821 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 - 1.075102 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.029732 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.097173 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.001175 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. |