<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A template-independent approach for information extraction in real estate documents</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nicola Landro</string-name>
          <email>nicola.landro@digitiamo.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gabriele Destro</string-name>
          <email>gabriele.destro@digitiamo.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stefano Taverni</string-name>
          <email>stefano.taverni@digitiamo.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ignazio Gallo</string-name>
          <email>ignazio.gallo@uninsubria.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Question Answering, Information Retrieval, Real Estate, Scraping</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Digitiamo</institution>
          ,
          <addr-line>Via Giuseppe Piermarini, 26, Varese, 21100</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Insubria</institution>
          ,
          <addr-line>Via J.H. Dunant 3, Varese, 21100</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Workshop Proce dings</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Business corporations manage tons of unstructured data daily, such as PDFs and websites. Recent advances in the deep learning field help find insight from this unstructured information. New models leverage the power of the Transformer architecture to accomplish natural language understanding tasks on these data, jointly using the raw image and its text content or directly the image without OCR. We propose an extraction pipeline that employs question-answering models to get insight from unstructured data, allowing fast and eficient information retrieval from diferent sources. We show an application of this technique to a specific set of documents and how we can scale this infrastructure to diferent types of records. Our solution can efectively handle large document corpora robustly, helping corporations exploit all the power coming from their data.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>Recent deep learning models significantly increase the</title>
        <p>
          eficiency of document analysis. In particular, the
