<!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>Evaluating Transformer Models for Punctuation Restoration in Italian</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessio Miaschi</string-name>
          <email>alessio.miaschi@phd.unipi.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Amelio Ravelli</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Felice Dell'Orletta</string-name>
          <email>felice.dellorlettag@ilc.cnr.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CNR), ItaliaNLP Lab</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Computer Science, Universita di Pisa</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Istituto di Linguistica Computazionale \Antonio Zampolli" (ILC</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper, we propose an evaluation of a Transformerbased punctuation restoration model for the Italian language. Experimenting with a BERT-base model, we perform several ne-tuning with di erent training data and sizes and tested them in an in- and crossdomain scenario. Moreover, we o er a comparison in a multilingual setting with the same model ne-tuned on English transcriptions. Finally, we conclude with an error analysis of the main weaknesses of the model related to speci c punctuation marks.</p>
      </abstract>
      <kwd-group>
        <kwd>punctuation restoration</kwd>
        <kwd>transformers</kwd>
        <kwd>speech transcription</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Nowadays, Automatic Speech Recognition (ASR) and Speech-to-Text
technologies and services have reached an incredible level of accuracy in transcribing
recorded (or live) speech audio streams. A simple but e ective test can be run,
with any modern smartphone, by using the dictation feature to write a text
message.1 However, we can immediately notice that the audio stream is
transcribed as a word stream, lacking any punctuation or sentence segmentation,
and sometimes pieces of text are di cult to understand without some attempts
to mentally insert punctuation marks in the ow of words.2</p>
      <p>
        Lack of punctuation may be a minor problem in everyday short-text
messaging, but correctly inserted punctuation is crucial in long speech transcription,
live subtitling or any NLP processing of speech data, especially for downstream
processes such as parsing, information extraction, dialog modeling. Many major
Copyright © 2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
1 Obviously, the speech must have a close-to-standard accent without using dialectal
or slang words.
2 Other than di cult, unpunctuated text can be also ambiguous. Here is an
amusing example of two completely di erent letters, with the same words but di erent
punctuation: https://www.nationalpunctuationday.com/dearjohn.html.
commercial services such as Google Cloud3 or Microsoft Azure4 o er the option
of including automatically generated punctuation. As well, it is possible to train
a public ASR model, such as wav2vec [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] or Vosk,5 and then apply a
Punctuation Restoration technique on the output of the rst. Both alternatives come
at a cost: on one side, commercial services requires a payment fee; on the other,
training requires computational power, time and, above all, good and enough
training data in the form of aligned audio sources, transcriptions and phonetic
annotations. By assuming of working on already transcribed data, recent
Transformers models could be a convenient way of tackling punctuation restoration
in standard language transcriptions, as they can be easily ne-tuned on many
tasks, including the insertion of commas, periods and question marks. The
objective of this paper is to verify if it could be possible to obtain good results in
transcription by post-processing raw text from everyday Speech-to-Text
technologies (e.g. dictation on a smartphone) with a Transformers model ne-tuned
for Punctuation Restoration. More speci cally, we set our experiments on Italian
language and we verify the impact of di erent domains and sizes of ne-tuning
data on the performance of a Transformer-based punctuation restoration model.
Then, we tested its performances on an in- and cross-domain scenario and we
also o er a comparison with the same model trained on the English language.
      </p>
      <p>The rest of the paper is organized as follows: in Sec. 2 we present related
works, in Sec. 3 we introduce the setting, models and data used for the
experiments, in Sec. 4 discuss the obtained results and in Sec. 5 we conclude the
paper.</p>
      <p>Contributions In this paper we: i) investigate the impact of di erent training
sizes on the performance of a punctuation restoration model based on the
Transformer architecture; ii) we test the performance of the model in di erent
scenarios (in- and cross-domain); iii) we compare the results obtained in Italian with
those obtained with an English model; iv) we inspect the most common errors
emerged during the experiments.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Punctuation restoration is a well known task, especially in Speech Processing
and Machine Translation, where many approaches have been tested to tackle
the problem in the past decades. In early attempts, acoustic features has been
exploited to train nite-states or Hidden Markov Models [
        <xref ref-type="bibr" rid="ref10 ref12 ref5">10, 5, 12</xref>
        ]: the basic
