dotnet add package Soenneker.Utils.String.Trie

Imagine you have two strings. Trie-based matching helps you figure out how similar they are by looking at the prefixes they share. Here's why it's handy:

Trie-based matching is straightforward. It helps identify common prefixes between two strings, providing an intuitive measure of similarity.

Whether a string is long or short doesn't throw off trie-based matching. It cares more about the common prefixes than the total length of the strings.

When you're dealing with lots of strings or large texts, trie-based matching is efficient. It quickly identifies common prefixes without getting bogged down by complicated calculations, making it a practical choice for large datasets.

string str1 = "hello";
string str2 = "hell";

double similarity = TrieStringSimilarityUtil.CalculateSimilarityPercentage(str1, str2); // 80