Transformers model [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] excels in a variety of text- and
visualbased tasks, such as ChatGPT (recently used in financial
velop new algorithms and enhance existing ones, as well
as to improve data retrieval.
        </p>
        <p>
          Recent difuser algorithms [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] appear to achieve better
results today, and as with convolutions and
transformers, they may become the state of the art in other
subtasks such as document retrieval, but for the time being,
transformers remain the state of the art in document
extraction.
        </p>
        <p>
          Language models based on transformers are highly
efective for text embedding, such as Sentence Bert [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ],
which outperforms convolutional approaches such as
Kim [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] or not such as Word2Vec [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and Glove [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          Also, the NER (Named Entity Recognition) problems
can be covered by Bert [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], with that model we can extract
tokens from a text that represents a particular entity.
nized by CINI, May 29–31, 2023, Pisa, Italy
∗Corresponding author.
(I. Gallo)
but instead of using a Bert-like [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] model or Bart [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]
general purpose and finetuned on documents we want
to use question-answering models.
        </p>
        <p>
          The T5 [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] Italian model is a multi-task text model
that can be used for text summarization [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] and many
ing a more generic method to extract specific information
by documents that can be configured by setting a series of
questions and keywords that extract precise information
without mandatory retraining of deep models.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Proposed Approach</title>
      <sec id="sec-2-1">
        <title>The proposed method(Fig. 1) starts from a web scraping pipeline that reaches to obtain documents and other</title>
        <p>To extract text from documents OCR (Optical Char- other tasks, we select it for question answering by
reach2.1. Scraping</p>
      </sec>
      <sec id="sec-2-2">
        <title>In order to obtain a satisfactory database, it is first nec</title>
        <p>essary to build a dataset from scratch that contains an
1https://www1.agenziaentrate.gov.it/servizi/geopoi_omi/index.php
2https://pvp.giustizia.it/pvp/it/homepage.page
The information extraction pipeline is tailored to specific
documents, namely businesses’ semi-annual reports. The
algorithm starts by adding an OCR layer to the original
document thanks to o c r m p y p d f 3, a Python library that
takes care of rasterizing, performing OCR, and saving the
3https://github.com/ocrmypdf/OCRmyPDF
result back to PDF format. This new document is then Table 1
read in memory using an extended version of c a m e l o t 4, Execution time of diferent OCRs calculated by generating
a PDF table extraction utility written in Python. c a m e l o t some random document with 1000 characters.
exposes its internal API to handle PDFs manipulation and OCR CPU time (s) GPU time (s)
layout reading. This API has been extended to support,
in addition to table reading, horizontal and vertical text Tesseract 0.71
extraction. A set of query functions has been added to al- EasyOCR 0.89 0.1
low eficient information retrieval, like extracting text in
range, extracting words at a specific location, matching
lines with a specific set of words, and extracting text in In the second step of the conversion, the text is split
column format. Once a PDF is loaded as raw text in mem- into sentences using a sentence segmentation process
ory, the information extraction phase takes place. An provided by a convolutional neural network based on
extractor is defined as an atomic information searcher, word2vec and GloVe 5. This step leads to the
generawhich is a single class specialized in the retrieval and tion of sentences that will be processed for correct
incleaning of chunks of text. A set of ad hoc extractors is formation retrieval. The sentence segmentation process
created to perform an exhaustive search of all the infor- defines semantically relevant sentences in the context
mation. Since documents might have several formats, an from which the desired information can be retrieved. The
extractor for each document type is defined to retrieve next step after sentence splitting is the application of a
the same information but with diferent queries. For each mapping algorithm that retrieves the desired information
PDF, the whole set of extractors is executed to retrieve from the sentences by searching for relevant words and
as much information as possible. Since more than one contemplating the results found by matching regular
exextractor might return successfully, a majority voting pressions in a neighbourhood of n words from the
matchphase ensures that only one among the valid extractor is ing index. This ensures that part of the irrelevant values
used. In the case of a tie, each extractor has a reliability is filtered out by the first extraction layer. Subsequently,
score that determines its accuracy, and only the most the relevant values for each sentence are entered into a
accurate is chosen. list related to the reference sentence and mapped into
a dictionary by the key-value structure, where the keys
are represented by the sentences that possibly contain
2.3. Document extraction Deep searched values and as values the list of values contained
Creating a scalable model with an algorithmic approach in the sentence. It is noticeable that retrieved values
is a challenging task, as documents containing the de- here can present some inconsistencies, as pattern
matchsired information often have no pattern or similar regular ing has an inherent limitation related to the language
patterns. For this reason, we present an approach that property. From this step, artificial intelligence comes
combines a pattern-matching algorithm and an artificial into play, with a further layer consisting of a fine-tuned
intelligence algorithm to efectively scale data extraction T5 transformer for question answering and trained for
from documents. the Italian language 6. The transformer makes it
pos</p>
        <p>The algorithm in detail implements a first part, or text sible to search for values in the filtered sentences and
extractor, comprising two OCRs and one extractor to then retrieve the data having as input the keys of the
retrieve text from documents. This first part of the algo- dictionary mapped in the previous step, guaranteeing a
rithm can recognise pdf documents. Where a document second skimming of irrelevant data and checking that the
has no scanned text, the PDF Reader (Fig. 1) retrieves the value retrieved from each sentence is consistent with the
text. Where the first extractor does not find text one of values retrieved from the text. To further improve the
two OCR engines, Tesseract and EasyOCR, comes into results, an adjacency check to remove repeated values
play. Both have advantages and disadvantages. Tesser- was implemented on the strings, which discards strings
act has about 94% accuracy in identifying numbers, and with the same values if their index is equal to n +1 where
98% accuracy in identifying letters, with an image-to-text n is the index of the sentence under consideration. In
conversion, instead EasyOCR has an accuracy of 98% in this way, the algorithm can return the sentences with
identifying numbers and 95% in identifying letters, with results filtered on the text with their relative values. In
an image-to-text. Another important diference is that the case of documents concerning the real estate market,
EasyOCR can use GPU; so we decide to use Tesseract the need to calculate the total square footage for each
(that has more accuracy on most of the text) when we run property led to the integration of a final layer that checks
scripts on CPU, while we use EasyOCR on GPU devices by means of regular expressions and pattern matching
to speedup the works 1. whether the values in the text report a total quantity,
4https://camelot-py.readthedocs.io/en/master/
5https://spacy.io/models/it#it_core_news_lg
6https://huggingface.co/it5/it5-base-question-answering
calculating the value if this is not returned by the first
check. The algorithm is being improved by implementing
an AI Named Entity Recognition module and a second
transformer-based module that exploits sentence
similarity logic on the tokenization of words. The idea would
allow considerable improvements in terms of accuracy
and completeness in handling the information sought
without having to resort to pattern matching and regular
expressions layers.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Dataset and Experiments</title>
      <sec id="sec-3-1">
        <title>The dataset used involves a batch of around 60K docu</title>
        <p>ments. We run the pure algorithmically extraction phase
on the entire dataset. The machine used for the
experiments is equipped with 20 CPUs at 3.50GHz, 128GB of
RAM, running Ubuntu 7 with kernel 4 . 4 . 0 - 1 7 0 - g e n e r i c .
Table 2 shows the experimental results. Apart from 542
unprocessable documents (they are encrypted, or they are
not PDFs), we successfully parsed 17 929 PDFs, extracting
all the relevant parts. The remaining 41 468 documents
turned out to be invalid relations or relations with an
unrecognized format. A manual investigation shows that
less than 5% are false negatives. As a side note, the
experiment required about 7 days of full computation, taking
into account the overhead introduces by storing the OCR
ifles and the extracted information on an external cloud
provider.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>With the purely algorithmic approach, we just reach to
extract any information from data from documents with
high precision, but it does not scale quickly to others
document formats. The deep proposed approach is the
ifrst idea to scale document extraction information to all
documents and start to fill the gap between Deep Neural
models and this research field.
7https://ubuntu.com/</p>
    </sec>
    <sec id="sec-5">
      <title>A. Online Resources</title>
      <sec id="sec-5-1">
        <title>We provide an HuggingFace Space that will be published</title>
        <p>if accepted.X</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , Ł. Kaiser,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>30</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Dowling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Lucey</surname>
          </string-name>
          ,
          <article-title>Chatgpt for (finance) research: The bananarama conjecture</article-title>
          ,
          <source>Finance Research Letters</source>
          (
          <year>2023</year>
          )
          <fpage>103662</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P.</given-names>
            <surname>von Platen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Patil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lozhkov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cuenca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lambert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Rasul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Davaadorj</surname>
          </string-name>
          , T. Wolf, Diffusers:
          <article-title>State-of-the-art difusion models</article-title>
          , https:// github.com/huggingface/diffusers,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Reimers</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gurevych</surname>
          </string-name>
          ,
          <article-title>Sentence-bert: Sentence embeddings using siamese bert-networks</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics</source>
          ,
          <year>2019</year>
          . URL: https: //arxiv.org/abs/
          <year>1908</year>
          .10084.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Convolutional neural network for sentence classification</article-title>
          ,
          <source>Master's thesis</source>
          , University of Waterloo,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          , G. Corrado,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Eficient estimation of word representations in vector space</article-title>
          ,
          <source>arXiv preprint arXiv:1301.3781</source>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pennington</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          , C. Manning, GloVe:
          <article-title>Global vectors for word representation</article-title>
          ,
          <source>in: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Doha, Qatar,
          <year>2014</year>
          , pp.
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          . URL: https://aclanthology.org/ D14-1162. doi:
          <article-title>1 0 . 3 1 1 5 / v 1 / D 1 4 - 1 1 6 2</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          ,
          <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>
          , CoRR abs/
          <year>1810</year>
          .04805 (
          <year>2018</year>
          ). URL: http://arxiv.org/abs/
          <year>1810</year>
          .04805.
          <article-title>a r X i v : 1 8 1 0 . 0 4 8 0 5</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <article-title>An overview of the tesseract ocr engine</article-title>
          ,
          <source>in: Ninth international conference on document analysis and recognition (ICDAR</source>
          <year>2007</year>
          ), volume
          <volume>2</volume>
          , IEEE,
          <year>2007</year>
          , pp.
          <fpage>629</fpage>
          -
          <lpage>633</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>C.</given-names>
            <surname>Jeeva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Porselvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Krithika</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Shreya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Priyaa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sivasankari</surname>
          </string-name>
          ,
          <article-title>Intelligent image text reader using easy ocr, nrclex &amp; nltk</article-title>
          , in: 2022 International Conference on Power, Energy,
          <source>Control and Transmission Systems (ICPECTS)</source>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Cui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <article-title>Layoutlmv3: Pre-training for document ai with unified text and image masking</article-title>
          ,
          <source>in: Proceedings of the 30th ACM International Conference on Multimedia</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>4083</fpage>
          -
          <lpage>4091</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Hwang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Yun</surname>
          </string-name>
          , D. Han,
          <string-name>
            <surname>S</surname>
          </string-name>
          . Park,
          <article-title>Ocr-free document understanding transformer</article-title>
          ,
          <source>in: European Conference on Computer Vision (ECCV)</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers),
          <source>Association for Computational Linguistics</source>
          , Minneapolis, Minnesota,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          . URL: https://aclanthology.org/ N19-1423.
          <source>doi:1 0 . 1 8</source>
          <volume>6 5 3</volume>
          / v 1 / N 1 9
          <article-title>- 1 4 2 3</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Broscheit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Poesio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Ponzetto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Rodriguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Romano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Uryupina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Versley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zanoli</surname>
          </string-name>
          ,
          <article-title>BART: A multilingual anaphora resolution system</article-title>
          ,
          <source>in: Proceedings of the 5th International Workshop on Semantic Evaluation</source>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Uppsala, Sweden,
          <year>2010</year>
          , pp.
          <fpage>104</fpage>
          -
          <lpage>107</lpage>
          . URL: https://aclanthology. org/S10-1021.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G.</given-names>
            <surname>Sarti</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Nissim, It5: Large-scale text-to-text pretraining for italian language understanding and generation</article-title>
          ,
          <source>ArXiv preprint 2203.03759</source>
          (
          <year>2022</year>
          ). URL: https://arxiv.org/abs/2203.03759.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>N.</given-names>
            <surname>Landro</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Gallo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. La</given-names>
            <surname>Grassa</surname>
          </string-name>
          , E. Federici,
          <article-title>Two new datasets for italian-language abstractive text summarization</article-title>
          ,
          <source>Information</source>
          <volume>13</volume>
          (
          <year>2022</year>
          )
          <fpage>228</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>