<!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>
      <journal-title-group>
        <journal-title>1https://www.technical-communication.org/
2https://www.gifas.fr/
3https://journals.openedition.org/traduire/389
4http://comtec</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>T4TEC: A Prototype for Simplified Multilingual Technical Communication. [Abstract]⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giorgio Maria Di Nunzio</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Federica Vezzani</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tiziana Sicilia</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>COM&amp;TEC Italian Association for Technical Communication</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Information Engineering, University of Padua</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Linguistic and Literary Studies, University of Padua</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>European Association for Technical Communication</institution>
          ,
          <addr-line>Tekom Europe</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>We present the design and implementation of a prototype to support the field of technical communication and in particular the multilingual technical writing, named Terminology for Technical Eficient Communication (T4TEC), jointly developed between the University of Padua and COM&amp;TEC (Associazione Italiana per la Comunicazione Tecnica). T4TEC is an innovative prototype tool among the software solutions for technical writing and technical communication. T4TEC includes a hybrid approach (rule based + data driven) based on 1) the oficial hand-written rules proposed by the Simplified Technical English, the Français Rationalisé, and Italiano Tecnico Semplificato experts and users; and 2) automatically harvest rule for lexical and syntactic simplifications by means of neural models.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Automatic text simplification</kwd>
        <kwd>Technical writing</kwd>
        <kwd>Technical communication</kwd>
        <kwd>Hybrid systems</kwd>
        <kwd>Terminology</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Background</title>
      <p>
        Automatic text simplification (ATS) is the process of reducing the linguistic complexity of a text
