I have to write an algorithm that gives the user the closest match of the contact based on the name and address, because both of them are disturbed There are several ways to enter a company name and address, for example:
Company A, 123 No Street Suite 200, Avantown, AK 99012 Comp. A, 123 No St., Suite 200, Avantown, AK 99012 CA, 123 No Street Street 200, Avantown, AK 99012 I have considered taking Levenshatan distance on the name, but It does not seem to be a great tool, because they can collapse the name. I'm looking for some things that most probably match the information.
My initial effort was to limit the results before 5 digits before postal code and then try to filter based on other information, but there should be a more standard approach to doing this. I am working in .NET but you will see any code to get an idea about this.
I'm not exactly how this has been completed, but all major delivery companies (FedEx, USPS, UPS) has a way to match your address address against your database and change it in normalized form. As I have seen that it happens on many websites (Amazon comes to mind), I am convinced that there is an API for this functionality, but I do not know where it is and whether it is suitable for your purposes is. / P>
Edit: I found
Comments
Post a Comment