Algorithm to match short text strings (equivalent product names from disparate sources)
£20-250 GBP
Pagado a la entrega
We have an existing MS SQL database which is populated with products retrieved from various sources (portals).
The various portals usually have slightly different names for the products.
E.G
Portal 1:
PortalProduct 1: CocaCola
PortalProduct 2: Manchester United
PortalProduct 3: Maplin Electronics
Portal 2:
PortalProduct 1: Coca-Cola
PortalProduct 2: Man Utd
PortalProduct 3: Maplin Elec Ltd.
- We need to correlate these PortalProducts to a central list of Products.
- One Product can have 1-to-many PortalProducts
- The database is populated with around 10,000 PortalProducts
- The database is not populated with any Products. Products need to be added for each new PortalProduct that doesn't match an existing Product.
This must be implemented as a C# console application so that a) we can see the results when the correlate is run and b) so that we can ultimately run it on a task-schedule.
The developer must develop a text matching algorithm to correlate PortalProduct names with Product names (and create a product where there is no match). The emphasis is on the accuracy of the text matching algorithm. Speed is less important than [login to view URL] developer should have a mathematical mind and preferably has experience in developing mathematical text matching algorithms.
Examples of mathematical text matching algorithms that could be used (and potentially refined and combined) to meet our requirements are:
String metric
Locality-sensitive hashing
Needleman–Wunsch algorithm
Smith–Waterman algorithm
Levenshtein distance
Concept Search
Approximate matching with addition of regular expressions ability
Regular expressions for non-fuzzy (exact) matching
Metaphone
Soundex
Agrep
Plagiarism detection
[login to view URL]
Ideally the developer will already understand and have used some of these before and able to pick the best algorithm(s) for this application.
Nº del proyecto: #4645513
Sobre el proyecto
19 freelancers están ofertando un promedio de £190 por este trabajo
Hi, I have done similar task to map different securities. It is more easy to match the mapping in SQL Server database instead of looping in C#. I have 8.5 years experience in C# and SQL Server programming.
Hi, I (Myself a senior ASP.NET programmer using C# and VB) have a team having experience of more than 5 years in developing web and mobile applications. I have a team of expert programmers who write robust and bug-fre Más
I have done work in C#, SQL and applied the concepts in different projects and can do this project for you.
I have a good experience in developing algorithms for sofesticated projects.I have developed mathematical algorithms for solving a matrix,any polynomial function and ...
I have done programming for more than 4 years. I am an Algorithm and data structure specialist. I can provide you an accurate solution.
I did similar works. The last one just here and you can check it in my profile. I'm familiar with these kind of algorithms. Also, I have migrated all the document based data in my company to Dynamics CRM using similar Más
I believe I have already have made an accurate algorithm for your problem, combining some of the algorithms you listed. Please send me more examples, matches to detemine if I'm right.
