| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heichrife (0) - 1 freq heichlie (2) - 2 freq heichtie (2) - 1 freq feichtie (3) - 1 freq highrise (3) - 2 freq eichtie (3) - 2 freq seicrie (3) - 2 freq hechtit (4) - 5 freq blindrife (4) - 1 freq heinrich (4) - 3 freq feechie (4) - 16 freq heichs (4) - 2 freq cheirie (4) - 1 freq mirkrife (4) - 1 freq snochrie (4) - 12 freq mockrife (4) - 1 freq heichmaist (4) - 6 freq teuchie (4) - 1 freq echtie (4) - 4 freq richie (4) - 2 freq weechile (4) - 1 freq heidwie (4) - 1 freq bleckrife (4) - 3 freq eechie (4) - 8 freq seichin (4) - 2 freq |
heichrife (0) - 1 freq heichtie (4) - 1 freq heichlie (4) - 2 freq highrise (5) - 2 freq heicher (5) - 30 freq hichtit (6) - 1 freq heich (6) - 264 freq hechle (6) - 1 freq hicher (6) - 1 freq heuchin (6) - 1 freq heich-up (6) - 1 freq hechtin (6) - 1 freq heecher (6) - 1 freq hechin (6) - 3 freq heichts (6) - 11 freq heichest (6) - 24 freq heicht (6) - 53 freq hechtit (6) - 5 freq cheirie (6) - 1 freq heichs (6) - 2 freq seicrie (6) - 2 freq mockrife (6) - 1 freq eichtie (6) - 2 freq feichtie (6) - 1 freq kicherin (7) - 2 freq |
SoundEx code - H261 heichrife - 1 freq hawickrfc - 1 freq hwywxrp - 1 freq |
MetaPhone code - HXRF heichrife - 1 freq |
HEICHRIFE |
| Time to execute Levenshtein function - 0.226577 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.594448 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.058662 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.043906 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.001197 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. |