Highlight non-overlapping contiguous character passages shared by two documents without presenting the result as a plagiarism verdict.
The frame below runs the same code as this page, in the reader's own browser. Nothing is sent to us, and nothing is sent to you.
Pick a dark background and the text and panels follow it, so the frame stays readable on a dark page.
A rolling dynamic-programming table finds the longest common substring, masks that span in both documents, and searches again for at most 100 iterations. Coverage is measured in characters and averaged across the two document lengths, while the default 20-character threshold suppresses shorter fragments.
Source: The quick brown fox jumps over the lazy dog in the park. Comparison: A fast brown fox jumps over the lazy dog at the zoo.
Text: brown fox jumps over the lazy dog Source start: 9 Source end: 44 Comparison start: 6 Comparison end: 41
Editors locate copied sentences between revisions, maintainers find README boilerplate, and support analysts identify repeated error-message fragments across logs.