<!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>Ital-IA</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>AI-supported Certification of Family-Friendly Organizations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Davide Vandelli</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sara Tonelli</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pietro Marzani</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessio Palmero Aprosio</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Psychology and Cognitive Science, University of Trento</institution>
          ,
          <addr-line>Corso Bettini 84, Rovereto</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Fondazione Bruno Kessler</institution>
          ,
          <addr-line>via Sommarive 18, Trento</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>5</volume>
      <fpage>23</fpage>
      <lpage>24</lpage>
      <abstract>
        <p>In the Autonomous Province of Trento, the certification issued by the Agency for Social cohesion to municipalities and companies to recognize their commitment to family-friendly solutions has become more and more popular over the years. However, the application process, which foresees the preparation of plans including several actions classified according to a taxonomy, is rather complex and may benefit from domain knowledge coming from plans already in place. To address this requirement, we have designed an AI-supported platform that assists operators in preparing plans by suggesting information on action categories and on plans submitted by similar organizations. It also provides an analytical tool for the Agency to perform periodic revisions of the taxonomy of actions and suggest changes in the categories. The first version of the tools has been assessed by stakeholders, who have appreciated the integration of NLP-based suggestion tools in the process without altering too much the submission workflow.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;NLP</kwd>
        <kwd>deep learning</kwd>
        <kwd>classification</kwd>
        <kwd>family friendly</kwd>
        <kwd>taxonomy</kwd>
        <kwd>certification</kwd>
        <kwd>plan of action</kwd>
        <kwd>public administration</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>In the Autonomous Province of Trento, a considerable part of the activities of the Agency for Social
Cohesion, the structure responsible for the implementation of family policies, concerns the development
and dissemination of a system of “family brands”, i.e. certifications that recognize the commitment
of public and private organizations in adopting family-friendly solutions for their staf and for the
families residing in their territory. To obtain this certification, municipalities and companies (henceforth
organizations) have to submit to the Agency for Social Cohesion a “family plan”, where a list of activities
indicates what the organization is committed to for implementing work-life balance or family-friendly
measures, depending on their range of action. If the plan is approved, a“family brand” is acknowledged
to the organization. Two types of “family brands” are provided: the Family Audit certification for
companies, and the Family in Trentino label for municipalities, thus putting in place services that
respond to the needs and expectations expressed by families in the area as eforts from the public
and private sector. These initiatives have also begun to spread from Trentino (100 municipalities) to
the national level, with 60 municipalities receiving the Family in Italy label and approximately 150
organizations certified under the Family Audit scheme.</p>
      <p>The certification process started in 2008 and enabled the collection of a database of information:
the Family Audit plans submitted by companies contain more than 9, 000 work-life balance actions
adopted in favor of their staf by 320 companies nationwide. The municipal plans submitted by more
than 100 Family certified municipalities in Trentino, contain instead more than 4, 000 actions. Actions
are classified based on a taxonomy that is specific to each certification in both types of “family brands”.</p>
      <p>Given the increasing success of the “family brands” and the growing number of organizations who
would like to obtain the certification at national level, it is important to implement a workflow to create
and submit the plans that ensures consistency across diferent operators and enables taking advantage of
existing knowledge about past plans. Indeed, the plans to obtain Family Audit certification and the Family
in Trentino label are already submitted electronically via a platform (see Section 2), but each operator
starts the process from scratch and cannot see what other organizations did. Also, the process is fully
manual. In this framework, the project “PNC-A.1.3- Digitalizzazione della pubblica amministrazione
della Provincia autonoma di Trento” aims to create an Artificial Intelligence (AI) solution specifically
designed to support operators in submitting the plans and to allow the Agency for Social Cohesion to
monitor the submitted requests.1 The solution proposes a re-design of the current platforms so that
writing and submitting a plan will be supported and guided by an LLM-based dialogue system, which
will trigger diferent NLP components. In the remainder of this paper we will focus mainly on the
description of such components which will provide i) similarity scores between organizations, ii) action
classification and iii) suggestions for taxonomy modifications (Section 3).</p>
    </sec>
    <sec id="sec-2">
      <title>2. Family in Trentino Platforms: Current State</title>
      <p>The planning tools that allow the submission of the plans use two separate online management systems:
