Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
girseruits (0) - 1 freq gressruits (3) - 2 freq grapefruits (4) - 1 freq girders (4) - 12 freq greits (4) - 3 freq githerins (4) - 1 freq miseries (4) - 2 freq pursuits (4) - 2 freq deseruit (4) - 1 freq norseroots (4) - 1 freq inserts (4) - 1 freq recruits (4) - 6 freq airteries (4) - 1 freq firrits (4) - 3 freq insertit (4) - 2 freq biscuits (4) - 42 freq desseruit (4) - 1 freq nurseries (4) - 1 freq girlfreins (4) - 1 freq biscuity (5) - 1 freq results (5) - 71 freq gitters (5) - 1 freq vreits (5) - 1 freq givers (5) - 2 freq giekit (5) - 1 freq |
girseruits (0) - 1 freq gressruits (4) - 2 freq norseroots (5) - 1 freq recruits (6) - 6 freq inserts (6) - 1 freq firrits (6) - 3 freq grassroots (6) - 43 freq gressroots (6) - 5 freq pursuits (6) - 2 freq girders (6) - 12 freq grapefruits (6) - 1 freq greits (6) - 3 freq nurseries (6) - 1 freq grosets (6) - 3 freq greements (7) - 1 freq garrins (7) - 1 freq gussets (7) - 1 freq gairments (7) - 1 freq girss (7) - 16 freq corsets (7) - 2 freq airports (7) - 3 freq portraits (7) - 12 freq groceries (7) - 2 freq greets (7) - 25 freq asserts (7) - 1 freq |
SoundEx code - G626 gregorian - 2 freq grocer - 3 freq grey-gorred - 1 freq grocers - 3 freq grocer's - 5 freq gregory - 9 freq gray-green - 1 freq gregory's - 1 freq groceries - 2 freq gressroots - 5 freq groazirs - 1 freq gear-crinchin - 1 freq groceries' - 1 freq grocerman - 1 freq grocery's - 1 freq greasier - 1 freq grossars - 1 freq grocery - 4 freq gregoire - 1 freq grégoire - 1 freq gress-green - 1 freq grassroots - 43 freq grigory - 2 freq gressruits - 2 freq €˜groceries - 1 freq girseruits - 1 freq graysartschool - 1 freq gregorhepburn - 8 freq grasser - 1 freq gregor - 7 freq grazer - 1 freq grazzar - 1 freq gregoria - 1 freq garyshearer - 31 freq gregjkerr - 4 freq |
MetaPhone code - JRSRTS girseruits - 1 freq |
GIRSERUITS |
Time to execute Levenshtein function - 0.229142 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.526325 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.033308 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.071187 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.000816 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. |