| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grotti-buckie (0) - 1 freq grottie-buckie (1) - 6 freq grottybuckies (3) - 1 freq grottie-buckie's (3) - 2 freq colliebuckie (5) - 1 freq bittickie (6) - 1 freq nott-wurdie (6) - 1 freq grottie (6) - 1 freq gritty-like (6) - 1 freq gratitude (7) - 16 freq portiebellie (7) - 1 freq guckie (7) - 1 freq tickie (7) - 1 freq ower-muckle (7) - 1 freq proteckin (7) - 2 freq buckie (7) - 45 freq groattie (7) - 1 freq tottiewie (7) - 1 freq georgiebestie (7) - 1 freq trickie (7) - 5 freq grue-inducin (7) - 1 freq protecke (7) - 1 freq nott-book (7) - 1 freq braid-backit (7) - 1 freq groustie (7) - 2 freq |
grotti-buckie (0) - 1 freq grottie-buckie (1) - 6 freq grottie-buckie's (5) - 2 freq grottybuckies (5) - 1 freq gritty-like (8) - 1 freq grew-back (9) - 1 freq sittinback (10) - 1 freq prattick (10) - 18 freq great-uncle (10) - 1 freq bittickie (10) - 1 freq colliebuckie (10) - 1 freq nott-book (10) - 1 freq grottie (10) - 1 freq greased-back (10) - 1 freq grey-black (11) - 1 freq roit-like (11) - 1 freq sate-back (11) - 1 freq greetin-faced (11) - 5 freq brattbakk (11) - 2 freq grand-fock (11) - 1 freq ratty-lookin (11) - 1 freq glottocode (11) - 1 freq pratticks (11) - 10 freq tattie-pickin (11) - 1 freq centre-back (11) - 1 freq |
SoundEx code - G631 grateful - 33 freq gratfu' - 1 freq gratefu - 28 freq gratified - 1 freq gratefoo - 4 freq gratefoo's - 1 freq gratefu' - 1 freq gratefully - 3 freq girthpooch - 1 freq gratefil - 1 freq grotti-buckie - 1 freq grottie-buckie - 6 freq grottie-buckie's - 2 freq graetful - 1 freq gardyveen - 2 freq gratefull - 2 freq gratification - 1 freq grateffu - 1 freq grytfu - 1 freq growed-up - 1 freq growed-ups - 1 freq guard-pickets - 1 freq greatfu - 1 freq greattv - 1 freq gqkourdfug - 1 freq grottybuckies - 1 freq garethbale - 1 freq |
MetaPhone code - KRTBK grotti-buckie - 1 freq grottie-buckie - 6 freq |
GROTTI-BUCKIE |
| Time to execute Levenshtein function - 0.338984 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.461704 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.029077 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.043012 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.000921 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. |