the GeAPF platform for the Family Audit certification and the Family Plan platform for the Family in
Trentino label. Each organization must prepare a plan that consists of several actions, descriptions
and objectives to be achieved, each addressing diferent aspects of family support. In the case of
municipalities (Family in Trentino) it is a yearly submittal, while for companies (Family Audit) the plan
is submitted only at the beginning of the process scheme. When entering new actions in the plans, the
compiler is asked to provide a textual description of the actions themselves and to classify each of them
within a given taxonomy of actions. For example, an action could be:</p>
      <p>“L’amministrazione comunale intende introdurre una nuova agevolazione per famiglie numerose nelle
tarife del servizio asili nido, in particolare la riduzione della quota fissa mensile in caso di ammissioni di
fratelli o sorelle nella misura del 15% per il terzo fratello ammesso e seguenti”</p>
      <p>In this case, the taxonomy label would be Agevolazioni specifiche per famiglie numerose , which belongs
to the Misure economiche macro-category. This classification plays a crucial role because it allows for
aggregations and analyses of the input data. For instance, the Agency for Social Cohesion can monitor
the data provided by the various organizations and use their outcomes to design additional policies. The
taxonomy also serves as a guide for those responsible for drafting the plan, who can draw inspiration
from its categories to design actions to be implemented within their organization.</p>
      <p>The presence of a reference taxonomy for family plan actions is a valuable element. However, analysis
of the use of this taxonomy shows several limitations. In particular, the independent compilation of
plans by organization leaders results in diferences of interpretation in the application of the taxonomy’s
items, also fostered by the very nature of the taxonomy, which is considered a complex and overly
populated tool (about 200 entries). In order to be efective, the taxonomy must be a flexible and dynamic
tool that adapts to the specific situations in the territories and that is enriched as organizations identify
new types of actions. Therefore, the development of tools that can support both the efective use of the
taxonomy by individual organizations, as well as the maintenance and evolution of the taxonomy itself
over time, is essential.</p>
      <p>Annotation according to the given taxonomy is not the only aspect in which plan entry by the
organizations’ operators can be improved: even the descriptive part is often presented diferently by
diferent organizations, both in terms of content structure and of detail and quality of the content
itself. An appropriate support tool can qualitatively improve the descriptions provided, while helping
operators in the use of the system. Advanced features can also help identify actions of interest to a
particular organization, for example by suggesting possible relevant actions developed by other similar
organizations.
1Other activities foreseen in the project involve the domains of protezione civile and tourism but we do not address them in
this paper.</p>
    </sec>
    <sec id="sec-3">
      <title>3. AI-Supported Platform</title>
      <p>The technological solution developed within the project “PNC-A.1.3- Digitalizzazione della pubblica
amministrazione della Provincia autonoma di Trento” foresees the implementation of a platform where
some functionalities are enabled when operators log in, while some others are active only for the Agency
of Social Cohesion. Indeed, the platform supports both the submission of family plans to obtain a Family
Audit (for public and private organizations) or Family in Trentino (for municipalities) certification, and
the monitoring of the plans by the Agency of Social Cohesion. After login, an operator can start the
process to submit a plan and optionally ask to be supported by AI. If this option is selected, a chatbot
will be activated, which will provide suggestions and support in writing the plan. The operator can ask
to take inspiration from plans submitted by other similar organizations in the past, which activates
the tool for the suggestion of similar organizations (Section 3.1). When entering the actions that an
operator plans to undertake to obtain the certification, a second component can be triggered suggesting
one or more categories to be associated with each action (Section 3.2). A third additional component
is available only to the Agency of Social Cohesion personnel, which matches the taxonomy with the
submitted actions and suggests changes to the taxonomy itself, such as label deletion, insertion or
merging (Section 3.3). The three components are detailed below.</p>
      <sec id="sec-3-1">
        <title>3.1. Suggestion of Similar Organizations</title>
        <p>While entering a new plan, an organization may want to check what other similar organizations have
done in the past and which activities others have proposed. This would provide an opportunity to take
a look at actions by other organizations, ofering records of replicable successful cases. We implement a
component that, given an organization in input and one or more similarity criteria, outputs a ranked
list of similar organizations. For municipalities and organizations, similarity can be computed based in
the criteria shown in Table 1.</p>
        <p>
          We computed the similarity as the inverse of the scaled pairwise Euclidean distance for numerical
data, and the Jaccard similarity coeficient score for categorical data. In the numerical case, we end
up assigning a similarity that is inversely proportional to the distance between two organizations – a
greater distance results in a proportionally smaller similarity. The distance is computed iterating over all
combinations of organizations in  ∈ R as  = {| −  | | 1 ≤  &lt;  ≤ } where the flat vector
 = ()=1 represents the pair combinations of the organizations considered. Then,  is linearly
