在C＃中匹配的模糊文本（句子/标题）

嘿，我正在使用Levenshteins算法来获取源和目标字符串之间的距离。

我也有从0到1返回值的方法：

/// 
 /// Gets the similarity between two strings. /// All relation scores are in the [0, 1] range, /// which means that if the score gets a maximum value (equal to 1) /// then the two string are absolutely similar /// 
 /// The string1. /// The string2. ///  public static float CalculateSimilarity(String s1, String s2) { if ((s1 == null) || (s2 == null)) return 0.0f; float dis = LevenshteinDistance.Compute(s1, s2); float maxLen = s1.Length; if (maxLen < s2.Length) maxLen = s2.Length; if (maxLen == 0.0F) return 1.0F; else return 1.0F - dis / maxLen; } 

但这对我来说还不够。 因为我需要更复杂的方式来匹配两个句子。

例如，我想自动标记一些音乐，我有原创歌曲名称，我有垃圾的歌曲，如超级，质量，像2007年，2008年等等…也有些文件只有http：//垃圾。 .thash..song_name_mp3.mp3 ，其他都很正常。 我想创建一个比现在更完美的算法..也许有人可以帮助我吗？

这是我目前的算法：

 /// 
 /// if we need to ignore this target. /// 
 /// The target string. ///  private bool doIgnore(String targetString) { if ((targetString != null) && (targetString != String.Empty)) { for (int i = 0; i < ignoreWordsList.Length; ++i) { //* if we found ignore word or target string matching some some special cases like years (Regex). if (targetString == ignoreWordsList[i] || (isMatchInSpecialCases(targetString))) return true; } } return false; } /// 
 /// Removes the duplicates. /// 
 /// The list. private void removeDuplicates(List list) { if ((list != null) && (list.Count > 0)) { for (int i = 0; i < list.Count - 1; ++i) { if (list[i] == list[i + 1]) { list.RemoveAt(i); --i; } } } } /// 
 /// Does the fuzzy match. /// 
 /// The target title. ///  private TitleMatchResult doFuzzyMatch(String targetTitle) { TitleMatchResult matchResult = null; if (targetTitle != null && targetTitle != String.Empty) { try { //* change target title (string) to lower case. targetTitle = targetTitle.ToLower(); //* scores, we will select higher score at the end. Dictionary