| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heichest (0) - 24 freq heighest (1) - 2 freq dreichest (2) - 2 freq richest (2) - 8 freq heidcrest (2) - 1 freq laichest (2) - 2 freq heicher (2) - 30 freq highest (2) - 21 freq heichs (2) - 2 freq heicht (2) - 53 freq heichts (2) - 11 freq heichtent (2) - 1 freq eithest (2) - 1 freq wenches (3) - 2 freq hicher (3) - 1 freq heidies (3) - 4 freq daiches (3) - 2 freq hervest (3) - 10 freq hechts (3) - 3 freq heistent (3) - 2 freq benches (3) - 13 freq heidet (3) - 1 freq richert (3) - 2 freq snichert (3) - 2 freq herdest (3) - 1 freq |
heichest (0) - 24 freq heighest (2) - 2 freq heichs (3) - 2 freq laichest (3) - 2 freq heicht (3) - 53 freq highest (3) - 21 freq richest (3) - 8 freq hechtit (4) - 5 freq heichmaist (4) - 6 freq hicht (4) - 47 freq richist (4) - 1 freq 'chest (4) - 1 freq hichtit (4) - 1 freq hooches (4) - 1 freq hechlet (4) - 1 freq heuchs (4) - 3 freq chest (4) - 101 freq heichts (4) - 11 freq heicher (4) - 30 freq heidcrest (4) - 1 freq dreichest (4) - 2 freq hecht (4) - 47 freq heichtent (4) - 1 freq heychester (4) - 1 freq heichtie (4) - 1 freq |
SoundEx code - H223 heichest - 24 freq housecoat - 2 freq highest - 21 freq hugest - 1 freq hijacked - 2 freq heich-stannèrt - 1 freq heighest - 2 freq hege-syde - 1 freq high-status - 2 freq heychesters - 2 freq heychester - 1 freq hescastle - 1 freq hoosecoat - 2 freq hoosecoats - 1 freq |
MetaPhone code - HXST heichest - 24 freq |
HEICHEST |
| Time to execute Levenshtein function - 0.206711 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.361657 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.029240 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.038542 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.000949 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. |