How to detect the "fingerprint" of an article or a long string?

Hi,

It just occurs to me that since some fingerprint reader can quickly find out if two fingerprints are similar or not, can we treat every article as a fingerprint and detect if any two of many articles are similar or not? In other words, how to find the uniqueness or pattern of a few words of a long string which can represent as much of the original string as possible?

Any suggestions or ideas are appreciated!
wsyyAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

andrevanzuydamCommented:
This article covers pretty much what you want to know

http://www.catalysoft.com/articles/StrikeAMatch.html

You may want to read the introduction at the top of the page or just dive into the theory.
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
TomasPCommented:
You could build a dictionary table (hashed) of interesting words or phrases in one document, (ignore common usage words) then do the same for the second document and use the number of collisions as a way to see where the same word/phrases are used. By weighting some words/hashes differently you can create a way to measure sameness. To get fancier you can use some fuzzy matching/logic
0
d-glitchCommented:
Many of the required ideas would also be used for plagiarism detection:

     http://en.wikipedia.org/wiki/Plagiarism_detection
0
phoffricCommented:
Here is an EE article to review:
A Guide to Approximate String Matching
0
gordon_vt02Commented:
You can generate a unique "fingerprint" for each document by generating a hash code for it with an algorithm like MD5.  This will not help with near-duplicate detection, only exact dupes but it one of the simplest possible solutions.  You may also want to research Latent Semantic Indexing, which does exactly what you want but tends to require some pretty sophisticated software and, depending on the size of your document set, fairly beefy hardware as well.

http://en.wikipedia.org/wiki/Latent_semantic_indexing
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Java

From novice to tech pro — start learning today.

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.