Method for determining the resemining the resemblance of documents

Abstract

A method for facilitating the comparison of two computerized documents. The method includes loading a first document into a random access memory (RAM), loading a second document into the RAM, reducing the first document into a first sequence of tokens, reducing the second document into a second sequence of tokens, converting the first set of tokens to a first (multi)set of shingles, converting the second set of tokens to a second (multi)set of shingles, determining a first sketch of the first (multi)set of shingles, determining a second sketch of the second (multi)set of shingles, and comparing the first sketch and the second sketch. The sketches have a fixed size, independent of the size of the documents. The resemblance of two documents is provided using a sketch of each document. The sketches may be computed fairly fast and given two sketches the resemblance of the corresponding documents can be computed in linear time in the size of the sketches.

Description

FIELD OF THE INVENTION

The present invention relates to the field of comparing data files residing on one or more computer systems, and more particularly to the field of determining the resemblance of documents.

BACKGROUND OF THE INVENTION

As is known in the art, computer users create and store data files as documents in computer systems. As is also known, these same computer users, for a variety of reasons, are often interested in determining the similarity of two documents.

One approach, for example, is to record samples of each document, and to declare documents to be similar if they have many samples in common. The samples could be sequences of fixed numbers of any convenient units, such as English words. Such a method requires samples proportional in size with the length of the documents.

Another approach to this problem is based on single word “chunks.” Such a method employs a registration server that maintains registered documents against which new documents can be checked for overlap. The method detects copies based on comparing word frequency occurrences of the new document against those of registered documents.

What is needed is a method to determine whether two documents have the same content except for modifications such as formatting, minor corrections, web-master signature, logo, etc., using small sketches of the document, rather than the full text.

SUMMARY OF THE INVENTION

In accordance with the present invention, a method of determining the resemblance of a plurality of documents stored on a computer network including loading a first document into a random access memory (RAM), loading a second document into the RAM, reducing the first document into a first set of tokens, reducing the second document into a second set of tokens, converting the first sequence of tokens to a first (multi)set of shingles, converting the second sequence of tokens to a second (multi)set of shingles, determining a first fixed size sketch of the first (multi)set of shingles, determining a second fixed size sketch of the second (multi)set of shingle, and comparing the first sketch and the second sketch. With such a method, computation of the resemblance of two documents is provided using a sketch of each document. The sketches may be computed fairly fast and given two sketches the resemblance of the corresponding documents can be computed in linear time in the size of the sketches.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an exemplary computer network that may employ the present invention;

FIG. 2 is a block diagram of the random access memory (RAM) of FIG. 1 ;

FIG. 3 is a flow chart illustrating the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

Referring to FIG. 1 , an exemplary computer network is shown to include three end systems 12 , 14 , and 16 . Each of the end systems is shown as having a random access memory (RAM), a storage unit, and a user interface to a user. Specifically, end system 12 contains a RAM 18 , a storage unit 20 , a user interface 22 , and a user 24 ; end system 14 contains a RAM 26 , a storage unit 28 , a user interface 30 , and a user 32 ; end system 16 contains a RAM 34 , a storage unit 36 , a user interface 38 , and a user 40 . The end systems 12 , 14 , and 16 are further shown connected to a network 42 . The network 42 is further shown to include several network systems 44 . The network systems 44 provide a means for the end systems 12 , 14 , and 16 to transfer all types of information. One type of information residing in each of the end systems may be data files generally referred to as documents. These documents may reside, for example, in the RAM and/or storage unit of any of the end systems.

Referring to FIG. 2 , the end system 12 of FIG. 1 is shown in greater detail. An exemplary document 46 is shown to reside in the RAM 18 . The exemplary document 46 may, for example, have resided on the storage unit 20 , and been loaded into the RAM 18 by the end system 12 . The RAM 18 is further shown to include a program space 48 wherein the present invention may, for example, reside. As will be described in detail below, a user 24 may want to compare the document 46 with some other document within the RAM 18 , or some other document residing in a RAM and/or storage unit of some other end system accessible through the network 42 of FIG. 1 .

