| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hostage (0) - 7 freq postage (1) - 5 freq hostages (1) - 1 freq shortage (2) - 6 freq pottage (2) - 1 freq cottage (2) - 49 freq voltage (2) - 2 freq bustage (2) - 1 freq dosage (2) - 3 freq €˜stage (2) - 2 freq homage (2) - 5 freq wastage (2) - 3 freq upstage (2) - 2 freq hostile (2) - 13 freq i'stage (2) - 1 freq onstage (2) - 7 freq stage (2) - 200 freq footage (2) - 13 freq host (3) - 37 freq ustae (3) - 2 freq ontae (3) - 350 freq 'state (3) - 2 freq stake (3) - 31 freq costume (3) - 9 freq postal (3) - 3 freq |
hostage (0) - 7 freq hostages (2) - 1 freq postage (2) - 5 freq i'stage (3) - 1 freq upstage (3) - 2 freq onstage (3) - 7 freq hestigeo (3) - 2 freq wastage (3) - 3 freq stage (3) - 200 freq hostile (3) - 13 freq bustage (3) - 1 freq hyste (4) - 9 freq staige (4) - 3 freq histore (4) - 8 freq hasthe (4) - 1 freq houstrie (4) - 1 freq hostin (4) - 16 freq hashtag (4) - 7 freq stag (4) - 50 freq hosts (4) - 13 freq haste (4) - 37 freq hustle (4) - 1 freq hastie (4) - 1 freq histone (4) - 1 freq vestige (4) - 1 freq |
SoundEx code - H232 heichts - 11 freq hichts - 10 freq hechts - 3 freq hostage - 7 freq hoasts - 8 freq hosts - 13 freq hysts - 1 freq howzitgaun - 3 freq heights - 3 freq haystack - 2 freq hostess - 2 freq high-tech - 2 freq hechtsome - 1 freq hashtags - 2 freq hoosedug - 1 freq hestigeo - 2 freq heests - 2 freq hoggetscauf - 1 freq hashtag-ad - 1 freq hey-stack - 1 freq hoosehauds - 5 freq heysts - 1 freq hashtag - 7 freq heywechts - 2 freq hectic - 1 freq hgducrs - 1 freq hgtokpnr - 1 freq hugggggggsdss - 1 freq hostages - 1 freq hostesses - 1 freq hctko - 1 freq hktwkwqa - 1 freq howzitgoan - 10 freq hkzetswlvw - 1 freq hjtkb - 1 freq |
MetaPhone code - HSTJ hostage - 7 freq hestigeo - 2 freq |
HOSTAGE |
| Time to execute Levenshtein function - 0.231452 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.394994 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.030156 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.040966 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.000985 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. |