| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoose-fronts (0) - 1 freq hoosecoats (4) - 1 freq hoose-prood (4) - 1 freq hoose-taps (5) - 1 freq seafront (5) - 1 freq goose-guts (5) - 2 freq house-feres (5) - 1 freq y-fronts (5) - 2 freq hooletfringe (5) - 1 freq nose-rings (5) - 1 freq hoose-end (5) - 2 freq hoosedirect (5) - 1 freq shop-front (5) - 1 freq hoose-huntin (5) - 2 freq hoose-price (5) - 1 freq moose-traps (5) - 5 freq hoose-names (5) - 1 freq forefront (5) - 5 freq norseroots (5) - 1 freq hoosecoat (5) - 2 freq hooseholds (5) - 1 freq shopfronts (5) - 1 freq hose-gress (5) - 1 freq hoose-work (5) - 1 freq hoose-trained (5) - 1 freq |
hoose-fronts (0) - 1 freq house-feres (7) - 1 freq y-fronts (7) - 2 freq hoose-huntin (8) - 2 freq hoose-trained (8) - 1 freq hoose-names (8) - 1 freq shopfronts (8) - 1 freq hose-gress (8) - 1 freq shop-front (8) - 1 freq nose-rings (8) - 1 freq seafront (8) - 1 freq huif-prents (8) - 1 freq hoose-prood (8) - 1 freq hoosecoats (8) - 1 freq hoose-work (9) - 1 freq hause-chynes (9) - 1 freq hard-fronted (9) - 1 freq house-born (9) - 1 freq near-front (9) - 1 freq hill-forts (9) - 1 freq moose-traps (9) - 5 freq hooletfringe (9) - 1 freq goose-guts (9) - 2 freq hoose-taps (9) - 1 freq hoose-end (9) - 2 freq |
SoundEx code - H216 house-born - 1 freq husqvarna - 1 freq hoosoever - 4 freq 'hoosoever - 1 freq hoose-prood - 1 freq high-protection - 1 freq high-powered - 2 freq hoose-price - 1 freq hoosebreakers - 1 freq house-feres - 1 freq hawksbeard - 2 freq hesperides - 4 freq high-born - 1 freq hoosaeiver - 3 freq hooseaiver - 1 freq €¦hoosaeiver - 1 freq housskeiper - 1 freq heich-profile - 1 freq hoose-fronts - 1 freq hoose-breaking - 1 freq |
MetaPhone code - HSFRNTS hoose-fronts - 1 freq |
HOOSE-FRONTS |
| Time to execute Levenshtein function - 0.260028 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.442486 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.029686 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.040791 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.000945 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. |