In general, each document, 46 for example, may be viewed as a sequence of tokens. Tokens may be characters, words, or lines. The present invention assumes that one of several parser programs that are known in this art is available to take an arbitrary document and reduce it to a canonical sequence of tokens. In the present invention, canonical means that any two documents that differ only in formatting or other information that is chosen to be ignored, e.g. punctuation, html commands, capitalization, will be reduced to the same sequence. Thus, the present invention will refer to any document as a canonical sequence of tokens.

The first need is to associate to every document D a set of subsequences of tokens S(D,ω) where ω is a parameter defined below.

A contiguous subsequence contained in D is referred to as a shingle. Given a document D one can associate to it its ω-shingling defined as a multiset (as referred to as a bag) of all shingles of size ω contained in D. For example, a 4-shingling of

(a, rose, is, a, rose, is, a, rose)

is the bag

{(a, rose, is, a), (rose, is, a, rose), (is, a, rose, is), (a, rose, is, a), (rose, is, a, rose)}.

At this point there are at least two ways to proceed. A first option keeps more information about the document. A second option is more efficient.

In the first option, by labeling each element of a ω-shingling with its occurrence number its labeled ω-shingling is obtained, referred to as set S(D, ω). Using document D as an example, the set S(D, ω) would be

{(a, rose, is, a, 1), (rose, is, a, rose, 1), (is, a, rose, is, 1),

(a, rose, is, a, 2), (rose, is, a, rose, 2)}.

Using the second option, the set S(D, ω) is taken to be the set of shingles in D. Thus, staying with document D as an example, the set S(D, ω) would be

{(a, rose, is, a), (rose, is, a, rose), (is, a, rose, is)}.

The present invention describes a use of resemblance for determining whether two documents are roughly the same. Resemblance is a number between 0 and 1, defined precisely below, such that when the resemblance is close to 1 it is likely that the two documents are roughly the same. As will be fully described below, to estimate the resemblance of two documents it suffices to keep for each document a sketch of a few hundred bytes. In a preferred embodiment three to eight hundred bytes suffices. The sketches can be computed fairly fast (linear in the size of the documents) and given two sketches the resemblance of the corresponding documents can be computer in linear time in the size of the sketches.

The resemblance r for a shingle size ω of two documents A and B is defined as $$ r ω ⁢ ( A , B ) = &LeftBracketingBar; S ⁢ ( A , ω ) ⋂ S ⁢ ( B , ω ) &RightBracketingBar; &LeftBracketingBar; S ⁢ ( A , ω ) ⋃ S ⁢ ( B , ω ) &RightBracketingBar;

Hence, the resemblance is some number between 0 and 1, and for any shingle size r ω (A, A)=1, i.e., A resembles itself 100% for any size.

By way of another example, if

A=(a, rose, is, a, rose, is, a, rose)

and

B=(a, rose, is, a, rose, is, a, flower, which, is, a, rose)

then under the first option above, A resembles B 70% for shingle size 1, 50% for size 2, 30% for size 3, etc. Under the second option above, A resembles B 60% for size 1, 50% for size 2, 42.85% for size 3, etc.

It should be pointed out that even under the first option above, if A resembles B 100% for shingle size 1, it only means that B is an arbitrary permutation of A; for larger sizes if A resembles B 100% it is still the case that B is a permutation of A but only certain permutations are possible, e.g., (a, c, a, b, a) resembles (a, b, a, c, a) 100% for size 2. To make resemblance more sensitive to permutation changes a larger size must be taken; on the other hand a large size is possibly over sensitive to small alterations since the change in one token affects ω tokens.

It should also be noted that resemblance is not transitive, but neither is the idea of “roughly the same;” for example, consecutive versions of a paper might well be “roughly the same,” but version 100 is probably quite far from version 1.

In order to estimate the resemblance, one fixes a shingle size ω, and lets Ω be the set of all labeled (for the first option above) or unlabelled (for the second option above) shingles of size ω. Without loss of generality one can assume the Ω is totally ordered. Therefore, fix a parameter s. For each set WΩ define MIN 2 (W) as

the set of the smallest s element in W, if |W|≳s;

