How does the search algorithm work?

This is a comparison of documents with each other:

A text searchable version is generated for each document in the database. In this text version, the algorithm focuses on similar or paraphrased sections of text and evaluates the degree of agreement across the entire shared document database, including Internet resources.
Texts in Czech, English and Slovak are compared, the condition is that they have at least a few sentences or paragraphs (in very small files there is not enough text for their analysis and finding similarities).
Before the result is presented to the user, those documents that overlap only in passages that are the same as for previously found sources are omitted. Practically, for example, it is a citation of a certain law in another hundred final theses and documents on the Internet. If there are less than 10 similar sources, they will all be displayed without omission.
The user is shown the most relevant documents that have a significant similarity to the document being searched, and the percentage of that similarity.

If students copy from each other, the system evaluates their answers as similar and displays the percentage of similarity. You can find more on this topic in the question How works compare similarities?

Tip: It doesn't pay to copyAs a warning mechanism for students, it is important that the submitted works are archived in the IS AMBIS and can be examined repeatedly. For example, at any time later with another improved version of the algorithm. Remember that copying time can sometimes mean a lot of extra work to repair your reputation. The developers of IS AMBIS are gradually improving the algorithm and the database of searched documents is constantly being expanded by other sources. What systems don't reveal today doesn't mean they won't reveal tomorrow.