| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| square-gos (0) - 1 freq square-goes (1) - 1 freq squarego (2) - 1 freq squares (3) - 17 freq squarepeg (4) - 1 freq square (4) - 164 freq squared (4) - 6 freq squarely (4) - 3 freq quaregeg (4) - 1 freq squaring (4) - 1 freq quares (4) - 1 freq squaresail (4) - 1 freq squars (4) - 1 freq scarecrow (5) - 5 freq squeeze-box (5) - 1 freq sware-in (5) - 1 freq squeers (5) - 1 freq sure's (5) - 3 freq sureness (5) - 1 freq €˜square- (5) - 1 freq squirrels (5) - 20 freq squalor (5) - 2 freq squeegee (5) - 2 freq quavers (5) - 2 freq squadron (5) - 6 freq |
square-gos (0) - 1 freq square-goes (1) - 1 freq squarego (4) - 1 freq squares (5) - 17 freq squaring (6) - 1 freq squars (6) - 1 freq squarepeg (6) - 1 freq squared (7) - 6 freq squeers (7) - 1 freq squirrels (7) - 20 freq squirts (7) - 1 freq shargs (7) - 1 freq squarely (7) - 3 freq quaregeg (7) - 1 freq quares (7) - 1 freq square (7) - 164 freq squaresail (7) - 1 freq squarrt (8) - 1 freq sqanews (8) - 15 freq squaddies (8) - 1 freq stane-is (8) - 1 freq squarie (8) - 1 freq squalls (8) - 1 freq quarries (8) - 4 freq snares (8) - 4 freq |
SoundEx code - S622 sources - 24 freq screeches - 3 freq square-goes - 1 freq square-gos - 1 freq sarcasm - 12 freq scroggis - 1 freq skreichs - 7 freq surgical - 5 freq skreighs - 5 freq scraichs - 2 freq surcastik - 2 freq surcastecly - 1 freq scairses - 1 freq sarcastically - 8 freq skraichs - 5 freq sarcastic - 11 freq sarky-smiled - 1 freq sarcasms - 1 freq screichs - 4 freq sharkies - 1 freq scriechs - 1 freq share-sized - 1 freq scraighs - 1 freq soorces - 15 freq skrekowizc - 1 freq searches - 4 freq scurrie-keech - 1 freq sairches - 1 freq surzhik - 2 freq screiches - 1 freq |
MetaPhone code - SKRKS square-goes - 1 freq square-gos - 1 freq scroggis - 1 freq scrogs - 4 freq skrogs - 1 freq skraiks - 1 freq skreks - 2 freq scroggs - 1 freq |
SQUARE-GOS |
| Time to execute Levenshtein function - 0.205406 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.397857 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.030832 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.039242 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.000862 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. |