MIN s (W)={

W, otherwise.

where “smallest” refers to the order defined on Ω.

If π:Ω→Ω is a permutation chosen uniformly as random and M(A)=MIN s (π(S(A, ω))) and M(B)=MIN s (π(S(B, ω))), the value $$ &LeftBracketingBar; MINs ⁢ ( M ⁢ ( A ) ⋃ M ⁢ ( B ) ) ⋂ M ⁢ ( A ) ⋂ M ⁢ ( B ) &RightBracketingBar; &LeftBracketingBar; MINs ⁢ ( M ⁢ ( A ) ⋃ M ⁢ ( B ) ) &RightBracketingBar;

is an unbiased estimate of the resemblance of A and B. Proof of this may be found in Appendix I.

Given a document D, the random set MIN s (π(S(D, ω))) is referred as the sketch of document D.

To produce a sample a random permutation is needed. The total size of a shingle is relatively large. For example, if shingles are made of seven words each, a shingle will contain about 40-50 bytes on average. Hence, to reduce storage one first associates each shingle a (shorter) id of l bits, and then use a random permutation π of the set {0, 1, . . . 2 l }. This illustrates a trade-off, i.e., if one takes l large then one can ensure that most/all id's will be unique, but one will have to pay a storage penalty. On the other hand, a large number of collisions will degrade the estimate as explained subsequently.

Let ƒ:Ω→{0, 1, . . . 2 l −1} be the function that produces this id. Once ƒ fixed, what one is estimating is $$ r ω , f ⁢ ( A , B ) = &LeftBracketingBar; f ⁢ ( S ⁢ ( A , ω ) ) ⋂ f ⁢ ( S ⁢ ( B , ω ) ) &RightBracketingBar; &LeftBracketingBar; f ⁢ ( S ⁢ ( A , ω ) ) ⋃ f ⁢ ( S ⁢ ( B , ω ) ) &RightBracketingBar;

rather than $$ r ω ⁢ ( A , B ) = &LeftBracketingBar; S ⁢ ( A , ω ) ⋂ S ⁢ ( B , ω ) &RightBracketingBar; &LeftBracketingBar; S ⁢ ( A , ω ) ⋃ S ⁢ ( B , ω ) &RightBracketingBar; .

Fix an arbitrary set S ≅ Ω of size n. Then if ƒ is chosen uniformly at random $$ E ⁢ ( &LeftBracketingBar; f ⁢ ( S ) &RightBracketingBar; ) = 2 l ⁢ ( 1 - ( 1 - 1 2 l ) n ) = n - ( &AutoLeftMatch;   2 n &AutoRightMatch; ) ⁢ 1 2 l + ( &AutoLeftMatch; 3 n &AutoRightMatch; ) ⁢ 1 2 2 ⁢ l + …

If λ is substantially larger than log n then $$ E ⁡ ( &LeftBracketingBar; f ⁢ ( S ) &RightBracketingBar; ) ≈ n - ( &AutoLeftMatch;   2 n &AutoRightMatch; ) ⁢ 1 2 l ,

in other words, in this case one can ignore the effect of multiple collisions, that is, three or more distinct elements of S having the same image under ƒ. Furthermore, it can be argued that the size of ƒ(S) is fairly well concentrated. Specifically, $$ Pr ( &LeftDoubleBracketingBar; f ⁡ ( S ) &RightBracketingBar; - E ( &AutoRightMatch; ⁢ &LeftBracketingBar; f ⁡ ( S ) &RightDoubleBracketingBar; > λ ⁢ n ) < ⅇ - λ 2 .

This leads to the fact that with high probability over choices of ƒ $$ &LeftBracketingBar; r w , f ⁡ ( A , B ) - r w ⁡ ( A , B ) &RightBracketingBar; < &LeftBracketingBar; S ⁡ ( A , w ) ⋃ S ⁡ ( B , w ) &RightBracketingBar; 2 l - 1 .

In the preferred embodiment, ƒ is not totally random, and the probability of collision might be higher. A preferred choice is to take Rabin's fingerprinting function, in which case the probability of collision of two strings s 1 and s 2 becomes max(|s 1 |,|s 2 |)/2 L1 , where |s 1 | is the length of the string s 1 in bits.

By way of example, to cluster World Wide Web (WWW) documents, the size of a typical set of shingles is about 500 and the length in bits of a shingle is about 200. Thus, taking λ=24 would lead to a fairly minimal deterioration of the estimate but taking λ=16 is borderline. On the other hand, if one intends to cluster a large set of WWW documents it might be advantageous to take a larger λ to avoid spurious collisions.

To produce a sample one needs a random permutation pi:{0, 1, . . . , 2}-→{0, 1, . . . ,2 }. In practice one may prefer implementing X(f(.)) rather than f(.). One preferred example to do this is to fingerprint each sequence of tokens using a fingerprinting method such as that described by M. O. Rabin in “Fingerprinting by Random Polynomials,” Center for Research in computing Technology, Harvard University, Report TR-15-81, 1981. Briefly, fingerprints are short tags for larger objects. Fingerprints have the property that if two fingerprints are different then the corresponding objects are certainly different and there is only a small probability that two different objects have the same fingerprint. When two objects have the same fingerprint it is referred to as a collision.

For the purposes of the present invention rather than fingerprint a string as such, one first extends it with a suitable number of nulls so that fingerprints will appear “more random.” For example, without this extension by nulls, two strings that differ only in the last letter will differ only in the last eight bits of their fingerprint.

Since collisions are of little importance in the present invention (they would only lead to overestimates of the resemblance), a preferred embodiment may use 32 bit fingerprints or even 24 bit fingerprints. For efficiency, it is preferred that, rather than keep the set MIN s (π(S(D, ω))), the MIN s of the set of fingerprints that are 0 mod M for a chosen M are kept.

In the preferred embodiment, for the first option above, the set MIN s should be kept in a heap, with the maximum at the root. A heap is an efficient data structure for representing a priority queue, i.e., a data structure for representing a set of prioritized elements, in which it is efficient to insert a new element of the set, and also efficient to select and remove whatever element of the set has the maximum priority. A new fingerprint should replace the current root whenever it is smaller and then one should re-heapify. The expected number of times this happens is 0(s log(n/M)), where n is the number of tokens in the document and the cost is 0(s log s); this is because the probability that the k'th element of a random permutation has to go into the heap is s/k. Thus, the expected total cost for the heap operations is 0(s log s log(n/M)).

For the second option described above, a balanced binary search tree is kept. Examples are AVL trees, red-black trees, randomized search trees, and skip lists. The cost is still 0(s log s log(n/M)) but the constant factor is probably larger.

The larger the sample, the more accurate the results are likely to be. But larger samples result in larger storage costs. The number of common shingles in the sample has a hypergeometric distribution. Since the size of the sample is usually much smaller than the size of the document, the hypergeometric distribution may be estimated by a binomial distribution. Under this approximation, if r is the resemblance, then the probability that the estimate is with [r−ε, r +ε] is given by $$ p ⁡ ( s , r , ε ) = ∑ s ⁡ ( r - ε ) ≤ k ≤ s ⁡ ( r - ε ) ⁢   ⁢ ( s k ) ⁢ r k ⁡ ( 1 - r ) s - k .

Computing the fingerprints is typically fast even if each shingle is done from scratch. The total cost in this case is 0(wn) where the 0 notation hides the width of the token. However, a factor of w may be gained if one takes advantage of the fact that here we are computing the fingerprint of a “sliding window,” particularly if the window's width in bytes is fixed or within a narrow range. This is automatic if the tokens have fixed width. Otherwise, tokens may be defined to have a small maximum width and then padded as necessary to get this effect.

For example, one may define a word to have at most 8 bytes. Longer words may be viewed as the concatenation of several words. When fingerprints are computed shorter words may be padded to 8 bytes.

If the multiplicity of shingles is recorded in the sketch, a check must be made for the number of times each shingle was encountered before. This may be done by fingerprinting it and then searching a hash table. Once the proper label is decided, a second fingerprint needs to be computed. Some care is needed to avoid too much dependence among fingerprints of the same shingle with different labels.

If the multiplicity of shingles is ignored in the sketch, the frequency checks are avoided altogether, computations are avoided altogether, but a binary search tree rather than a heap needs to be kept to insure that the same value is not inserted twice.

We now describe how to estimate the resemblance of two documents, given their sketches. It is preferred that the sketch be stored as a list sorted in increasing order. Then all one needs to do is to merge-sort the two sketches removing duplicates, and count how many duplicates were encountered within the first s outputs. This procedure requires O(s) time.

Referring now to FIG. 3 , a flow diagram of the present invention begin at step 100 wherein an end system loads a first document into its random access memory (RAM). At step 102 , the end system loads a second document into its RAM. At step 104 , the first document is parsed into a first sequence of tokens. At step 106 , the second document is parsed into a second sequence of tokens. Next, at step 108 , the first set of tokens is reduced to a first bag of shingles. At step 110 , the second set of tokens is reduced to a second bag of shingles. Next, at step 112 , the first bag of shingles is reduced to a first fixed-size sketch, and at step 114 , the second bag of shingles is reduced to a second fixed-size sketch At step 116 , the resemblance of the first document and the second document are determined by comparing the first sketch and the second sketch.

It should also be noted that the present invention applies also to comparing more than two documents. For m documents, evaluating all resemblances takes 0(m 2 s) time. However, a technique referred to as “greedy clustering” may be used. Specifically, a set of current clusters (initially empty) is kept and processes the sketches in turn. For each cluster a representative sketch is kept. If a new sketch sufficiently resembles a current cluster then the sketch is added to it; otherwise a new cluster is started. In practice every fingerprint, if sufficiently long, probably belongs only to a few clusters. With this assumption, if for each fingerprint encountered it is remembered to which clusters it belongs and the fingerprints are stored in a hash table, the entire procedure may be implemented in O(ms) time. As a representative sketch, the s most popular fingerprints in a cluster may be taken, or just the first member of the cluster.

An alternative clustering method could be to find for each fingerprint all the sketches where it belongs. Then for each two sketches that have a common fingerprint compute the actual resemblance of the corresponding documents. This method may be advantageous when most clusters contain a single document. It is again important that fingerprints be sufficiently long to avoid spurious collisions.

Having described a preferred embodiment of the invention, it will now become apparent to those skilled in the art that other embodiments incorporating its concepts may be provided. It is felt therefore, that this invention should not be limited to the disclosed invention, but should be limited only by the spirit and scope of the appended claims. $$ Appendix    I _ $$ MIN s ⁡ ( M ⁡ ( A ) ⋃ M ⁡ ( B ) ) = MIN s ( π ⁡ ( S ⁡ ( A , ω ) ) ⋃ ( π ⁡ ( S ⁡ ( B , ω ) ) ) = MIN s ⁡ ( π ⁡ ( S ⁡ ( A , ω ) ⋃ S ⁡ ( B , ω ) ) ) $$ Let ⁢   ⁢ α ⁢   ⁢ be ⁢   ⁢ the ⁢   ⁢ smallest ⁢   ⁢ element ⁢   ⁢ in ⁢   ⁢ ( &AutoRightMatch; ⁢ π ⁡ ( S ⁡ ( A , ω ) ⋃ S ⁡ ( B , ω ) ) .   ⁢ Then $$ Pr ( α ∈ M ⁡ ( A ) ⋂ M ⁡ ( B ) = Pr ( π - 1 ⁡ ( α ) ∈ S ⁡ ( A , ω ) ⋂ S ⁡ ( B , ω ) ) = &LeftBracketingBar; S ⁡ ( A , ω ) ⋂ S ⁡ ( B , ω ) &RightBracketingBar; &LeftBracketingBar; S ⁡ ( A , ω ) ⋃ S ⁡ ( B , ω ) &RightBracketingBar; = r ω ⁡ ( A , B ) .

Since this can be repeated for every element of MIN s (π(S(A,ω)∪S(B,ω))) the claim is proved.

Claims

1. A method of comparing a plurality of documents stored on a computer comprising the steps of:loading a first document into a random access memory (RAM); loading a second document into the RAM; reducing the first document into a first sequence of tokens; reducing the second document into a second sequence of tokens; converting the first sequence of tokens to a first (multi)set of shingles; converting the second sequence of tokens to a second (multi)set of shingles; determining a first sketch of the first (multi)set of shingles; determining a second sketch of the second (multi)set of shingles; and comparing the first sketch and the second sketch.