Building Language Resources from the Web

Web crawling, boilerplate removal, de-duplication and plagiarism detection.

IA161 Advanced NLP Course, Course Guarantee: Aleš Horák

Prepared by: Vít Suchomel

State of the Art


  1. Chapters 19 and 20 from C. D. Manning et al. "Introduction to Information Retrieval". Cambridge University Press, 2008.
  2. Pomikálek, Jan. "Removing boilerplate and duplicate content from web corpora." Dissertation thesis. Masaryk University, 2011.
  3. Hacohen-Kerner, Yaakov, Aharon Tayeb, and Natan Ben-Dror. "Detection of simple plagiarism in computer science papers." Coling, 2010.
  4. Potthast, M., Hagen, M., Goering, S., Rosso, P., and Stein, B. (2015). Towards data submissions for shared tasks: first experiences for the task of text alignment. Working Notes Papers of the CLEF, pages 1613–0073.
  5. 13th evaluation lab on uncovering plagiarism, authorship, and social software misuse
  6. Suchomel, Vít. "Better Web Corpora For Corpus Linguistics And NLP." Dissertation thesis. Masaryk University, 2020.

Practical Session task

Plagiators vs. plagiarism detectors

Either: Create 5 documents (with a similar topic) and 5 plagiarisms of these documents, 10 documents total. (For the sake of simplicity: A plagiarism cannot have more sources here.) The minimal homework.

  • 100 words <= document lenght <= 500 words
  • 20 % <= plagiarism content <= 90 %
  • File format: A POS tagged vertical consisting of structures doc with attributes author, id, class, source. Pair author, id is unique. Start with id = 1. Class is "original" or "plagiarism". Source is the id of the source (in the case of plagiarism) or the same as the id of the document (in the case of original).
  • A POS tagged vertical: 3 TAB separated columns: word, lemma (the base form of the word), POS/morphological tag.
  • Text processing pipelines for converting a text file to a 3-column vertical:
    • Czech: asteria04:/opt/majka_pipe/ | cut -f1-3 or a web interface (short documents only)
      • See an example below.
    • English: asteria04:/opt/treetagger_pipe/
  • For each plagiarism:
    • describe plagiarsim technique(s) used
    • which detection methods might be able to reveal it -- give reasons
    • which detection methods might not be able to reveal it -- give reasons
  • Submit a text file containing 10 documents according to the requirements + 1 text file describing techniques used and your estimation which detection techniques may or may not work.

Or: Select a detection algorithm and implement it in Python. The right homework if you want to learn something.

  • A basic detection script to extend: -- usage: python < training_data.vert
    • A bag of words + cosine similarity of word vectors approach is implemented in this script. (For the sake of simplicity: A plagiarism cannot have more sources here.)
    • You can modify the script to
      • use other input attributes than the word or a combination of attributes, e.g. the lemma or the morphological tag,
      • or implement other lexical/syntactic based detection approach, e.g. n-grams of words or Levenshtein's distance,
      • or implement other semantic based detection approach, e.g. the similarity of word2vec vectors.
  • Input format: A 3-column vertical, see above. training_data.vert
  • Output: One plagiarism per line: id TAB detected source id TAB real source id. Evaluation line: precision, recall F1 measure.
  • Your script will be evaluated using data made by others.
  • Describe which plagiarism detection technique(s) were implemented -- put it in a comment in the beginning of your script.
  • Submit the modified script (or your own script) with a short description in a comment. (The training set output of the script is not required.)

Examples of a source document and a plagiarism document

<doc author="Já První" id="1" class="original" source="1">
Dnes    dnes    k6eAd1
je      být     k5eAaImIp3nS
pěkný   pěkný   k2eAgInSc4d1    pěkný
den     den     k1gInSc4        den
!       !       k?
<doc author="Já První" id="2" class="plagiarism" source="1">
Dnes    dnes    k6eAd1
je      být     k5eAaImIp3nS
ale     ale     k9
pěkný   pěkný   k2eAgInSc4d1    pěkný
den     den     k1gInSc4        den
!       !       k?

How to produce the 3-column POS tagged vertical from a plaintext:

scp plagiarism.txt
ssh asteria04
cat ~/plagiarism.txt | /opt/majka_pipe/ | cut -f1-3 > ~/plagiarism.vert  #Czech
cat ~/plagiarism.txt | /opt/treetagger_pipe/ > ~/plagiarism.vert        #English
scp ./

How to run the sample detection script:

python2 < plagiarism.vert

Last modified 5 years ago Last modified on Sep 10, 2015, 1:41:58 PM

Attachments (3)