| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hazels (0) - 2 freq haels (1) - 1 freq hazel (1) - 51 freq hazelr (1) - 7 freq waels (2) - 4 freq heels (2) - 77 freq gazes (2) - 2 freq hame's (2) - 6 freq hazle (2) - 1 freq taels (2) - 2 freq hamelt (2) - 72 freq haals (2) - 9 freq lapels (2) - 1 freq hames (2) - 51 freq hanzel (2) - 1 freq halls (2) - 13 freq chanels (2) - 1 freq hauls (2) - 1 freq haters (2) - 1 freq haeds (2) - 6 freq halely (2) - 7 freq hae's (2) - 6 freq hales (2) - 1 freq hovels (2) - 1 freq hails (2) - 6 freq |
hazels (0) - 2 freq haels (2) - 1 freq hazelr (2) - 7 freq hazel (2) - 51 freq hails (3) - 6 freq hovels (3) - 1 freq hotels (3) - 9 freq hauls (3) - 1 freq hales (3) - 1 freq hazily (3) - 1 freq haalls (3) - 1 freq hazll (3) - 1 freq halls (3) - 13 freq haunels (3) - 1 freq ghazals (3) - 1 freq houzils (3) - 1 freq haals (3) - 9 freq heels (3) - 77 freq hazle (3) - 1 freq halse (4) - 1 freq hls (4) - 1 freq hailes (4) - 3 freq zils (4) - 1 freq heles (4) - 1 freq howls (4) - 15 freq |
SoundEx code - H242 highlights - 14 freq hackles - 3 freq hauchles - 1 freq highlight - 16 freq hochles - 1 freq heh-class - 1 freq huckles - 1 freq hooseless - 1 freq highheels - 1 freq hooselessness - 1 freq heighlichtin - 3 freq heighlicht - 3 freq heighlichts - 5 freq heighlichted - 7 freq hechle's - 2 freq hecklesome - 1 freq hushloch - 1 freq hasillgreen' - 1 freq highlichts - 4 freq houzils - 1 freq hie-gloss - 1 freq highly-skilled - 1 freq highlichtit - 1 freq haagless - 1 freq highlicht - 3 freq howcleuch - 4 freq howcleuchsheil - 3 freq howcleuchshiel - 1 freq hazels - 2 freq highlichtin - 1 freq hazelglasgow - 4 freq highlighting - 3 freq |
MetaPhone code - HSLS hooseless - 1 freq houzils - 1 freq hazels - 2 freq |
HAZELS |
| Time to execute Levenshtein function - 0.250127 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.411789 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.029213 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.043216 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.001221 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. |