| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hinny-piece (0) - 1 freq hinny-press (3) - 1 freq yin-a-piece (3) - 1 freq hinny-bee (3) - 1 freq hinny-douce (3) - 1 freq hinny-pot (4) - 1 freq sey-piece (4) - 1 freq ringpiece (4) - 1 freq hinny-bees (4) - 1 freq jeely-piece (4) - 3 freq hinnerance (5) - 1 freq nopiece (5) - 2 freq jinny-spake (5) - 1 freq muntlepiece (5) - 5 freq three-piece (5) - 4 freq playpiece (5) - 5 freq fifty-pence (5) - 1 freq ill-plece (5) - 1 freq hinnereine (5) - 1 freq hinnied (5) - 1 freq funny-like (5) - 2 freq jeely-piece- (5) - 1 freq hinny-muin (5) - 2 freq jam-piece (5) - 1 freq a-piece (5) - 5 freq |
hinny-piece (0) - 1 freq hinny-douce (4) - 1 freq hinny-bee (5) - 1 freq yin-a-piece (5) - 1 freq hinny-pot (5) - 1 freq hinny-bees (6) - 1 freq hinny-press (6) - 1 freq ringpiece (7) - 1 freq hinny-kaim (7) - 2 freq sey-piece (7) - 1 freq hinnerance (7) - 1 freq hinny-muin (7) - 2 freq jeely-piece (7) - 3 freq canny-like (8) - 1 freq mantlepiece (8) - 5 freq twa-piece (8) - 1 freq mince-pies (8) - 1 freq tap-piece (8) - 2 freq nicey-nice (8) - 2 freq hinnyin (8) - 1 freq -piece (8) - 2 freq hinnies (8) - 6 freq hinnerlie (8) - 10 freq muntelpiece (8) - 1 freq mantelpiece (8) - 10 freq |
SoundEx code - H512 haunbag - 9 freq humps - 3 freq haunfast - 2 freq hembist - 1 freq hanfoos - 1 freq humphs - 2 freq henna-busks - 1 freq humfishin - 1 freq hanbug - 11 freq hame-bakes - 1 freq humbug - 5 freq haunfus - 2 freq hanfaes - 1 freq hame-bakin - 1 freq home-baked - 1 freq hinny-bees - 1 freq hampstead - 1 freq han-pickit - 1 freq hinny-piece - 1 freq hymn-books - 1 freq hempies- - 1 freq haunbuik - 2 freq hampshire - 1 freq hempies - 2 freq humfished - 1 freq humbugs - 5 freq hanbags - 1 freq hanbag - 1 freq henpeckit - 1 freq homepage - 1 freq hmfigpsmv - 1 freq humpbacks - 1 freq |
MetaPhone code - HNPS hinny-piece - 1 freq |
HINNY-PIECE |
| Time to execute Levenshtein function - 0.247071 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.454760 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.032995 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.068583 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.000981 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. |