scaled as ′ = [ − min()]/[max() − min()] for  ∈ 1, ..., . Ultimately, the inverse of the scaled
distance  ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] is turned into an intuitive pairwise similarity by  = 1/(1 + ′) for  ∈ 1, ..., .
        </p>
        <p>In the case of categorical data the size of the intersection of the sets describing two organizations is
used as the similarity between them, also known as the Jaccard index. Each organization carries a set
of categories  ⊆  , where  contains the set of possible categories (e.g. the taxonomy). For each
of the categorical parameters, we iterate over combinations in  still by indexing its elements with
1 ≤  &lt;  ≤  as  = ()=1, where  = | ∩  | / | ∪  |, for  = 1, . . . , .</p>
        <p>
          With the latter computation, we end up with the proportion of common elements between two
organizations. Since the size | · | of the intersection is normalized by the size of the union in the previous
equation, the categorical similarity exists by construction as  ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ] ∀ .
        </p>
        <p>All similarity scores presented allow for ranking where 1 is the maximum similarity possible and
0 is the lowest. The results shown to the user display the most similar organization to another upon
demand. For example, a Municipality operator can obtain a list of most similar Municipalities based on
geographical and demographic parameters, and if their own Municipality has submitted plans in the
past they may be included in the similarity ranking as well. In Table 2 we show the results obtained for
the small city of Aldeno (TN). Aldeno participated in Family in Trentino, and we display its similarities
using the average for geo-demographic and for past plan parameters - even though the operator has
also access to the individual similarities for each parameter. The similarity can also be computed for
municipalities that did not participate (yet), and may want to have a data-informed ranking of which
are the most similar municipalities, given that only geo-demographic data is available. An operator can
also weight the diferent parameters diferently. For example, they may decide how much the altitude
or the similarity between past actions etc. should impact the final result.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Action Classification</title>
        <p>The creation of family support plans foresees the description of actions that the organization commits
to carry out to be family-friendly, together with the assignment of one or more categories taken from a
pre-defined taxonomy, that is diferent in the case of companies and municipal proponents.</p>
        <p>
          For classification, given the availability of enough submitted plans, we choose a supervised framework.
