| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gregorian (0) - 2 freq gregoria (1) - 1 freq gregory's (3) - 1 freq gregor (3) - 7 freq ragoran (3) - 6 freq georgian (3) - 4 freq grecian (3) - 1 freq gregoire (3) - 1 freq gregory (3) - 9 freq recordan (3) - 1 freq historian (4) - 2 freq groin (4) - 3 freq geyran (4) - 1 freq reconin (4) - 1 freq regalin (4) - 1 freq draconian (4) - 6 freq grenein (4) - 1 freq restorin (4) - 3 freq grootan (4) - 1 freq grigory (4) - 2 freq €œragoran (4) - 1 freq egeria (4) - 1 freq grekin (4) - 1 freq removin (4) - 5 freq remorsin (4) - 1 freq |
gregorian (0) - 2 freq gregoria (2) - 1 freq gregoire (4) - 1 freq georgian (4) - 4 freq gregory (4) - 9 freq ragoran (4) - 6 freq gregor (4) - 7 freq gagarin (5) - 2 freq grigory (5) - 2 freq grecian (5) - 1 freq gregory's (5) - 1 freq referin (6) - 1 freq grocerman (6) - 1 freq growlan (6) - 3 freq georgia (6) - 6 freq gremlin (6) - 4 freq greivin (6) - 1 freq greetan (6) - 10 freq gorman (6) - 1 freq greittin (6) - 2 freq gearin (6) - 2 freq bulgarian (6) - 1 freq growan (6) - 24 freq preparin (6) - 7 freq rearan (6) - 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 - KRKRN gregorian - 2 freq gray-green - 1 freq |
GREGORIAN |
| Time to execute Levenshtein function - 0.276215 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.462570 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.031532 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.043354 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.001315 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. |