Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
highlichtit (0) - 1 freq highlichtin (1) - 1 freq highlichts (2) - 4 freq highlicht (2) - 3 freq heighlichtin (2) - 3 freq hielichtit (2) - 1 freq heighlichts (3) - 5 freq heighlichted (3) - 7 freq highlighting (3) - 3 freq highlights (3) - 14 freq heighlicht (3) - 3 freq highlight (3) - 16 freq plichtit (4) - 3 freq deilichtit (4) - 1 freq highlandlit (4) - 1 freq delichtit (4) - 18 freq lichtit (4) - 64 freq slichtit (4) - 1 freq firelichtin (4) - 1 freq kinichtit (4) - 1 freq hielichts (4) - 1 freq enlichtit (4) - 1 freq blichtit (4) - 2 freq hichtit (4) - 1 freq hielicht (4) - 3 freq |
highlichtit (0) - 1 freq highlichtin (2) - 1 freq heighlichtin (3) - 3 freq highlicht (3) - 3 freq highlichts (3) - 4 freq heighlichted (4) - 7 freq hielichtit (4) - 1 freq heighlichts (4) - 5 freq heighlicht (4) - 3 freq highlight (5) - 16 freq highlights (5) - 14 freq highlighting (6) - 3 freq blichtit (7) - 2 freq enlichtit (7) - 1 freq hichtit (7) - 1 freq hielicht (7) - 3 freq uplichtit (7) - 1 freq flichtit (7) - 5 freq hielichts (7) - 1 freq delichtit (7) - 18 freq plichtit (7) - 3 freq highlandlit (7) - 1 freq deilichtit (7) - 1 freq lichtit (7) - 64 freq slichtit (7) - 1 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 - HFLXTT highlichtit - 1 freq |
HIGHLICHTIT |
Time to execute Levenshtein function - 0.506932 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.370336 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.101049 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.113731 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.001307 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. |