<!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>Automatic Generation of Explanatory Text from Flowchart Images in Patents</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hidetsugu Nanba</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Shohei Kubo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Satoshi Fukuda</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chuo University</institution>
          ,
          <addr-line>1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551</addr-line>
          <country country="JP">JAPAN</country>
        </aff>
      </contrib-group>
      <fpage>22</fpage>
      <lpage>26</lpage>
      <abstract>
        <p>This paper addresses the automatic generation of explanatory text from flowchart images in patents. The construction of an explanatory text generator consists of four steps: (1) automatic recognition of flowchart images from patent images, (2) extraction of text strings from flowchart images, (3) creation of data for machine learning, and (4) construction of an explanatory text generator using T5. In this study, a benchmark consisting of 7,099 images was constructed to determine whether an image in a patent is a flowchart. Furthermore, an explanatory text generator was constructed from the images using 11,188 flowchart image-explanatory text pairs. The experimental results showed that a recognition accuracy of 0.9645 was achieved for flowchart images. Although high-quality explanatory text could be generated from flowchart images, some issues remain for flowcharts with complex shapes.</p>
      </abstract>
      <kwd-group>
        <kwd>Flowchart</kwd>
        <kwd>Image recognition</kwd>
        <kwd>Text generation</kwd>
        <kwd>Character recognition</kwd>
        <kwd>Patent</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>A procedural text is a description of a set of procedures
to achieve a particular objective. Our goal is to
automatically extract knowledge about a series of
procedures in a wide range of fields from texts and
systematize them. Here, we describe the automatic
generation of explanatory text from flowchart images
in patents.</p>
      <p>In automatically generating explanatory text for
the flowchart images, we focus on the abstract and
selected figures of the patent. A selection figure
enables us to grasp the outline of the invention quickly
and accurately. The applicant usually selects a diagram
from among the diagrams in the patent that they
consider necessary for understanding the abstract
contents. If a classifier that automatically determines
whether an image in a patent is a flowchart or not is
constructed and only those selected diagrams that are
flowcharts are extracted, a large number of pairs of
flowcharts and their explanatory texts (i.e., patent
abstracts) can be generated automatically.
Furthermore, using these pairs, we believe it is
possible to construct a system that automatically
generates explanatory text from flowchart images
using machine learning.</p>
      <p>The contributions of this paper are as follows:
To determine whether an image in a patent is a
configuration diagram, flowchart, or table, we
constructed a benchmark consisting of 7,099
images. We used this benchmark to achieve a
classification accuracy of 0.9645.</p>
      <p>We constructed 11,188 pairs of flowchart images
and their descriptions automatically.</p>
      <p>Using these pairs, we constructed a system that
automatically generates explanatory text from
flowchart images through machine learning.
PatentSemTech'23: 4th Workshop on Patent Text Mining and
Semantic Technologies, July 27th, 2023, Taipei, Taiwan.
l
l
l</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>2.1.</p>
      <sec id="sec-2-1">
        <title>Flowchart Analysis</title>
        <p>
          Services that share flowcharts, such as