Specifically, we fine-tune a Bidirectional Encoder Representations from Transformers (BERT) pre-trained
on Italian corpora, known as BERT Base Italian XXL2, inspired by the promising results obtained in a
similar classification task in Italian [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
        </p>
        <p>
          The training data for the classification of actions submitted by municipalities and by companies are
diferent, also because of diferences in the underlying taxonomies. The data has been collected just
over 14 years of planning activity (2008-2022). To avoid data leaks between training, validation and
test sets, some preprocessing was required. First, we removed duplicates in the text descriptors and
extremely similar descriptors (using an adjusted version of the tool reported in 3.3) so as to not have
the tests be corrupted by the presence of identical observations both in the training and the test set. We
know that some of the organizations involved would re-use actions from one previous plan to another
if actions lasted multiple years, hence the presence of duplicates or extremely similar descriptors. The
ifnal dataset contains 18,102 (80 labels) observations for municipalities, and 11,483 observations (133
labels) for companies. The total number of labels does not correspond to the number of classes in
the respective taxonomies because we removed the categories with less than three instances. We use
the same classification framework (i.e. multiclass) with some adjustments per data. The training data
from companies that actually have multiple labels are present in 34% of the observations, so the final
model assigns more than one label, while Municipalities’ data only have one category per observation.
Given the training data, the loss of choice for training is the Cross Entropy Loss and its variation for
2https://huggingface.co/dbmdz/bert-base-italian-xxl-uncased
multi-label setting (Binary Cross Entropy Loss), through PyTorch’spackage [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. In our multi-label case,
where  is the batch size and the BCE is reduced to the batch mean. Given a multi-label vector ,
=1 , where  = − [︀  · log() + (1 − ) · log(1 − )]︀ and where predictions
ℓ(, ) = 1 ∑︀
 are the model raw output passed through a sigmoid function.
        </p>
        <p>In both classification tasks, the training data is ≈ 65% of the dataset, the validation set is ≈ 15%,
and the remaining ≈ 20% is the test set. They were split via stratified sampling, so that the category
distribution is preserved in the three splits.</p>
        <p>
          Results. The classifier performance is evaluated using  1 weighted by the frequency of the label
classes. The computation of the metric is obtained through Sci-Kit learn [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. In Table 4 we report the
classifier performances both on the validation and the test set. As expected, multi-label classification on
companies’ actions is less accurate than single-label classification of municipalities’ actions. However,
results are rather promising considering the sheer number of labels to predict. Furthermore, this
classification is not meant to replace human labeling but only to assist and speed-up the process, so we
may consider presenting to final users not only one label but the list of those classified with highest
confidence.
        </p>
        <p>
          We perform a further analysis by generating
the Precision-Recall curve for the two tasks,
which is displayed in Figure 1. Each point Table 3: Performance results for Italian BERT on
in the curve is the intersection of the preci- Municipalities (single-label) and
Compasion and of the recall of the predicted labels nies (multi-label)
given diferent thresholds for activation func- Metric Single Multi
tion. The highest 1 obtained analyzing these val. test val. test
curves represents the point of best trade-of
between prediction and recall. According to our F1 (micro) 0.754 0.729 0.701 0.688
analysis, the best activation function threshold Precision (micro) 0.755 0.731 0.743 0.746
for the single-label trained model is relatively Recall (micro) 0.753 0.727 0.663 0.638
high: 0.94. Overall, the two curves are
reasonably similar, although the best activation
threshold for the multi-label model is 0.35. The fact that the single-label trained model performs best
with such a high activation function threshold, far from the default 0.5, indicating that the architecture
is prone to overconfidence in this setting. However, this is a known phenomenon in most BERT-based
[
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] and other deep learning models [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. When this issue is diagnosed in the predictions on out of
domain observations, there are usually counteracting measures that are applied in diferent phases
of the model development. One of them is post-training temperature scaling [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], not as efective as
simply changing the activation function threshold, as informed by the PR curve. On the other hand, a
completely diferent result occurs in the multi-label setting, where labels are predicted underconfidently ,
a phenomenon that has occurred also in multi-label Bayesian Neural Networks [7]. We speculate it
may be due to the specific nature of the data: since most of the multi-label observations do not actually
have more than one label (66%), it may be that the model learned to predict the least amount of labels
for observations in order to be as close as possible to the real data.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Suggestion of Changes in the Taxonomy</title>
        <p>A third component aimed at assisting operators in using the platform is meant only for the Agency
of Social Cohesion, to support periodic revisions of the taxonomies and perform consistency checks
on the submitted plans. Specifically, given a taxonomy and the database of past submitted plans, the
tool suggests categories to be removed, to be merged or to be split. The three suggestions types are
computed through an algorithmic procedure that analyses past submitted plans and identifies:
1. Taxonomy categories that are used less than  times (with  being defined by the user): candidates
for deletion
2. Taxonomy categories that are used too frequently, meaning that they may be too broad: candidates
for splitting</p>
        <p>3. Taxonomy categories that are diferent but are used to label similar actions: candidates for merging
or refinement</p>
        <p>The first two suggestions are straightforward to compute, since they are based on a frequency
analysis of the actions in submitted plans, which first identifies the most- and least-frequent actions
categories and then retrieves the corresponding labels from the taxonomy. For example, if we consider
the Family in Trentino certification, municipalities have used only once in past years the categories
Co-progettazione attivita del progetto strategico del Distretto famiglia and Violenza di genere: Servizi
di supporto per uomini maltrattanti. These initiatives are not popular choices and the Agency, upon
inspection of the descriptive statistic, may consider removing a specific category that just covers
these cases. Concerning the top-frequent categories, Sostegno economico alle associazioni del territorio
/ Concessione spazi has been used 1, 146 times in past years and the tool suggests to split it into two
ifner-grained categories, and just like it a handful of others have been thoroughly used. These could
probably be Sostegno economico alle associazioni del territorio and Concessione spazi alle associazioni del
territorio.</p>
        <p>As regards the third type of suggestions, concerning merging or refining categories, it requires the
implementation of a specific algorithm, aimed at detecting actions in the submitted plans that are
similar but that have been manually labeled with diferent taxonomy categories. This may be due
to an operators’ mistake, but also to the presence in the taxonomy of classes that may be merged or
revised because too similar. To compute pairwise similarity between actions descriptions we used the
fuzzywuzzy library 3, which is based on the inverse of the Levenshtein (edit) distance between two
strings, i.e. between 0 and 100. We compute a specific score named token set ratio: first, words are
tokenized and only unique tokens are kept, then the inverse of the Levenshtein distance is computed.
With this method, two strings are scored 100 if they are essentially identical texts, while greatly
dissimilar strings result in a score of ≈</p>
        <p>30 or lower.</p>
        <p>More specifically, the algorithm is implemented as follows. Let the data be composed of observations
with descriptors  for the actions written by operators such as descriptions, titles, etc. The data
represents all participating organizations .</p>
        <p>• For each organization  in set of organizations :
sorted combinations of action descriptors in  = ()=1.
1. Retrieve all elements  as descriptor-category pairs from organization , where we define
2. As the result of symmetric function fuzzy(· ), compute vector  containing pairwise
fuzzy}︀ over all possible unique
3. Filter the tuples in  based on fuzzywuzzy score with an arbitrary threshold  denoted as ′
4. Return ′
• After iterating for all organizations, return set  , composed by all vectors with triples  = ⋃︀ ′.</p>
        <p>The frequencies of matches inserted in  are be counted for aggregative measures indicating the
overall usage of categories and actions descriptors for all participating organizations. On a computational
expense note, the algorithm complexity is highly dependent on the length of the strings and the distance
used in item 2, even if it is lessened by lightly preprocessing on the text (stripping strings from
punctuation and Italian stop words), and processing using fuzzywuzzy’s set method (removes duplicate
elements from the string). However, it is using as much time as the average case scenario [8], even
though it is more eficient than its “sibling” method Sequence matching [ 9]. We obtained similar results
using smaller strings: titles, instead of descriptions, are shorter descriptors, and while some information
is lost, they are usually still indicative enough to indicate miscategorisation. In the step 3, our threshold
for satisfactory similarity is  = 75, in which most of the elements of the descriptor match other’s,
besides a few changes. We compare actions submitted over the years by the same organisations because
it is more likely to find similar descriptions compared to diferent organisations. While a lower threshold
contributes to avoid redundant or undesirable matches, one can also set an upper boundary in case
exactly identical or too similar descriptors are not of interest.</p>
        <p>The use of this metric has proven to yield interesting results. For instance, actions with high similarity
have been found almost 50 times in the plans submitted by municipalities as being labeled with two
diferent labels, either</p>
        <p>Servizi doposcuola e servizi estivi or Centri di aggregazione per giovani. This
suggests that the two categories in the taxonomy should be revised by domain experts and possibly
redefined. This revision of the data is useful also to improve the classifier performance, since similar
descriptions bearing diferent labels would probably introduce noise when training the classification
model.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions and Future work</title>
      <p>In this work we presented a series of tools for data-informed decisions in the public administration
domain. In particular, we detailed three components that are meant to support the process undertaken
by municipalities and companies to obtain a family-friendly certification. We implemented NLP tools
for text classification, similarity computation and taxonomy analysis that to our knowledge were never
applied to this domain before. While their first implementation is completed, they still require further
qualitative testing and improvements in terms of robustness.</p>
      <p>The similarity tool described in Section 3.1 is not only designed for the user to visualize the most
similar organizations, but it is also meant to be integrated into another tool – LLM-based dialogue
system for the preparation of plans. Given an organization of interest, the system shall retrieve the
plans submitted by the most similar organizations, as a basis to inform text generation with more
specific context and documentation. The tool to compute similarity indices between organizations will
be extended in the future to include new sources of information, especially related to services available
in diferent municipalities. Its statistical expressive power may also be refined by implementing more
robust kernel similarity measures, as the (inverse) of an euclidean distance is a dissimilarity measure
[10] but does not correspond to some inner product in the feature space. The deep learning classifier
reported in Section 3.2 is publicly available for further training and reuse.4 Given its flexibility, it can
be easily retrained to adapt to changes in the taxonomy or to integrate updates of the database of
submitted plans. It may also be used in other projects that share the same data setting: Italian-language
descriptors, action-based datapoints, and a large taxonomy. Its overconfidence shall be tackled using
adaptive measures to prevent it while training, such as label smoothing, loss regularization [11], and
tempered loss [12].</p>
      <p>Ultimately, the quality of the tools will be assessed by stakeholders from Agency for Social Cohesion
and municipalities during five stakeholders’ meetings before the end of the project (Fall 2025).</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work is part of the project "AIxPA – Artificial Intelligence for Public Administration" , funded
within the Flagship Project PNC-A.1.3 – Digitalization of the Public Administration of the Autonomous
Province of Trento, CUP: C49G2200102000.</p>
    </sec>
    <sec id="sec-6">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used Chat-GPT in order to: format tables and tidy
command syntax in LATEX. After using these tool(s)/service(s), the author(s) reviewed and edited the
content as needed and take(s) full responsibility for the publication’s content.
[7] F. Rewicki, J. Gawlikowski, Estimating uncertainty of deep learning multi-label classifications
using laplace approximation, in: IGARSS 2022 - 2022 IEEE International Geoscience and Remote
Sensing Symposium, IEEE, 2022, pp. 1560–1563.
[8] G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys 33 (2001)
31–88. doi:10.1145/375360.375365.
[9] G. A. Rao, G. Srinivas, K. Rao, P. P. Reddy, Characteristic mining of mathematical formulas
from document - a comparative study on sequence matcher and levenshtein distance procedure,
International Journal of Computer Sciences and Engineering 6 (2018) 400–404. URL: http://dx.doi.
org/10.26438/ijcse/v6i4.400404. doi:10.26438/ijcse/v6i4.400404.
[10] C. Scheidt, J. Caers, Representing spatial uncertainty using distances and kernels, Math. Geosci.</p>
      <p>41 (2009) 397–419.
[11] D.-B. Wang, L. Feng, M.-L. Zhang, Rethinking calibration of deep neural networks: Do not
be afraid of overconfidence, in: M. Ranzato, A. Beygelzimer, Y. Dauphin, P. Liang, J. W.
Vaughan (Eds.), Advances in Neural Information Processing Systems, volume 34, Curran
Associates, Inc., 2021, pp. 11809–11820. URL: https://proceedings.neurips.cc/paper_files/paper/2021/
ifle/61f3a6dbc9120ea78ef75544826c814e-Paper.pdf.
[12] F. Wang, S. Mizrachi, M. Beladev, G. Nadav, G. Amsalem, K. L. Assaraf, H. H. Boker,
MuMIC – multimodal embedding for multi-label image classification with tempered sigmoid (2022).
arXiv:2211.05232.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rovera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Aprosio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Greco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lucchese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Tonelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Antetomaso</surname>
          </string-name>
          ,
          <article-title>Italian legislative text classification for gazzetta uficiale</article-title>
          ,
          <source>in: Proceedings of the Natural Legal Language Processing Workshop</source>
          <year>2023</year>
          ,
          <year>2023</year>
          , pp.
          <fpage>44</fpage>
          -
          <lpage>50</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Paszke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Massa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lerer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bradbury</surname>
          </string-name>
          , G. Chanan,
          <string-name>
            <given-names>T.</given-names>
            <surname>Killeen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Gimelshein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Antiga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Desmaison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kopf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>DeVito</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Raison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tejani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chilamkurthy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Steiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chintala</surname>
          </string-name>
          ,
          <string-name>
            <surname>Pytorch:</surname>
          </string-name>
          <article-title>An imperative style, highperformance deep learning library</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          <volume>32</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2019</year>
          , pp.
          <fpage>8024</fpage>
          -
          <lpage>8035</lpage>
          . URL: http://papers.neurips.cc/paper/ 9015-pytorch
          <article-title>-an-imperative-style-high-performance-deep-learning-library</article-title>
          .pdf.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nothman</surname>
          </string-name>
          , G. Louppe,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , E. Duchesnay,
          <article-title>Scikit-learn: Machine learning in python (</article-title>
          <year>2012</year>
          ). URL: https://arxiv.org/abs/1201.0490. doi:
          <volume>10</volume>
          .48550/ARXIV.1201.0490.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>C.</given-names>
            <surname>Guo</surname>
          </string-name>
          , G. Pleiss,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Sun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. Q.</given-names>
            <surname>Weinberger</surname>
          </string-name>
          ,
          <article-title>On calibration of modern neural networks (</article-title>
          <year>2017</year>
          ). arXiv:
          <volume>1706</volume>
          .
          <fpage>04599</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Xie</surname>
          </string-name>
          , H. Cheng, L. Feng,
          <string-name>
            <given-names>B.</given-names>
            <surname>An</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>Mitigating neural network overconfidence with logit normalization</article-title>
          , in: K. Chaudhuri,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jegelka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Szepesvari</surname>
          </string-name>
          , G. Niu, S. Sabato (Eds.),
          <source>Proceedings of the 39th International Conference on Machine Learning</source>
          , volume
          <volume>162</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>23631</fpage>
          -
          <lpage>23644</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Mozafari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. S.</given-names>
            <surname>Gomes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Leão</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Janny</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Gagné</surname>
          </string-name>
          ,
          <article-title>Attended temperature scaling: A practical approach for calibrating deep neural networks (</article-title>
          <year>2018</year>
          ). arXiv:
          <year>1810</year>
          .11586.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>