Skip to content
Snippets Groups Projects
Commit 8db11b76 authored by Mathilde Verstraete's avatar Mathilde Verstraete
Browse files

finalisation embed

parent 4ffe4dde
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
PRODUCTION/2024_JADT/presentation/2024_JADT_en.html
+ 21
− 43
View file @ 8db11b76
......@@ -8,13 +8,13 @@
<link href="2024_JADT_en_files/libs/quarto-html/light-border.css" rel="stylesheet">
<link href="2024_JADT_en_files/libs/quarto-html/quarto-html.min.css" rel="stylesheet" data-mode="light">
<link href="2024_JADT_en_files/libs/quarto-html/quarto-syntax-highlighting.css" rel="stylesheet" id="quarto-text-highlighting-styles"><meta charset="utf-8">
<meta name="generator" content="quarto-1.4.551">
<meta name="generator" content="quarto-1.4.550">
<meta name="author" content="Yann Audin">
<meta name="author" content="Mathilde Verstraete">
<meta name="author" content="Dominic Forest">
<meta name="author" content="Marcello Vitali-Rosati">
<title>Literary Artificial Intelligence // Intelligence Artificielle Littéraire (IAL). Foramally defining the concept of the variatio in the Greek Anthology ?</title>
<title>Literary Artificial Intelligence // Intelligence Artificielle Littéraire (IAL). Defining formally the concept of the variatio in the Greek Anthology ?</title>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black-translucent">
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no, minimal-ui">
......@@ -350,7 +350,7 @@
<div class="slides">
<section id="title-slide" data-notes="" class="quarto-title-block center">
<h1 class="title">Literary Artificial Intelligence // <br>Intelligence Artificielle Littéraire (IAL). <br>Foramally defining the concept of the <em>variatio</em> in the <em>Greek Anthology</em> ?</h1>
<h1 class="title">Literary Artificial Intelligence // <br>Intelligence Artificielle Littéraire (IAL). <br>Defining formally the concept of the <em>variatio</em> in the <em>Greek Anthology</em> ?</h1>
<p class="subtitle">JADT 2024 – Brussels</p>
<div class="quarto-title-authors">
......@@ -402,8 +402,8 @@ Marcello Vitali-Rosati <a href="https://orcid.org/0000-0001-6424-3229" class="qu
</section>
<section>
<section id="the-ial-iterary-artificial-intelligence-project" class="title-slide slide level1 center" data-number="1">
<h1><span class="header-section-number">1</span> The IAL (iterary Artificial Intelligence) project</h1>
<section id="the-ial-literary-artificial-intelligence-project" class="title-slide slide level1 center" data-number="1">
<h1><span class="header-section-number">1</span> The IAL (Literary Artificial Intelligence) project</h1>
<ul>
<li>Chaire de recherche du Canada sur les Écritures numériques // <br>CRC On Digital Textualities;</li>
<li>Funded by the SSHRC (Social Sciences and HUmanities Research Council of Canada);</li>
......@@ -424,7 +424,7 @@ Marcello Vitali-Rosati <a href="https://orcid.org/0000-0001-6424-3229" class="qu
<ul>
<li>Apply data mining and natural language processing algorithms to formally define a literary concept (<span class="alert">the <em>variatio</em></span>) within a given corpus (<span class="alert">the <em>Greek Anthology</em></span>).</li>
</ul>
<p><strong>If the algorithm is able to find the variations we previously found, it incarns the definition of the given concept.</strong></p>
<p><strong>If an algorithm is able to find the same variations we previously found, it incarnates the definition of the given concept.</strong></p>
<div class="callout callout-note no-icon callout-titled callout-style-default">
<div class="callout-body">
<div class="callout-title">
......@@ -681,14 +681,14 @@ Ce graphe là a été fait 5x48 fois, on a gardé les 5 meilleurs résultats, à
<h2><span class="header-section-number">5.1</span> Cleaning and normalization</h2>
<p><span class="alert">48 combinations considered</span></p>
<ul>
<li><p>With or without anti-dictionary application</p></li>
<li><p>With or without case normalization</p></li>
<li><p>With or without punctuation removal</p></li>
<li><p>With or without accentuation suppression</p></li>
<li><p>With or without additional processing</p>
<li><p>With or without stopwords;</p></li>
<li><p>With or without case normalization;</p></li>
<li><p>With or without punctuation removal;</p></li>
<li><p>With or without accentuation suppression;</p></li>
<li><p>With or without additional processing:</p>
<ul>
<li>Rootization</li>
<li>Lemmatization</li>
<li>Stemming;</li>
<li>Lemmatization.</li>
</ul></li>
</ul>
<aside class="notes">
......@@ -709,8 +709,8 @@ Ce graphe là a été fait 5x48 fois, on a gardé les 5 meilleurs résultats, à
<h2><span class="header-section-number">5.2</span> Numerical representations</h2>
<p><span class="alert">4 representations considered</span></p>
<ul>
<li>(Binary) bag of words;</li>
<li>Bag of words (weighted tf-idf);</li>
<li>Bag of words (binary);</li>
<li>Bag of words (weighted, tf-idf);</li>
<li>Sets of bi-grams;</li>
<li>Sequential list.</li>
</ul>
......@@ -736,7 +736,7 @@ Ce graphe là a été fait 5x48 fois, on a gardé les 5 meilleurs résultats, à
}</style></aside>
<!-- Décrire chaque épigramme par un ensemble de mots -->
</section>
<section id="measures-of-similarity-between-pairs-of-epigrams" class="slide level2 smaller" data-number="5.3">
<section id="measures-of-similarity-between-pairs-of-epigrams" class="slide level2" data-number="5.3">
<h2><span class="header-section-number">5.3</span> Measures of similarity between pairs of epigrams</h2>
<p><span class="alert">5 measures considered</span></p>
<ul>
......@@ -802,7 +802,7 @@ Ce graphe là a été fait 5x48 fois, on a gardé les 5 meilleurs résultats, à
</thead>
<tbody>
<tr class="odd">
<td>(Binary) bag of words</td>
<td>Bag of words (binary)</td>
<td>Cosine Similarity</td>
<td style="text-align: center;">YES</td>
<td style="text-align: center;">YES</td>
......@@ -811,7 +811,7 @@ Ce graphe là a été fait 5x48 fois, on a gardé les 5 meilleurs résultats, à
<td>Racinisation</td>
</tr>
<tr class="even">
<td>(Binary) bag of words</td>
<td>Bag of words (binary)</td>
<td>Jaccard’s coefficient</td>
<td style="text-align: center;">NO</td>
<td style="text-align: center;">YES</td>
......@@ -1095,8 +1095,8 @@ les variations r et p est floue pour nous aussi
}</style></aside>
</section>
<section id="merci" class="title-slide slide level1 smaller scrollable" data-number="8">
<h1><span class="header-section-number">8</span> Merci !</h1>
<section id="thank-you-merci" class="title-slide slide level1 smaller scrollable" data-number="8">
<h1><span class="header-section-number">8</span> Thank you // Merci !</h1>
<div id="refs" class="references csl-bib-body hanging-indent" data-entry-spacing="0" role="list">
<div id="ref-carabantes_black-box_2020" class="csl-entry" role="listitem">
Carabantes, Manuel. 2020. <span>«&nbsp;Black-box artificial intelligence: an epistemological and critical analysis&nbsp;»</span>. <em>AI &amp; SOCIETY</em> 35 (2): 309‑17. <a href="https://doi.org/10.1007/s00146-019-00888-w">https://doi.org/10.1007/s00146-019-00888-w</a>.
......@@ -1441,24 +1441,6 @@ Waltz, Pierre. 1931. <em>Anthologie grecque. <span>Anthologie</span> <span>Palat
// clear code selection
e.clearSelection();
});
var localhostRegex = new RegExp(/^(?:http|https):\/\/localhost\:?[0-9]*\//);
var mailtoRegex = new RegExp(/^mailto:/);
var filterRegex = new RegExp('/' + window.location.host + '/');
var isInternal = (href) => {
return filterRegex.test(href) || localhostRegex.test(href) || mailtoRegex.test(href);
}
// Inspect non-navigation links and adorn them if external
var links = window.document.querySelectorAll('a[href]:not(.nav-link):not(.navbar-brand):not(.toc-action):not(.sidebar-link):not(.sidebar-item-toggle):not(.pagination-link):not(.no-external):not([aria-hidden]):not(.dropdown-item):not(.quarto-navigation-tool)');
for (var i=0; i<links.length; i++) {
const link = links[i];
if (!isInternal(link.href)) {
// undo the damage that might have been done by quarto-nav.js in the case of
// links that we want to consider external
if (link.dataset.originalHref !== undefined) {
link.href = link.dataset.originalHref;
}
}
}
function tippyHover(el, contentFn, onTriggerFn, onUntriggerFn) {
const config = {
allowHTML: true,
......@@ -1495,11 +1477,7 @@ Waltz, Pierre. 1931. <em>Anthologie grecque. <span>Anthologie</span> <span>Palat
try { href = new URL(href).hash; } catch {}
const id = href.replace(/^#\/?/, "");
const note = window.document.getElementById(id);
if (note) {
return note.innerHTML;
} else {
return "";
}
return note.innerHTML;
});
}
const findCites = (el) => {
......
PRODUCTION/2024_JADT/presentation/2024_JADT_en.qmd
+ 2
− 2
View file @ 8db11b76
......@@ -291,7 +291,7 @@ Pour ces 48 combinaisons, on a fait des représentations simplifiées :
<!-- Décrire chaque épigramme par un ensemble de mots -->
## Measures of similarity between pairs of epigrams {.smaller}
## Measures of similarity between pairs of epigrams
[5 measures considered]{.alert}
......@@ -503,7 +503,7 @@ What's next?
- Nous sommes en mesure de corréler la présence d’une variation stylistique avec la cooccurrence des termes, et plus précisément des fréquences similaires de formes autrement plus rares dans le reste du corpus (modélisé par la pondération tf-idf).
:::
# Merci !
# Thank you // Merci !
::: {#refs}
:::
\ No newline at end of file
PRODUCTION/2024_JADT/presentation/2024_JADT_en_embed.html
+ 19
− 19
View file @ 8db11b76
......@@ -447,7 +447,7 @@
<meta name="author" content="Mathilde Verstraete">
<meta name="author" content="Dominic Forest">
<meta name="author" content="Marcello Vitali-Rosati">
<title>Literary Artificial Intelligence // Intelligence Artificielle Littéraire (IAL). Foramally defining the concept of the variatio in the Greek Anthology ?</title>
<title>Literary Artificial Intelligence // Intelligence Artificielle Littéraire (IAL). Defining formally the concept of the variatio in the Greek Anthology ?</title>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black-translucent">
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no, minimal-ui">
......@@ -1167,7 +1167,7 @@ margin-right: 0; }
<div class="slides">
 
<section id="title-slide" data-notes class="quarto-title-block center">
<h1 class="title">Literary Artificial Intelligence // <br>Intelligence Artificielle Littéraire (IAL). <br>Foramally defining the concept of the <em>variatio</em> in the <em>Greek Anthology</em> ?</h1>
<h1 class="title">Literary Artificial Intelligence // <br>Intelligence Artificielle Littéraire (IAL). <br>Defining formally the concept of the <em>variatio</em> in the <em>Greek Anthology</em> ?</h1>
<p class="subtitle">JADT 2024 – Brussels</p>
 
<div class="quarto-title-authors">
......@@ -1219,8 +1219,8 @@ Marcello Vitali-Rosati <a href="https://orcid.org/0000-0001-6424-3229" class="qu
 
</section>
<section>
<section id="the-ial-iterary-artificial-intelligence-project" class="title-slide slide level1 center" data-number="1">
<h1><span class="header-section-number">1</span> The IAL (iterary Artificial Intelligence) project</h1>
<section id="the-ial-literary-artificial-intelligence-project" class="title-slide slide level1 center" data-number="1">
<h1><span class="header-section-number">1</span> The IAL (Literary Artificial Intelligence) project</h1>
<ul>
<li>Chaire de recherche du Canada sur les Écritures numériques // <br>CRC On Digital Textualities;</li>
<li>Funded by the SSHRC (Social Sciences and HUmanities Research Council of Canada);</li>
......@@ -1241,7 +1241,7 @@ Marcello Vitali-Rosati <a href="https://orcid.org/0000-0001-6424-3229" class="qu
<ul>
<li>Apply data mining and natural language processing algorithms to formally define a literary concept (<span class="alert">the <em>variatio</em></span>) within a given corpus (<span class="alert">the <em>Greek Anthology</em></span>).</li>
</ul>
<p><strong>If the algorithm is able to find the variations we previously found, it incarns the definition of the given concept.</strong></p>
<p><strong>If an algorithm is able to find the same variations we previously found, it incarnates the definition of the given concept.</strong></p>
<div class="callout callout-note no-icon callout-titled callout-style-default">
<div class="callout-body">
<div class="callout-title">
......@@ -1498,14 +1498,14 @@ Ce graphe là a été fait 5x48 fois, on a gardé les 5 meilleurs résultats, à
<h2><span class="header-section-number">5.1</span> Cleaning and normalization</h2>
<p><span class="alert">48 combinations considered</span></p>
<ul>
<li><p>With or without anti-dictionary application</p></li>
<li><p>With or without case normalization</p></li>
<li><p>With or without punctuation removal</p></li>
<li><p>With or without accentuation suppression</p></li>
<li><p>With or without additional processing</p>
<li><p>With or without stopwords;</p></li>
<li><p>With or without case normalization;</p></li>
<li><p>With or without punctuation removal;</p></li>
<li><p>With or without accentuation suppression;</p></li>
<li><p>With or without additional processing:</p>
<ul>
<li>Rootization</li>
<li>Lemmatization</li>
<li>Stemming;</li>
<li>Lemmatization.</li>
</ul></li>
</ul>
<aside class="notes">
......@@ -1526,8 +1526,8 @@ display:block!important;
<h2><span class="header-section-number">5.2</span> Numerical representations</h2>
<p><span class="alert">4 representations considered</span></p>
<ul>
<li>(Binary) bag of words;</li>
<li>Bag of words (weighted tf-idf);</li>
<li>Bag of words (binary);</li>
<li>Bag of words (weighted, tf-idf);</li>
<li>Sets of bi-grams;</li>
<li>Sequential list.</li>
</ul>
......@@ -1553,7 +1553,7 @@ display:block!important;
}</style></aside>
<!-- Décrire chaque épigramme par un ensemble de mots -->
</section>
<section id="measures-of-similarity-between-pairs-of-epigrams" class="slide level2 smaller" data-number="5.3">
<section id="measures-of-similarity-between-pairs-of-epigrams" class="slide level2" data-number="5.3">
<h2><span class="header-section-number">5.3</span> Measures of similarity between pairs of epigrams</h2>
<p><span class="alert">5 measures considered</span></p>
<ul>
......@@ -1619,7 +1619,7 @@ display:block!important;
</thead>
<tbody>
<tr class="odd">
<td>(Binary) bag of words</td>
<td>Bag of words (binary)</td>
<td>Cosine Similarity</td>
<td style="text-align: center;">YES</td>
<td style="text-align: center;">YES</td>
......@@ -1628,7 +1628,7 @@ display:block!important;
<td>Racinisation</td>
</tr>
<tr class="even">
<td>(Binary) bag of words</td>
<td>Bag of words (binary)</td>
<td>Jaccard’s coefficient</td>
<td style="text-align: center;">NO</td>
<td style="text-align: center;">YES</td>
......@@ -1912,8 +1912,8 @@ display:block!important;
}</style></aside>
</section>
 
<section id="merci" class="title-slide slide level1 smaller scrollable" data-number="8">
<h1><span class="header-section-number">8</span> Merci !</h1>
<section id="thank-you-merci" class="title-slide slide level1 smaller scrollable" data-number="8">
<h1><span class="header-section-number">8</span> Thank you // Merci !</h1>
<div id="refs" class="references csl-bib-body hanging-indent" data-entry-spacing="0" role="list">
<div id="ref-carabantes_black-box_2020" class="csl-entry" role="listitem">
Carabantes, Manuel. 2020. <span>« Black-box artificial intelligence: an epistemological and critical analysis »</span>. <em>AI &amp; SOCIETY</em> 35 (2): 309‑17. <a href="https://doi.org/10.1007/s00146-019-00888-w">https://doi.org/10.1007/s00146-019-00888-w</a>.
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment