Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hight (0) - 2 freq might (1) - 421 freq fight (1) - 95 freq thight (1) - 2 freq high (1) - 619 freq sight (1) - 134 freq highe (1) - 1 freq night (1) - 955 freq tight (1) - 75 freq gight (1) - 3 freq wight (1) - 1 freq light (1) - 300 freq ight (1) - 1 freq height (1) - 45 freq dight (1) - 3 freq hicht (1) - 47 freq right (1) - 1436 freq high' (1) - 1 freq eight (1) - 69 freq highs (1) - 1 freq hig (2) - 4 freq mighta (2) - 12 freq nigh (2) - 18 freq signt (2) - 7 freq righty (2) - 1 freq |
hight (0) - 2 freq height (1) - 45 freq ight (2) - 1 freq light (2) - 300 freq dight (2) - 3 freq right (2) - 1436 freq highs (2) - 1 freq high' (2) - 1 freq wight (2) - 1 freq hicht (2) - 47 freq eight (2) - 69 freq thight (2) - 2 freq might (2) - 421 freq gight (2) - 3 freq high (2) - 619 freq fight (2) - 95 freq tight (2) - 75 freq sight (2) - 134 freq night (2) - 955 freq highe (2) - 1 freq thoght (3) - 1 freq lyght (3) - 2 freq thiught (3) - 1 freq ought (3) - 12 freq nyght (3) - 3 freq |
SoundEx code - H230 heicht - 53 freq height - 45 freq high-doh - 4 freq hicht - 47 freq heichtie - 1 freq haste - 37 freq hecht - 47 freq hoast - 42 freq hyst - 5 freq heezed - 40 freq howkit - 29 freq hushed - 10 freq hoched - 1 freq hukt - 1 freq huikd - 1 freq hejit - 1 freq heized - 14 freq hissed - 45 freq host - 37 freq howked - 25 freq hackt - 1 freq hackit - 49 freq hookit - 1 freq hiss't - 1 freq haughheid - 1 freq haughty - 3 freq hugged - 7 freq heuked - 3 freq hoked - 11 freq hight - 2 freq hawkit - 1 freq haistie - 1 freq haist - 5 freq heooket - 1 freq hoased - 1 freq hooked - 15 freq heised - 1 freq hushit - 1 freq hagged - 2 freq haggit - 3 freq heched - 1 freq hoist - 5 freq hasty - 6 freq hacked - 9 freq histy - 1 freq hoaked - 2 freq hye-shade - 2 freq houguid - 1 freq hoosed - 6 freq haughed - 1 freq hast - 2 freq hacket - 1 freq 'haste - 1 freq heist - 8 freq hasthe - 1 freq heuched - 1 freq hockid - 1 freq hcid - 1 freq hized - 1 freq hooshed - 1 freq hoasty - 2 freq hyste - 9 freq hooched - 3 freq hikit - 2 freq hashed - 4 freq hixt - 1 freq hæst - 1 freq house-heid - 1 freq heest - 1 freq hiked - 2 freq hogget - 1 freq hogsweed - 1 freq hiegate - 1 freq hosst - 1 freq howzit - 1 freq haikit - 1 freq hoocht - 3 freq hecht-aye - 1 freq heisit - 1 freq hoast' - 1 freq his't - 1 freq hoosehaud - 62 freq heezit - 4 freq hastie - 1 freq hokkit - 1 freq howest - 1 freq hauchty - 1 freq hhsssst - 1 freq huggit - 1 freq howgate - 2 freq hoscote - 39 freq haiked - 1 freq haust - 3 freq høst - 3 freq haused - 3 freq hocked - 1 freq hockit - 3 freq €˜hicht - 1 freq hous-heid - 1 freq hajget - 1 freq hayeqt - 1 freq hxzgt - 1 freq hst - 1 freq 'host' - 1 freq hosed - 1 freq hcxiti - 1 freq hqt - 1 freq housed - 1 freq |
MetaPhone code - HFT hivtae - 1 freq high-doh - 4 freq huvtae - 6 freq haffet - 5 freq heft - 111 freq heaved - 6 freq haft - 2 freq haeved - 2 freq hight - 2 freq heavit - 2 freq hivved - 1 freq hefty - 8 freq haived - 10 freq hoved - 4 freq hiv't - 1 freq hufft - 1 freq huffed - 3 freq havti - 1 freq hauf-day - 1 freq haffit - 1 freq haivt - 1 freq haufed - 2 freq hoofed - 3 freq hevved - 1 freq |
HIGHT |
Time to execute Levenshtein function - 0.178041 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.322112 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.027284 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.037351 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.000893 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. |