1 / 8

Yesha Gupta

Plagiarism detection. Yesha Gupta. String Matching Algorithms:. KMP LCSS Rabin-Karp fingerprints an algorithm of choice for multiple pattern search. Testing text file information:. 21 Lines Each line(treated as pattern) is of different length Max line size: 370

rafi
Download Presentation

Yesha Gupta

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Plagiarism detection Yesha Gupta

  2. String Matching Algorithms: • KMP • LCSS • Rabin-Karp fingerprints • an algorithm of choice for multiple pattern search

  3. Testing text file information: • 21 Lines • Each line(treated as pattern) is of different length • Max line size: 370 • Minimum line size: 85

  4. LCSS is performing very slowRabin Karp performed better than KMP Why? Efficient use of Hashing techniques

  5. KMP generated optimum output. Rabin Karp did not. Why? Because of fixed length patterns in a text

  6. Testing text file information: • 21 Lines • Each line(treated as pattern) is of same length

  7. Result of RabinKarp and KMP is the same Why? Each pattern has same length

  8. Execution time of RabinKarp is slightly better than KMP

More Related