Approximate string matching
I know this question have been asked a lot of time. I want a suggestion on which algorithm is suitable for approximate string matching. The application is specifically for company name matching only and nothing else. The biggest challenge is probably the company end name part and short named part Example: 1. companyA pty ltd vs companyA pty. ltd. vs companyA 2. WES Engineering vs W.E.S. Engineering (extremely rare occurance) Do you think Levenshtein Edit Distance is adequate? I'm using C# Regards, Max hashable There are various string distance metrics you could use. I would recommend Jaro