1fb72c0f-e3fa-4a14-8d6e-cd34c90a88a3.nupkg

054e0854-6c6f-4f74-b912-e53a2b54f530.png

Calculates Levenshtein distance and puts it relative to the longest string, so you get a **value between 0 and 1** that tells you how similar two strings are. You can use this whenever a 100% match is not feasible and a machine learning model is to expensive for the use case. 

  

I also added a normalization and sorting activity, that can be put upfront the string similarity calculation if you want to ignore any non-word characters and / or if you don't care in what order the strings are filled.

  

I use this to compare addresses from diffferent systems, as users from different systems often type in addresses kind of similar, but not exactly the same. A value above 0.7 is good enough for me, to validate whether addresses match. Every set of data needs to be analyzed separately. A lot of testing is helpful to find a good value. 

  

**Activities Details**

  

1\. **Compare two strings:** The core feature is the comparison of two strings and the return of a similarity value. 

  

2\. **Remove Non-Word Characters:** This feature involves eliminating any character from the text that doesn't contribute to its meaning. These may include punctuations, special symbols, numbers (unless they are relevant), and any other non-alphabetic characters. This process helps to simplify the text, making it easier to analyze and process.

  

3\. **Convert to Uppercase:** This feature translates all the letters in the text to uppercase. It is a commonly used method for normalizing text data, ensuring consistency across different inputs. This function can be particularly useful when case sensitivity is not relevant to the application, ensuring the text can be evaluated uniformly.

  

4\. **Sort the String Alphanumeric:** This feature involves organizing the content of a string in alphanumeric order. This is a type of sorting where both the numbers (0-9) and the letters (A-Z/a-z) in a string are arranged systematically.

First, all numbers are sorted in ascending order, followed by letters sorted in ascending order (typically, uppercase letters first, then lowercase). For example, the string 'b2a1C3' would become '123Cab'. Sorting the string alphanumeric can be beneficial in a variety of scenarios, such as enhancing data consistency, simplifying search and retrieval processes, and providing a standardized view of the data, especially when dealing with large amounts of text data.

Calculate the similarity of strings, e.g. Aa / Ab = 50%.

120b2c76-885b-47bd-8961-1948e171703d.png

MIT License Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

String Similarity Calculation