blob: c0536e2f17b9697f9a49f946e0e45506c101b152 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Name my Dragon - About</title>
<link rel="stylesheet" href="style.css">
</head>
<body>
<center>
<h1>How it works</h1>
<div class="container">
<img class="flex" src="images/pixel-lasso.jpeg" max-width="50%" alt="Pixel art of a cowboy lassoing a dragon.">
<div class="flex flex2" style="max-width: 500px; color: unset;">
<p>
This site uses word similarity to score all dragon names in terms of its
"closeness" to the given name.
The dragon name that is the "closest" is the one selected as the user's dragon.</p>
<p>
It uses three popular techniques to calculate similarity scores -
these are the <a href="https://en.wikipedia.org/wiki/Levenshtein_distance" target="_blank">Levenshtein Distance</a>,
<a href="https://en.wikipedia.org/wiki/Cosine_similarity" target="_blank">Cosine Similarity</a>,
and <a href="https://en.wikipedia.org/wiki/Jaccard_index" target="_blank">Jaccard Similarity</a>.
</p>
<p>
The final result shown to the user uses cosine similarity only,
but top ranking dragons from each of the other two techniques are
also shown as alternatives.
</p>
</div>
</div>
<a href="index.html">Home</a>
</center>
</body>
</html>
|
