Finding groups of similar strings in a large set of strings

by

Another popular method is to associate the strings by their Jaccard index. Start with http://en.wikipedia.org/wiki/Jaccard_index.

Here’s a article about using the Jaccard-index (and a couple of other methods) to solve a problem like yours:

http://matpalm.com/resemblance/

More Related Contents:

  1. Algorithms vs OOP [closed]
  2. Reverse the ordering of words in a string
  3. What string similarity algorithms are there?
  4. Algorithm to find multiple string matches
  5. Find the first un-repeated character in a string
  6. Undo/Redo implementation [closed]
  7. Approximate string matching algorithms
  8. Word comparison algorithm
  9. Complexity of absolute difference and sum
  10. What is tail recursion?
  11. Algorithm for finding the fewest rectangles to cover a set of rectangles without overlapping
  12. Getting the closest string match
  13. How to compute Discrete Fourier Transform?
  14. Difference between Big-O and Little-O Notation
  15. Efficient list intersection algorithm
  16. Rounding to an arbitrary number of significant digits
  17. search for interval overlap in list of intervals?
  18. robust algorithm for surface reconstruction from 3D point cloud?
  19. 3D Least Squares Plane
  20. Is there ever a good reason to use Insertion Sort?
  21. Shortest distance between points algorithm
  22. Amortized complexity in layman’s terms?
  23. In Order Successor in Binary Search Tree
  24. Coin changing algorithm
  25. What is the advantage to using Bloom filters?
  26. algorithm for index numbers of triangular matrix coefficients
  27. Search a sorted 2D matrix [duplicate]
  28. Why use binary search if there’s ternary search?
  29. Algorithm for reflecting a point across a line
  30. What is the most efficient way to encode an arbitrary GUID into readable ASCII (33-127)?

Leave a Comment