myExperiment and SHIWA, have started recently,
which has led to a demand for techniques to search for
similarities between one flowchart and another
flowchart [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. A related research project in flowchart
image analysis is CLEF-IP, which refers to a task
targeting patents [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. The Conference and Labs of the
Evaluation Forum (CLEF) is a workshop on
information retrieval held mainly in Europe. CLEF-IP
recognizes shapes, detects text, edges, and nodes that
are elements of flowcharts, and recognizes flowcharts.
Herrera-Cámara also worked to recognize flowchart
images [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. In addition, Sethi et al. identified flowcharts
from diagram images in deep learning-related papers
and further analyzed the flowcharts to build a system
that outputs the sources in Keras and Caffe [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. This
research differs from theirs in that we take a flowchart
image as input and output its description as a natural
language sentence. We considered the availability of
resources such as the CLEF-IP for our work, but as it is
too small to be used as training data for the generation
of explanatory texts, this study started with the
creation of training data.
2.2. Generating Text from Figures
and Tables
        </p>
        <p>
          Chart to text refers to the task of generating natural
language sentences to describe the important
information derived from charts and tables. Zhu et al.
[
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] addressed this problem by building a system,
AutoChart. A human and machine evaluation of the
generated text and charts demonstrates that the
generated text is informative, coherent, and relevant to
the corresponding charts [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>
          Tan and colleagues [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] generated sentences from
pie charts, bar graphs, and line graphs in scientific
papers, while Kantharaj and colleagues [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] generated
sentences from charts using generators such as T5 [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ],
BART, and GPT2 based on bar and line graphs mainly
describing economic, market, and social issues.
Instead of graphs, this study uses flowchart images as
inputs and the goal is to automatically generate
explanatory text from these flowcharts.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Automatic Generation of</title>
    </sec>
    <sec id="sec-4">
      <title>Explanatory Text from</title>
    </sec>
    <sec id="sec-5">
      <title>Flowchart Images</title>
      <p>The construction of the generator of explanatory text
consists of the following four steps: (Step 1) automatic
recognition of flowchart images; (Step 2) extraction of
character strings from the flowchart image; (Step 3)
creation of data for machine learning; and (Step 4)
construction of an explanatory text generator using T5.
Each procedure is described as follows.
(Step 1) Automatic recognition of flowchart images</p>
      <p>Convolutional neural networks (CNNs) are used to
recognize flowchart images in patents. Our method
uses seven CNN models trained on a large image data
set called “ImageNet” to construct a learning model by
fine tuning, and its effectiveness is verified through the
experiments described in Section 4.
(Step 2) Extraction of character strings from the
flowchart image</p>
      <p>An optical character recognition function in Google
Cloud Vision (https://cloud.google.com/vision) is
used to extract text strings from flowcharts. An
example of a flowchart image and the character
recognition result are shown in Figures 1 and 2
respectively. Here, “\n” indicates a line break.
1 Figures 2 and 3 show examples of a character recognition result
and a manually written explanatory text (patent abstract). In this
[original]
半導体装置\n の製造方法\n 半導体層の上にフォ
トレジストを塗布\n 第 1 波長の紫外線を用いて
\n フォトレジストを露光した後に\n フォトレジ
ストを現像することによって、\n 開口部の内側
へと迫り出した\n ネガ型レジストパターンを形
成\n 第 1 波長より短い第 2 波長の紫外線を\n ネ
ガ型レジストパターンに照射することによって、
\n ネガ型レジストパターンを硬化\n(照射工程)\n
ネガ型レジストパターンが形成された\n 半導体
層の上に金属膜を形成\n ネガ型レジストパター
ン を 半 導 体 層 か ら 除 去 \n 完 成
\nP110\nP120\nP130\nP140\nP150
[translation]
Semiconductor devices \n Manufacturing method
for \n photoresist is applied over the semiconductor
layer \n using ultraviolet light of the first
wavelength \n After exposing the photoresist \n by
developing the photoresist, \n The photoresist is
developed to form a negative resist pattern that
extends into the aperture. \n Negative resist pattern
is formed. \n By exposing the negative resist pattern
to ultraviolet rays of the second wavelength, which
is shorter than the first wavelength \n by irradiating
the negative resist pattern, \n curing the negative
resist pattern by irradiating it with ultraviolet light
of the second wavelength, which is shorter than the
first wavelength. \n (Irradiation process) \n The
negative resist pattern is formed \n Metal film is
formed on top of the semiconductor layer \n
Negative resist pattern is removed from the
semiconductor layer \n Completion \n P110 \n
P120 \n P130 \n P140 \n P150
Figure 2: Character Recognition Results for the Image
in Figure 1.
(Step 3) Creation of data for machine learning</p>
      <p>
        We build an explanatory text generator by machine
learning, using pairs of character recognition results
and explanatory text from a large number of flowchart
images. In this process, we consider that data with
large differences between the character recognition
results and the manually written explanatory texts
(patent abstracts) are inappropriate as training data1;
therefore, we exclude these data. In this process, we
calculate the similarity between the character
recognition result and the explanatory text of the
flowchart image using Gestalt pattern matching [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
and use only the pairs that are above a threshold value
for training.
(Step 4) Construction of an explanatory text
generator using T5
      </p>
      <p>We build an explanatory text generator by the
language model T5. With respect to the flowchart
image in Figure 1, the input and output of T5 are Figure
2 for input and Figure 3 for output.
case, the similarity between them is so high that we use them as
machine learning data.
[original]
半導体装置の製造方法は、半導体層の上にフォト
レジストを塗布する工程と；第１波長の紫外線を
用いてフォトレジストを露光した後にフォトレジ
ストを現像することによって、開口部の内側へと
迫り出したネガ型レジストパターンを、形成する
工程と；第１波長より短い第２波長の紫外線をネ
ガ型レジストパターンに照射することによって、
ネガ型レジストパターンを硬化させる照射工程
と；照射工程を行った後、ネガ型レジストパター
ンの開口部から露出する半導体層の上に、ニッケ
ル（Ｎｉ）から主に成る金属膜を形成する工程
と；ネガ型レジストパターンを半導体層から除去
する工程とを備える。
[translation]
The method of manufacturing a semiconductor
device comprises the steps of: applying a
photoresist onto a semiconductor layer; forming a
negative resist pattern, which is pressed inwards
into an aperture, by developing the photoresist after
exposing the photoresist using a first wavelength of
ultraviolet light; forming a negative resist pattern by
irradiating the negative resist pattern with
ultraviolet light of a second wavelength that is
shorter than the first wavelength; and The negative
resist pattern is hardened by irradiating the
negative resist pattern with ultraviolet light of a
second wavelength shorter than the first
wavelength; forming a metal film mainly comprising
nickel (Ni) on the semiconductor layer exposed from
the opening of the negative resist pattern after
performing the irradiation process; and removing
the negative resist pattern from the semiconductor
layer. The process of removing the negative resist
pattern from the semiconductor layer.</p>
      <p>Figure 3: Explanatory Text (Patent Abstract)
Correspongind to the Image in Figure 1</p>
    </sec>
    <sec id="sec-6">
      <title>4. Experiments</title>
      <p>We performed some experiments to confirm the
effectiveness of our method.
4.1. Automatic Recognition of
Flowchart Images</p>
      <sec id="sec-6-1">
        <title>Data</title>
        <p>Using 7,099 randomly selected images from the
2018 edition of the Japanese Patent Public Gazette, we
manually identified whether they were flowcharts or
not and obtained 1,120 flowcharts from the 7,099
cases.</p>
      </sec>
      <sec id="sec-6-2">
        <title>Alternative methods</title>
        <p>As a baseline method, we used Keras, a deep
learning library, to build CNN training models with
three layers for Conv2D and two layers for
MaxPooling2D. As a comparison method, we used
seven CNN models: VGG16, VGG19, ResNet50,
InceptionV3, MobileNet, DenseNet169, and
DenseNet121 trained on a large image data set called
ImageNet.</p>
      </sec>
      <sec id="sec-6-3">
        <title>Evaluation</title>
        <p>The seven methods and the baseline method were
evaluated using Precision, Recall, and F-measure.</p>
      </sec>
      <sec id="sec-6-4">
        <title>Results</title>
        <p>The experimental results are shown in Table 1.
Among the compared methods, DenseNet121 was the
most accurate in detecting flowcharts in terms of
Precision. The results from DenseNet121 were used in
the subsequent experiments.</p>
        <sec id="sec-6-4-1">
          <title>4.2. Automatic Generation of Explanatory Text from Flowchart Images</title>
        </sec>
      </sec>
      <sec id="sec-6-5">
        <title>Data</title>
        <p>Among the Japanese patents published from 2010
to 2019, 11,188 patents that included flowcharts and
with a similarity of 0.1 by Gestalt pattern matching
were used in our experiments. Of these patents, 90%
were categorized as training data and the remainder as
validation and evaluation data.</p>
      </sec>
      <sec id="sec-6-6">
        <title>Hyperparameters</title>
        <p>The following hyperparameters were used in the
generation of explanatory texts by T5.
l Max input length: 280
l Max target length: 256
l Train batch size: 8
l Eval batch size: 8
l Num train epochs: 6</p>
      </sec>
      <sec id="sec-6-7">
        <title>Evaluation</title>
        <p>
          Our method was evaluated using the following
measures:
l ROUGE-N: This is the most basic index and is a
method of taking the degree of agreement in
Ngram units. In this case, N = 1, 2 were used for
evaluation (https://github.com/pltrdy/rouge).
l ROUGE-L: Evaluates the maximum sequence that
matches the generated summary and the
manually generated summary.
l BERTScore [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]: An automatic evaluation metric
using the language model BERT [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], which
calculates the similarity between texts using
vector representations obtained from pretrained
BERT.
        </p>
      </sec>
      <sec id="sec-6-8">
        <title>Results</title>
        <p>The results of Recall, Precision, and F-measure for
ROUGE-1, ROUGE-2, ROUGE-L, and BERTScore.</p>
      </sec>
      <sec id="sec-6-9">
        <title>Discussion</title>
        <p>For simple geometries with no branches in the
flowchart (see Figure 4), we obtained good analytical
results. Figures 5 and 6 show the explanatory text and
the patent summary (correct answer) generated by
our method, respectively.
[original]
測定治具を取り付ける取付工程と、複数のガス供
給箇所にて取付工程及び湿度測定工程を実行する
湿度測定工程と、複数のガス供給箇所での湿度測
定工程での測定結果に基づいて、水差発生箇所を
推定する水差推定工程と、を含む。
[translation]
The process includes a mounting process to install
the measurement jig, which is a humidity
measurement process to perform the mounting and
humidity measurement processes at multiple gas
supply locations, and a water-difference estimation
process to estimate the location of water-difference
occurrence based on the measurement results of the
humidity measurement process at multiple gas
supply locations.</p>
        <p>Figure 5: Exploratory Text Automatically Generated
from the Image in Figure 1
[original]
ガス供給箇所へ供給されるガスの流量を測定する
ガスメータの一次側へ連通接続する連通空間を有
すると共に当該連通空間の湿度を測定する湿度測
定部を有する水差推定治具を取り付ける取付工程
と、湿度測定部にて連通空間の湿度を測定する湿
度測定工程と、湿度測定工程にて測定される湿度
に基づいて、ガス管に水差しが発生しているか否
かを推定する水差推定工程とを実行する。
[translation]
The following processes are performed: An
installation process in which a water-difference
estimation jig is attached to a gas meter with a
connecting space that is connected to the primary
side of the gas meter that measures the flow rate of
gas supplied to the gas supply point and a humidity
measuring section that measures the humidity in the
connecting space; a humidity measurement process
in which the humidity in the connecting space is
measured by the humidity measuring section; and a
water-difference estimation process in which
whether a water drop occurs in a gas pipe is
estimated based on the humidity measured in the
humidity measurement process.</p>
        <p>Figure 6: Patent Summary for the Image in Figure 1
(Correct Answer)</p>
        <p>Flowcharts with complex shapes, such as the one
shown in Figure 7, tended to generate low-quality
explanatory text. The dash line boxes in the figure
were added by the author for the purpose of
explanation. The description generated by the process
in Figure 7 is shown in Figure 8.
[translation]
The system moves to the latent mode (s2110),
obtains the reliability information (s2110),
determines the variable magnification factor
(s2110), and starts measuring the elapsed time
(s2112). The image display then determines
whether or not the predetermined time has elapsed
(s2112). When the predetermined time elapses (yes
at s2112), the latent report mode is terminated
(s2112). When the latent report mode is terminated
(yes at s2112), the latent report mode is terminated.
Figure 8: Exploratory Text Automatically Generated
from the Image in Figure 7</p>
        <p>Looking at Figure 8, overall, step IDs such as s2110
do not correspond to the explanatory text, but this is
because this time the coordinates of each string in the
figure are not considered at all. The first conditional
branch is “When the predetermined time elapses (yes
at s2112), the latent report mode is terminated.” The
correct sentence is generated except for the step ID
(s2112) (see Figure 8). However, the dashed box in
Figure 5 is not included in the explanatory text.
Currently, the character strings output by Google
Cloud Vision’s character recognition results are used
as input to T5 as they are, but in the future, it will be
necessary to perform preprocessing such as
considering the coordinate information of the
character strings and reordering them appropriately.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>5. Conclusions</title>
      <p>In this study, 11,188 flowchart image-description
pairs were obtained from patents and these data were
used to construct a system that automatically
generates descriptions of flowchart images using T5.
The experimental results showed that for the detection
of flowchart images, an accuracy of 0.9645 was
achieved with a fine-tuned model using DenseNet121.
In the generation of explanatory text from flowchart
images, it was found that high-quality explanatory text
could be generated, although some issues remain for
flowcharts with complex shapes. In the future, we will
examine the possibility of generating appropriate
explanatory text for flowcharts with complex shapes,
such as those containing multiple conditional branches,
by considering the positional information of each
character string in the image, rather than using the
character strings in the flowchart as is.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgment</title>
      <p>This work was supported by JSPS KAKENHI Grant
Numbers JP22K12154 and JP20H04210.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Starlinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Brancotte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Cohen-Boulakia</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Leser</surname>
          </string-name>
          ,
          <article-title>Similarity Search for Scientific Workflows</article-title>
          ,
          <source>Proceedings of the VLDB Endowment</source>
          , Vol.
          <volume>7</volume>
          , No.
          <volume>12</volume>
          , pp.
          <fpage>1143</fpage>
          -
          <lpage>1154</lpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>F.</given-names>
            <surname>Piroi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lupu</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          ,
          <article-title>Overview of CLEF-IP 2013 Lab Information Retrieval in the Patent Domain, Information Access Evaluation. Multilinguality, Multimodality, and Visualization</article-title>
          .
          <source>CLEF 2013. Lecture Notes in Computer Science</source>
          , Vol.
          <volume>8138</volume>
          . Springer, Berlin, Heidelberg,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J. I.</given-names>
            <surname>Herrera-Cámara</surname>
          </string-name>
          ,
          <fpage>FLOW2CODE</fpage>
          - From Handdrawn Flowchart to Code Execution,
          <source>Master Thesis</source>
          ,
          <string-name>
            <surname>Texas</surname>
            <given-names>A</given-names>
          </string-name>
          &amp;M University,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sethi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sankaran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Panwar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Khare</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Mani</surname>
          </string-name>
          , DLPaper2Code:
          <article-title>Auto-generation of Code from Deep Learning Research Papers</article-title>
          ,
          <source>Proceedings of the 32th AAAI Conference on Artificial Intelligence</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          K. Choo,
          <article-title>AutoChart: A Dataset for Chart-to-Text Generation Task</article-title>
          ,
          <source>Proceedings of the International Conference on Recent Advances in Natural Language Processing</source>
          , pp.
          <fpage>1636</fpage>
          -
          <lpage>1644</lpage>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Obeid</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Hoque</surname>
          </string-name>
          ,
          <string-name>
            <surname>Chart-</surname>
          </string-name>
          to-Text:
          <article-title>Generating Natural Language Descriptions for Charts by Adapting the Transformer Model</article-title>
          ,
          <source>Proceedings of the 13th International Conference on Natural Language Generation</source>
          , pp.
          <fpage>138</fpage>
          -
          <lpage>147</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>H.</given-names>
            <surname>Tan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Tsai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            and
            <surname>Bansal</surname>
          </string-name>
          , Scientific Chart Summarization:
          <article-title>Datasets and Improved Text Modeling</article-title>
          ,
          <source>Proceedings of the AAAI-22 Workshop on Scientific Document Understanding</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Kantharaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. T.</given-names>
            <surname>Leong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Masry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Thakkar</surname>
          </string-name>
          , E. Hoque, and
          <string-name>
            <given-names>S.</given-names>
            <surname>Joty</surname>
          </string-name>
          ,
          <string-name>
            <surname>Chart-</surname>
          </string-name>
          to-Text:
          <article-title>A Large-Scale Benchmark for Chart Summarization</article-title>
          ,
          <source>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</source>
          , pp.
          <fpage>4005</fpage>
          -
          <lpage>4023</lpage>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Raffel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Roberts</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Narang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matena</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and P. J.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <article-title>Exploring the Limits of Transfer Learning with a Unified Text-to-</article-title>
          <string-name>
            <surname>Text</surname>
            <given-names>Transformer</given-names>
          </string-name>
          ,
          <source>Journal of Machine Learning Research</source>
          , Vol.
          <volume>20</volume>
          , No.
          <volume>140</volume>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>67</lpage>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Ratcliff</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Metzener</surname>
          </string-name>
          , Pattern Matching:
          <article-title>The Gestalt Approach</article-title>
          , Dr.
          <source>Dobb's Journal</source>
          , pp.
          <fpage>46</fpage>
          ,
          <year>1988</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kishore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          , and
          <string-name>
            <surname>Y</surname>
          </string-name>
          , Artzi, BERTScore:
          <article-title>Evaluating Text Generation with BERT</article-title>
          , arXiv:
          <year>1904</year>
          .
          <article-title>09675 [cs</article-title>
          .CL],
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of Deep Bidirectional Transformers for Language Understanding</article-title>
          ,
          <source>Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , p.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>