Question

我在数据库中有一个学院(学校模式)清单,我有用户投入,决定哪个学校将用户连接起来。

问题在于,人类是可以的。因此,他们不是迈阿密大学,而是可以打造迈阿密大学或波士顿哥勒大学,而不是波士顿学院。

I need to be able to find these schools despite these mistakes and at least provide the user with a list of similar school names if a definite match does not exist. I do not want to use something like Sphinx or any full-text standalone search engine because this search only happens at registration and the strings are small.

对解决办法的任何想法?

事先感谢gu。

Answer 1

我使用MySQL. 。在让用户减少可能配对的菜单和“加速新的”行动方面做得很好。

Answer 2

您可以查到 text gem ,尽管我不认为这有助于“Boston-College”/“Boston College”等事务。这些类型的错误范围相当大;我不敢确定如何处理这些错误的最佳方式。

Answer 3

我的用词是:基于以下答案的标语:。虽然它可能更适合不同的长度限制。

#Returns between 0 and 1 based on how close two strings are
def strikematch(str1, str2)
  str1.downcase! 
  pairs1 = (0..str1.length-2).collect {|i| str1[i,2]}.reject {
    |pair| pair.include? " "}
  str2.downcase! 
  pairs2 = (0..str2.length-2).collect {|i| str2[i,2]}.reject {
    |pair| pair.include? " "}
  union = pairs1.size + pairs2.size 
  intersection = 0 
  pairs1.each do |p1| 
    0.upto(pairs2.size-1) do |i| 
      if p1 == pairs2[i] 
        intersection += 1 
        pairs2.slice!(i) 
        break 
      end 
    end 
  end 
  (2.0 * intersection) / union
end

友情链接