idea was to model prosody from speech data and use pauses as cues for sentence
boundary, thus as signal of full stop punctuation marks. While prosody is useful
in some cases, most of the time cannot be used to place punctuation in an ASR
output because speakers use pauses in speech not only to shape the rhythm of
their communication, but also for physical needs (e.g. breathing) or hesitations.
      </p>
      <sec id="sec-2-1">
        <title>3 https://cloud.google.com/speech-to-text/ 4 https://azure.microsoft.com/en-us/services/cognitive-services/speech-to-text/ 5 https://alphacephei.com/vosk/</title>
        <p>
          To solve this problem, multimodal models have been proposed, making use
of parallel audio and transcripts as training [
          <xref ref-type="bibr" rid="ref11 ref26">26, 11</xref>
          ]. Most of these approaches
take Language Models scores, tokens or POS tags of a huge amount of
continuous words as the textual features, and exploit pause, pitch contour, energy
and prosody as principal acoustic features [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. With the rise of Deep Learning
techniques, many works reported good performances by training Deep Neural
Networks with parallel acoustic and textual features [
          <xref ref-type="bibr" rid="ref14 ref15 ref29 ref4">4, 29, 14, 15</xref>
          ]
        </p>
        <p>
          Obviously, multimodal models need a discrete amount of parallel audios and
texts, and outside the English World it is not trivial at all to nd such data.
Given that, many works have focused on textual-only approaches [
          <xref ref-type="bibr" rid="ref13 ref30 ref34">30, 34, 13</xref>
          ].
        </p>
        <p>
          More recently, the potential of Transformer-based Neural Language Models
(NLMs) have been exploited in several studies [
          <xref ref-type="bibr" rid="ref19 ref32 ref33">32, 33, 19</xref>
          ]. For instance, [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]
used a pre-trained BERT model [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] with bidirectional LSTM and a CRF layer to
achieve state-of-the-art results on the reference transcriptions of the IWSLT2012
dataset6. [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ], instead, proposed an adversarial multitask learning approach with
auxiliary part-of-speech tagging using a pre-trained BERT model.
        </p>
        <p>
          While the vast majority of this research is focused on the English language,
relatively little work has been done to inspect the potential of these models on
other languages. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] proposed a method based on Chinese punctuation prediction
by combining the BERT model with a BiLSTM that outperformed the baseline
by up to 31% absolute in overall micro-F1 on a Chinese news dataset. The study
by [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], from which we built our experiments for the Italian language, explored
different Transformer-based models and propose an augmentation strategy for the
punctuation restoration task both on high- (English) and low-resource (Bangla)
languages.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experimental Setting</title>
      <p>
        We explored the potential of transformer based language models for the
punctuation restoration task on the Italian language. Speci cally, we de ned two sets
of experiments. The rst consists in evaluating the impact of the ne-tuning set
size on the task performances. For that purpose, we tested the performance of
a state-of-the-art transformer based architecture for punctuation restoration [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
with incremental ne-tuning sizes.
      </p>
      <p>In the second set of experiments, we compared the performances of two
differently ne-tuned models on 4 test datasets, as explained in 3.2. Moreover, we
proposed an error analysis in order to investigate strength and weakness of the
proposed methodology.</p>
      <p>Model and datasets used for the experiments are described below.
3.1</p>
      <sec id="sec-3-1">
        <title>Model</title>
        <p>
          We relied on the architecture previously de ned in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. The architecture is based
on a Transformer model from which the internal representations are then used
6 http://hltc.cs.ust.hk/iwslt/index.php/evaluation-campaign/ted-task.html
as input for a BiLSTM layer, consisting of 768 hidden units. The outputs of
the BiLSTM layer are then concatenated at each time step to a fully connected
layer with four output neurons: one for the O (Other) class and three for the
punctuation marks of Comma (C ), Period (P ) and Question (Q ). Thus, this
model casts the punctuation restoration problem as a classi cation problem: the
output is basically a class assigned to each token.
        </p>
        <p>
          The pre-trained Transformer used in our experiments is the XXL uncased
version of the BERT model for the Italian language developed by the MDZ
Digital Library Team and available trough the Huggingface's Transformers library
[
          <xref ref-type="bibr" rid="ref31">31</xref>
          ]7. The model was trained on Italian Wikipedia and texts from the OPUS
[
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] and OSCAR [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] corpora. We will refer to the model as BERT-BiLSTM.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Data</title>
        <p>
          The model has been ne-tuned on two corpora, in order to evaluate divergences in
the results with respect to the domain variation deriving from di erent data. The
rst corpus is a large collection of authentic contemporary texts in Italian derived
from the web, and it is the de-facto reference corpus for Italian in many NLP
applications: the Italian Web as Corpus (ItWaC) [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. It counts 2 billion words and
it has been built from the Web by limiting the crawl to the .it domain, and using
as seeds medium-frequency words from La Repubblica journalistic corpus [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and
Il Nuovo Vocabolario di Base (NVdB - list of basic words of Italian) [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Given
the extension and the origin, the ItWaC corpus spans across many domains. It
contains texts with registries that vary from colloquial (i.e. texts derived from
forums and social media) to highly formal (i.e. o cial documents, newspapers,
technical descriptions),and the use of punctuation varies accordingly.
        </p>
        <p>
          The second corpus used for the ne-tuning is the Italian sub-corpus of the
Opensubtitles Multilingual Corpus [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].8 This huge corpus has been compiled
from a large database of movie and TV subtitles collected from the
Opensubtitles website,9 and includes a total of 1,689 bi-texts spanning 2.6 billion sentences
across 60 languages. The Italian-only subcorpus consists of a total of 769.5
millions of words. Language of movies and television has been often de ned as
broadcast-spoken [
          <xref ref-type="bibr" rid="ref20 ref22">20, 22</xref>
          ], that is a variety of language that sits in the middle
between written and spoken. More speci cally, broadcast-spoken is characterised
by the fact that it is a well programmed language, based on pre-written texts,
and performed to mimic spoken variety. Obviously, it lacks features speci c of
the spontaneous speech, such as hesitations, retracting and llers, and it shows
high regularity, especially in the use punctuation as marks of pauses in the
transcription.
        </p>
        <p>By creating two ne-tuned models, we want to investigate if the language
diversity observable in the two corpora (i.e. average written language and
multiregistry from ItWaC, close-to-spoken but highly regular from Opensubtitles) is
re ected in the way the models handle punctuation.</p>
        <sec id="sec-3-2-1">
          <title>7 https://huggingface.co/dbmdz/bert-base-italian-xxl-cased 8 https://opus.nlpl.eu/OpenSubtitles-v2018.php 9 http://www.opensubtitles.org</title>
          <p>Dataset Sentences Tokens Commas Periods Questions</p>
          <p>ItWaC 765,491 19,226,715 (25.12) 1,403,527 (1.83) 729,806 (0.95) 35,685 (0.05)
Opensubtitles it 1505279 14,468,346 (9.61) 754,951 (0.5) 1,265,306 (0.84) 239,973 (0.16)
ParlaMint it 134,887 3,203,374 (23.75) 238,960 (1.77) 130,386 (0.97) 4,501 (0.03)
TEDx it 1,139 21,667 (19.02) 1,823 (1.6) 1,070 (0.94) 69 (0.06)
TEDx en 1,210 21,383 (17.67) 1,636 (1.35) 1,142 (0.94) 68 (0.06)
Table 1. Statistics on the datasets used for ne-tuning and test. In parenthesis, the
average distribution per sentence.</p>
          <p>
            Moreover, we considered other two resources for the purpose of evaluating
the two models performances in a cross-domain scenario. The rst resource is
the Italian part of the ParlaMint Comparable Corpora [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ], which contains
transcriptions of parliamentary debates from 2015 to mid-2020, counting about 20
millions of words.10 Given the context of the texts, language is highly formal,
and thus also the use of punctuation in the transcripts is precise and regular.
          </p>
          <p>
            With the second test-only resource we also introduce a multilingual setting,
useful to compare models performances with reference systems available for
English language. We used the Italian-English alignment of the Multilingual TEDx
Dataset [
            <xref ref-type="bibr" rid="ref23 ref24">24, 23</xref>
            ],11, which is a collection of audio recordings from TEDx talks in
8 source languages. The Italian-English alignment derives from transcriptions of
Italian TEDx speeches with aligned English translations, and it counts about 18
thousands words in both languages.
          </p>
          <p>Table 1 reports some numbers about the datasets herein described. These
statistics refer to the whole set of texts processed, and for all the experiments
conducted with di erent size of ne-tuning a random selection of sentences has
been collected.</p>
          <p>Data pre-processing The model implemented in our experiments is trained
on a classi cation of tokens on the basis of the presence or absence of a
punctuation mark immediately after the target token. It is important to remember
that punctuation is a feature of the written language modality, and it is used
to mimic oral pauses in the transcription of speech: commas are used for short
pauses, periods for long pauses at the end of an utterance and question marks
for questions. For this reason, we collapsed all the possible punctuation marks
to these 3 classes, reducing the complexity of the ne-tuning data.
10 The complete collection of comparable corpora in 17 languages is available at:
https://www.clarin.si/repository/xmlui/handle/11356/1432
11 The full dataset is available at: http://www.openslr.org/100/
We rst investigate the impact of di erent training sizes on the performance
of BERT-BiLSTM. In order to do so, we ne-tuned our punctuation restoration
models in parallel, with increasingly large portions of the two corpora, from 100k
to 10 million tokens, and then tested them on a previously unseen portion of the
two datasets consisting of 200k words. Results (in terms of micro F-score) are
reported in Figure 1. As a general remark, we found that, for both models, the
curve tends to atten out when the ne-tuning process is performed with portions
larger than 2 million tokens. As regards the di erences between the two datasets,
we can notice that the model ne-tuned on Opensubtitles performed slightly
better than the one trained on ItWac. For instance, focusing on the results
obtained in the last run (10 million tokens) we can observe that the di erence
between the two models in terms of F-score is about 0.05 points (0.75 vs. 0.70).
Moreover, it is interesting to note that while the Opensubtitles model obtained
quite good results even with very small portions of the dataset (e.g. 100K), the
itWac model requires at least one million words to achieve comparable results.
This behaviour is quite predictable due to the fact that Opensubtitles texts are
extremely regular and minimum variation is appreciable through the whole set of
data. On the contrary, using ItWaC that is more heterogeneous, the system need
more data to start correctly modelling the distribution of punctuation marks.</p>
          <p>To better investigate their performances, we report in Table 4 the results
obtained by the two models ne-tuned with 10 millions words from
Opensubtitles/ItWac and tested in two di erent scenarios: i) in-domain, i.e. testing on
the same dataset; ii) cross domain, i.e. testing on the other domain. Moreover,
in order to provide a direct comparison between the two models, we tested both
their performance on the Parlamint datasets.</p>
          <p>As it can bee seen by looking at the average scores (column Avg ), the
indomain con guration always achieves the best results (ItWaC: 0.65;
Opensubtitles: 0.73). By focusing on the cross-domain con gurations, it is interesting
to notice that the high variability of ItWaC texts strengthens the model and
enables it to handle punctuation with better performances with respect to the
model ne-tuned on Opensubtitles. Speci cally, observing the performances of
ItWaC model on Opensubtitles testset and viceversa, we notice a di erence of
0.05 points. While, looking at both models (ItWaC and Opensubtitles) tested on
ParlaMint, the gap increases to 0.07 points in favour of the ItWaC model. We
can explain this behaviour on the basis of the nature of the ParlaMint dataset,
where regularity and formality leads to longer sentences with punctuation usage
closer to average written texts. Thus, ItWaC model, which is based on an
heterogeneous collection of texts larger than Opensubtitles, is capable of predicting
punctuation in a more robust way.</p>
          <p>Looking at per-class scores, it is possible to notice that all systems perform
better in predicting the PERIOD class: with exclusion of the Opensubtitles
model tested on ItWaC, all scores are above 0.70. This result is encouraging
because periods, exclamation marks and other full stops are used to signal the
end of a sentence, thus a similar model can be e ectively exploited to tackle
the task of segmenting the continuous ow of speech transcription, enabling
better subsequent sentence-based methods of analysis (e.g. part-of-speech tagging,
dependency parsing and so on).</p>
          <p>We register lower gures on the QUESTION class. It is probably due to the
unpredictability of these in Italian only on the basis of transcribed text, without
considering intonation. We further investigate this problem in 4.2.
4.1</p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>Model comparison in multilingual setting</title>
        <p>
          As already mentioned in Sec. 3.2, we also decided to compare the performance of
our ne-tuned models with a reference system available for the English language.
Speci cally, we compared the results obtained with the ItWaC/Opensubtitles
models when tested on the Italian transcriptions of TEDx speeches with the
ones obtained by the system devised in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] and tested on the TEDx aligned
English translations. Results are reported in Table 5.
        </p>
        <p>As noticed in the previous experiments, the model ne-tuned on ItWaC data
achieve better results when tested in a cross-domain scenario. In fact, we can
observe a di erence of about 0.03 points in terms of average F-scores. In this
respect, it is interesting to note that the main di erence between the performance
of the two models is due to the classi cation of question marks. Focusing instead
on the comparison between Italian and English models, we can clearly observe
that the latter outperforms the Italian ones. Also in this case, the classi cation of
question marks is the one that contributed most to the score di erence between
the models. This result is quite expected, since a question in English, beside the
presence of a question mark at the end of the sentence, is usually characterised by
an inversion of the subject and the verb in the principal clause. On the contrary,
in Italian the punctuation mark is the only discriminating feature of questions
in the written modality, while intonation plays the main role in spoken Italian.
Therefore, the identi cation of question marks tends to be much easier for the
English language.
4.2</p>
      </sec>
      <sec id="sec-3-4">
        <title>Error Analysis</title>
        <p>In order to further deepen our analysis, in this section we investigate in more
detail the main errors made by the two models when predicting the di erent
punctuation marks. In Figure 2 we report the confusion matrices (in terms of
accuracy) of the results obtained by the model ne-tuned on ItWaC and tested
on Opensubtitles and vice-versa. As a general remark, we can highlight that
the COMMA class is the most confused in both models. Due to the unbalanced
distribution of the O (Other) class with respect to the punctuation classes, the
high confusion of every class with this one is easily predictable. Thus, if we
exclude the O class from the gure, we can notice that the class with which the
COMMA is often confused is PERIOD, for both models tested on the opposite
dataset (e.g. model ne-tuned on ItWaC and tested on Opensubtitles and vice
versa). We can ascribe this problem to the average length of sentences, that
diverges between the two: in ItWaC, the average sentence counts 25.12 tokens
with about 1.83 commas per sentence; in Opensubtitles, the average sentence
is 9.61 tokens long, with a distribution of commas of 0.5. For this reason, we
can assume that the Opensubtitles model tends to create shorter sentences, thus
using the full stop mark more frequently than the ItWaC one.</p>
        <p>Figure 3 reports instead the confusion matrices of the results obtained by
the two ne-tuned models (ItWaC and Opensubtitles) on ParlaMint test data.
As we have seen previously, the model ne-tuned on ItWaC is the one that
achieved better results regardless of the class taken into account. In fact, with
the exception of Other (O ), in all the other classes we observe a performance gap
that goes from 0.2 (PERIOD ) to 0.11 (COMMA) accuracy points. Focusing on
the mismatched classes, we can see once again that commas are often mistaken
as other tokens (O ), while question marks are classi ed as periods, as in the
following example:</p>
        <p>Original: Vorrei ricordarvi i fallimenti ai quali siete andati incontro e state
continuamente andando incontro con i bonus. Devo ricordarvi, forse il bonus
vacanze? [en. I would like to remind you of the failures you have experienced
and you are continually experiencing with the bonuses. Should I remind you
the holiday bonus? ]
ItWaC/Opensubtitles: Vorrei ricordarvi i fallimenti ai quali siete andati
incontro e state continuamente andando incontro con i bonus. devo
ricordarvi, forse il bonus vacanze.</p>
        <p>If we look at the di erences between the two models, we can clearly notice
that the one ne-tuned on Opensubtitles tends to wrongly classify in 0.15 of the
cases a comma also as a full stop, as in the following example:
Original: Scusate la digressione: pure io sono un mancato operaio, due
braccia rubate all'agricoltura - allora lo si diceva in senso denigratorio, mentre
oggi tale de nizione si e quali cata un po' di piu - e ho potuto permettermi
di studiare e di laurearmi. [en. Sorry for the digression: I am too a
nonworking class person, two arms stolen from agriculture - at the time this was
said in a derogatory sense, whereas today this de nition has been requali ed
- and I was able to a ord my studies and my degree.]
ItWaC: Scusate la digressione, pure io sono un mancato operaio, due braccia
rubate all'agricoltura, allora lo si diceva in senso denigratorio, mentre oggi
tale de nizione si e quali cata un po' di piu e ho potuto permettermi di
studiare e di laurearmi
Opensubtitles: Scusate la digressione. pure io sono un mancato operaio.
due braccia rubate all'agricoltura. allora lo si diceva in senso denigratorio,
mentre oggi tale de nizione si e quali cata un po' di piu e ho potuto
permettermi di studiare e di laurearmi</p>
        <p>From the previous example, we can also highlight that the hyphens were
correctly classi ed as COMMA by the ItWaC model (punctuation marks to class
mapping in Table 2), while they were identi ed as full stops by the
Opensubtitles one. This could be due to the fact that since the Opensubtites dataset
is composed of shorter sentences (derived from transcribed dialogic turns), the
model tends to extend this behaviour on its inferences. Conversely, the colon
were correctly identi ed as PERIOD by the Opensubtitles models.
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>In this paper we veri ed if it could be possible to obtain good results in restoring
punctuation in raw transcription texts by means of a ne-tuned Transformers
model. We chose to exploit 2 corpora as ne-tuning, namely ItWaC and
Opensubtitles, in order to observe the di erences emerging from domain variety and
their projection on performances.</p>
      <p>First, we evaluated the impact of di erent sizes of ne-tuning datasets, and
we observed that the model ne-tuned on highly regular data (i.e.
Opensubtitles) need less information to start modelling punctuation with regards to the
model ne-tuned on more heterogeneous data (i.e. ItWaC); for both models, the
curve tends to atten out with ne-tuning portions larger than 2 million tokens.
Moreover, the model ne-tuned on ItWaC obtains the best results when tested
cross-domain on ParlaMint dataset, which is used as neutral testing eld for
both models.</p>
      <p>
        Lately, we o ered a comparison between the Italian models herein ne-tuned
and the English model originally presented in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], tested on the parallel it-en part
of the TEDx dataset. With this comparison it has been possible to easily
interpret the errors deriving from the confusion between question marks and periods,
that is problematic in Italian due to the lack of strong syntactic cues, such as in
English, and for this reason it is extremely di cult to distinguish between
question marks and periods considering textual information uniquely. In conclusion,
a precise punctuation restoration with Transformers based models is a di cult
task, but considering the good results in predicting periods positioning, we can
con rm that it is possible to mark sentence boundaries and thus segmenting in
sentences the continuous ow of speech transcription.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Punctuation Restoration using Transformer Models for High-</article-title>
          and
          <string-name>
            <surname>Low-Resource Languages</surname>
          </string-name>
          .
          <source>In: Proceedings of the Sixth Workshop</source>
          on Noisy User-generated
          <string-name>
            <surname>Text</surname>
          </string-name>
          (
          <article-title>W-NUT</article-title>
          <year>2020</year>
          ). pp.
          <volume>132</volume>
          {
          <fpage>142</fpage>
          . Association for Computational Linguistics,
          <string-name>
            <surname>Online</surname>
          </string-name>
          (
          <year>2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .wnut-
          <volume>1</volume>
          .18, https://aclanthology.org/
          <year>2020</year>
          .wnut-
          <volume>1</volume>
          .
          <fpage>18</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Baroni</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernardini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Comastri</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Piccioni</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Volpi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aston</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mazzoleni</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Introducing the La Repubblica Corpus: A Large, Annotated, TEI (XML)-compliant Corpus of Newspaper Italian</article-title>
          . In: LREC (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Baroni</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernardini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ferraresi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zanchetta</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>The WaCky wide web: a collection of very large linguistically processed web-crawled corpora</article-title>
          .
          <source>Language Resources and Evaluation</source>
          <volume>43</volume>
          (
          <issue>3</issue>
          ),
          <volume>209</volume>
          {
          <fpage>226</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Che</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meinel</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Sentence boundary detection based on parallel lexical and acoustic models</article-title>
          .
          <source>In: Interspeech</source>
          . pp.
          <volume>2528</volume>
          {
          <issue>2532</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Christensen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gotoh</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Renals</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Punctuation annotation using statistical prosody models</article-title>
          . (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. De Mauro, T.:
          <article-title>Il nuovo vocabolario di base della lingua italiana</article-title>
          . In:
          <article-title>Guida all'uso delle parole</article-title>
          .
          <source>Editori Riuniti</source>
          (
          <year>1980</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </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). pp.
          <volume>4171</volume>
          {
          <fpage>4186</fpage>
          . Association for Computational Linguistics, Minneapolis,
          <source>Minnesota (Jun</source>
          <year>2019</year>
          ). https://doi.org/10.18653/v1/
          <fpage>N19</fpage>
          -1423, https://aclanthology.org/N19-1423
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Erjavec</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ogrodniczuk</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osenova</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ljubesic</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grigorova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rudolf</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pancur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kopp</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barkarson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Steingr msson, S., van der Pol, H.,
          <string-name>
            <surname>Depoorter</surname>
          </string-name>
          , G., de Does, J.,
          <string-name>
            <surname>Jongejan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haltrup Hansen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Navarretta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calzada</surname>
            <given-names>Perez</given-names>
          </string-name>
          , M.,
          <string-name>
            <surname>de Macedo</surname>
            , L.D., van Heusden,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Marx</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Coltekin,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Coole</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Agnoloni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Frontini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Montemagni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Quochi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Venturi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Ruisi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Marchetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Battistoni</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          , Seb}ok,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Ring</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            , Darg` is, R.,
            <surname>Utka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Petkevicius</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          , Briediene_,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Krilavicius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Morkevicius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Diwersy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Luxardo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Rayson</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Multilingual comparable corpora of parliamentary debates ParlaMint 2</article-title>
          .1 (
          <issue>2021</issue>
          ), http://hdl.handle.net/11356/1432,
          <article-title>slovenian language resource repository CLARIN</article-title>
          .SI
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Fang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Using bidirectional lstm with bert for chinese punctuation prediction</article-title>
          .
          <source>In: 2019 IEEE International Conference on Signal, Information and Data Processing (ICSIDP)</source>
          . pp.
          <volume>1</volume>
          {
          <issue>5</issue>
          (
          <year>2019</year>
          ). https://doi.org/10.1109/ICSIDP47821.
          <year>2019</year>
          .9172986
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gotoh</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Renals</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Sentence boundary detection in broadcast speech transcripts</article-title>
          . In:
          <fpage>ASR2000</fpage>
          -
          <article-title>Automatic Speech Recognition: Challenges for the new Millenium ISCA Tutorial</article-title>
          and Research Workshop (ITRW) (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Gravano</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jansche</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bacchiani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Restoring punctuation and capitalization in transcribed speech</article-title>
          .
          <source>In: 2009 IEEE International Conference on Acoustics, Speech and Signal Processing</source>
          . pp.
          <volume>4741</volume>
          {
          <fpage>4744</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Woodland</surname>
          </string-name>
          , P.C.
          <article-title>: A combined punctuation generation and speech recognition system and its performance enhancement using prosody</article-title>
          .
          <source>Speech Communication</source>
          <volume>41</volume>
          (
          <issue>4</issue>
          ),
          <volume>563</volume>
          {
          <fpage>577</fpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Deep recurrent neural networks with layer-wise multi-head attentions for punctuation restoration</article-title>
          .
          <source>In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          . pp.
          <volume>7280</volume>
          {
          <fpage>7284</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Klejch</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Renals</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Punctuated transcription of multi-genre broadcasts using acoustic and lexical approaches</article-title>
          .
          <source>In: 2016 IEEE Spoken Language Technology Workshop (SLT)</source>
          . pp.
          <volume>433</volume>
          {
          <fpage>440</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Klejch</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Renals</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Sequence-to-sequence models for punctuated transcription combining lexical and acoustic features</article-title>
          .
          <source>In: 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          . pp.
          <volume>5700</volume>
          {
          <fpage>5704</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Silber-Varod</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moyal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The e ect of pitch, intensity and pause duration in punctuation detection</article-title>
          .
          <source>In: 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel</source>
          . pp.
          <volume>1</volume>
          {
          <issue>4</issue>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Lison</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tiedemann</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Opensubtitles2016: Extracting large parallel corpora from movie and tv subtitles (</article-title>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Makhija</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ho</surname>
            ,
            <given-names>T.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chng</surname>
            ,
            <given-names>E.S.:</given-names>
          </string-name>
          <article-title>Transfer learning for punctuation prediction</article-title>
          .
          <source>In: 2019 Asia-Paci c Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)</source>
          . pp.
          <volume>268</volume>
          {
          <fpage>273</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Nagy</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bial</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Acs</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Automatic punctuation restoration with bert models</article-title>
          .
          <source>arXiv preprint arXiv:2101.07343</source>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Nencioni</surname>
          </string-name>
          , G.:
          <article-title>Parlato-parlato, parlato-scritto, parlato-recitato</article-title>
          .
          <source>Strumenti critici 29</source>
          (
          <year>1976</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Qi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Bolton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Manning</surname>
          </string-name>
          , C.D.:
          <article-title>Stanza: A python natural language processing toolkit for many human languages</article-title>
          .
          <source>In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics: System Demonstrations</source>
          . pp.
          <volume>101</volume>
          {
          <issue>108</issue>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Sabatini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>La comunicazione orale, scritta e trasmessa</article-title>
          . In: Boccafurni,
          <string-name>
            <given-names>A.M.</given-names>
            ,
            <surname>Serromani</surname>
          </string-name>
          , S. (eds.)
          <article-title>Educazione linguistica nella scuola superiore: sei argomenti per un curricolo</article-title>
          , pp.
          <volume>105</volume>
          {
          <issue>27</issue>
          (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Salesky</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiesner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bremerman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cattoni</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Negri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turchi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oard</surname>
            ,
            <given-names>D.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Post</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Multilingual tedx corpus for speech recognition and translation (</article-title>
          <year>2021</year>
          ), http://www.openslr.org/100/
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Salesky</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wiesner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bremerman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cattoni</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Negri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turchi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oard</surname>
            ,
            <given-names>D.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Post</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The multilingual TEDx corpus for speech recognition and translation</article-title>
          .
          <source>arXiv:2102.01757</source>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baevski</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Collobert</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auli</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>wav2vec: Unsupervised pretraining for speech recognition</article-title>
          . arXiv preprint arXiv:
          <year>1904</year>
          .
          <volume>05862</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Stolcke</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shriberg</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bates</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ostendorf</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hakkani</surname>
            ,
            <given-names>D.Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plauche</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Tur, G.,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Automatic detection of sentence boundaries and dis uencies based on recognized words</article-title>
          .
          <source>In: ICSLP</source>
          . vol.
          <volume>2</volume>
          , pp.
          <volume>2247</volume>
          {
          <fpage>2250</fpage>
          .
          <string-name>
            <surname>Citeseer</surname>
          </string-name>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Suarez</surname>
            ,
            <given-names>P.J.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sagot</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romary</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Asynchronous pipeline for processing huge corpora on medium to low resource infrastructures. Challenges in the Management of Large Corpora (CMLC-7</article-title>
          )
          <year>2019</year>
          p.
          <volume>9</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Tiedemann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nygaard</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The opus corpus-parallel and free</article-title>
          : http://logos. uio. no/opus. Citeseer (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Tilk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          , Alumae, T.:
          <article-title>Lstm for punctuation restoration in speech transcripts</article-title>
          . In:
          <article-title>Sixteenth annual conference of the international speech communication association (</article-title>
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Tilk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          , Alumae, T.:
          <article-title>Bidirectional recurrent neural network with attention mechanism for punctuation restoration</article-title>
          .
          <source>In: Interspeech</source>
          . pp.
          <volume>3047</volume>
          {
          <issue>3051</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Wolf</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debut</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chaumond</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delangue</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cistac</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rault</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Louf</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Funtowicz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davison</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shleifer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , von Platen,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , Ma,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Jernite</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Le Scao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Gugger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Drame</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Lhoest</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            ,
            <surname>Rush</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Transformers: State-of-the-art natural language processing</article-title>
          .
          <source>In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          . pp.
          <volume>38</volume>
          {
          <fpage>45</fpage>
          . Association for Computational Linguistics,
          <source>Online (Oct</source>
          <year>2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .emnlp-demos.6, https://www.aclweb.org/anthology/2020.emnlp-demos.
          <fpage>6</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
          </string-name>
          , J.:
          <article-title>Self-attention based model for punctuation prediction using word and speech embeddings</article-title>
          .
          <source>In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</source>
          . pp.
          <volume>7270</volume>
          {
          <fpage>7274</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bai</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tian</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Adversarial transfer learning for punctuation restoration</article-title>
          . arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>00248</volume>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , et al.:
          <article-title>Distilling knowledge from an ensemble of models for punctuation prediction</article-title>
          .
          <source>In: Interspeech</source>
          . pp.
          <volume>2779</volume>
          {
          <issue>2783</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>