to improve its understandability and readability, improving contents and meaning and providing
safe, clear and unambiguous information. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. From a broader perspective, ATS has a significant
impact on society: it may help people with low literacy levels or those who sufer from reading
comprehension [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. ATS has usually focused on two diferent tasks: lexical simplification and
syntactic simplification [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. From an IR perspective, text simplification can be seen as a potential
pre-processing step for making texts ‘easier’ to handle for some tasks, such as information
extraction [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Key questions in this research field are: 1) how to identify complexity in the text,
and 2) how to simplify the text in order to match the reading ability of the target reader.
      </p>
      <p>
        In this paper, we focus on a specific case of text simplification which involves technical
writing and communication [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and controlled languages [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Technical communication is:
“the process of defining, creating and delivering information products for the safe, eficient
and efective use of products (technical systems, software, services)” 1. In this context, the
AeroSpace and Defence Industries Association of Europe (ASD) has led since the 1980s the
most important initiatives to develop a Simplified Technical English (ASD-STE100) to help
users to unambiguously understand technical manuals written in English. Later, more and
more organizations created their own controlled language to simplify diferent languages.
For example, the French aerospace industry association, the GIFAS,2 proposed a controlled
French language3 in 1999, “le Français Rationalisé” (FR), allowing easy translation of technical
documentation into Simplified English, whilst improving readability [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The “Italiano Tecnico
Semplificato” (ITS) has been developed by COM&amp;TEC 4 to include methods for creating and
writing, specific consultancy, technical training and certification for those who adopt and use it.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Challenges</title>
      <p>In this abstract, we present the design and implementation of T4TEC, a prototype for the
support of multilingual technical writing jointly developed between the University of Padua and
COM&amp;TEC. T4TEC is an innovative tool in the technical writing software panorama, because:
• it is a multilingual tool for writing and translating technical documentation in English,</p>
      <p>
        French, and Italian;
• it is a hybrid system (rule based + data driven) that uses 1) the oficial hand-written rules
proposed by the STE, the FR, and ITS,5 and automatically harvest rule for lexical [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and
syntactic simplifications [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ];
• it is a real-time suggestion tool; users receive suggestions while they are typing.
      </p>
      <p>
        In addition, we are designing T4TEC to tackle diferent research challenges posed by the
authors of the Google Smart Compose system [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] — that generates interactive, real-time
suggestions in Gmail that assists users in writing mails by reducing repetitive typing — but
adapted to this specific use case for technical communicators and writers: 6
• Latency. Since suggestions appear as the user is typing, minimizing end-to-end latency is
critical. Nevertheless, inference about suggestions needs not to be performed on every
keystroke. The optimal amount of text needed to check rules (lexical and syntax) is to be
found;
• Personalization. Users often have their own unique writing styles. The system needs
not to capture the uniqueness of their personal style. The model needs to have enough
capacity so that it is able to make tailored and high-quality suggestions for the company
for which the technical document is redacted (and the targeted user).
• Fairness and Privacy. Make sure that our models never expose company private
information. In this context, the user (technical writer) does not write for him/herself but for the
company.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Al-Thanyyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Azmi</surname>
          </string-name>
          ,
          <source>Automated text simplification: A survey</source>
          ,
          <source>ACM Comput. Surv</source>
          .
          <volume>54</volume>
          (
          <year>2021</year>
          )
          <volume>43</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>43</lpage>
          :
          <fpage>36</fpage>
          . URL: https://doi.org/10.1145/3442695. doi:
          <volume>10</volume>
          .1145/3442695.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Stajner</surname>
          </string-name>
          ,
          <article-title>Automatic text simplification for social good: Progress and challenges, in: Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021</article-title>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Online,
          <year>2021</year>
          , pp.
          <fpage>2637</fpage>
          -
          <lpage>2652</lpage>
          . URL: https://aclanthology.org/
          <year>2021</year>
          .findings-acl.
          <volume>233</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2021</year>
          .findings-acl.
          <volume>233</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>H.</given-names>
            <surname>Saggion</surname>
          </string-name>
          , Automatic Text Simplification,
          <source>Synthesis Lectures on Human Language Technologies</source>
          , Morgan &amp; Claypool Publishers,
          <year>2017</year>
          . URL: https://doi.org/10.2200/ S00700ED1V01Y201602HLT032. doi:
          <volume>10</volume>
          .2200/S00700ED1V01Y201602HLT032.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ermakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bellot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kamps</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Nurbakova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Ovchinnikova</surname>
          </string-name>
          , E. SanJuan, É. Mathurin,
          <string-name>
            <given-names>S.</given-names>
            <surname>Araújo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Hannachi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Huet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Poinsu</surname>
          </string-name>
          ,
          <article-title>Automatic simplification of scientific texts: Simpletext lab at CLEF-2022</article-title>
          , in: M.
          <string-name>
            <surname>Hagen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Verberne</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Macdonald</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Seifert</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Balog</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Nørvåg</surname>
          </string-name>
          , V. Setty (Eds.),
          <source>Advances in Information Retrieval - 44th European Conference on IR Research</source>
          , ECIR
          <year>2022</year>
          , Stavanger, Norway,
          <source>April 10-14</source>
          ,
          <year>2022</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , volume
          <volume>13186</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2022</year>
          , pp.
          <fpage>364</fpage>
          -
          <lpage>373</lpage>
          . URL: https: //doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -99739-7_
          <fpage>46</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -99739-7\_
          <fpage>46</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>W. E.</given-names>
            <surname>Britton</surname>
          </string-name>
          , What is technical writing?,
          <source>College Composition and Communication</source>
          <volume>16</volume>
          (
          <year>1965</year>
          )
          <fpage>113</fpage>
          -
          <lpage>116</lpage>
          . URL: http://www.jstor.org/stable/354886.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Adriaens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Schreurs</surname>
          </string-name>
          ,
          <article-title>From cogram to alcogram: Toward A controlled english grammar checker</article-title>
          ,
          <source>in: 14th International Conference on Computational Linguistics</source>
          ,
          <string-name>
            <surname>COLING</surname>
          </string-name>
          <year>1992</year>
          , Nantes, France,
          <source>August 23-28</source>
          ,
          <year>1992</year>
          ,
          <year>1992</year>
          , pp.
          <fpage>595</fpage>
          -
          <lpage>601</lpage>
          . URL: https://aclanthology.org/ C92-2090/.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>K.</given-names>
            <surname>Barthe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Juaneda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leseigneur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-C.</given-names>
            <surname>Loquet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Morin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Escande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vayrette</surname>
          </string-name>
          ,
          <article-title>Gifas rationalized french: A controlled language for aerospace documentation in french</article-title>
          ,
          <source>Technical Communication 46</source>
          (
          <year>1999</year>
          )
          <fpage>220</fpage>
          -
          <lpage>229</lpage>
          . URL: https://www.ingentaconnect.com/ content/stc/tc/1999/00000046/00000002/art00009.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Qiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yuan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          , Lsbert:
          <article-title>Lexical simplification based on bert</article-title>
          ,
          <source>IEEE/ACM Transactions on Audio, Speech, and Language Processing</source>
          <volume>29</volume>
          (
          <year>2021</year>
          )
          <fpage>3064</fpage>
          -
          <lpage>3076</lpage>
          . doi:
          <volume>10</volume>
          .1109/TASLP.
          <year>2021</year>
          .
          <volume>3111589</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Siddharthan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mandya</surname>
          </string-name>
          ,
          <article-title>Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules, in: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics</article-title>
          , Gothenburg, Sweden,
          <year>2014</year>
          , pp.
          <fpage>722</fpage>
          -
          <lpage>731</lpage>
          . URL: https://aclanthology.org/E14-1076. doi:
          <volume>10</volume>
          .3115/v1/
          <fpage>E14</fpage>
          -1076.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M. X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. N.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Bansal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tsay</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sohn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <article-title>Gmail smart compose: Real-time assisted writing</article-title>
          ,
          <source>in: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, KDD '19</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2019</year>
          , pp.
          <fpage>2287</fpage>
          -
          <lpage>2295</lpage>
          . URL: https://doi.org/10.1145/3292500.3330723. doi:
          <volume>10</volume>
          .1145/3292500.3330723.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>