Analyze the similarity between the two documents using the Naive Rabin-Karp Algorithm
Word Count: 0
The documents are very different. They probably don't share much content.
The data are cleaned and only unique strings per document are processed to avoid redudancy.
0 number of strings in the intersection set.
0 number of strings in union set.
Similarty percentage are computed using Jaccard Similarity.