Fun Share: Fuzzy Search with Roger Root Method

presumably, your reference table would have all rows populated with a new column containing the roger_root for that row’s key value. for example, your table may contain an entry for DAVIES (roger root=18000). now when your app receives an input for DAVEIS , presumably it would convert it to a roger_root code then it should return a list of possible matches (ie. rows with the same roger_root). i called them phonetic matches beause the algorithm takes into account that some consonants sound alike or that vowels other than the first are ignored beause they all sound like “uh”?

sorry about the bad link.
here’s the link to the file i uploaded to my google drive: