blob: 138d1e93ab33bd6834a0932cb06b6a0e7db3ef8d (
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
36
37
38
39
40
41
42
|
<!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 from George R.R. Martin's
<a href="https://en.wikipedia.org/wiki/Game_of_Thrones" target="_blank">A Song of Ice and Fire</a>
universe in terms of their "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 in
<a href="https://en.wikipedia.org/wiki/Natural_language_processing" target="_blank">NLP</a>
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>
<footer>
<a href="index.html">Home</a><br>
<a href="https://kumardamani.net" target="_blank">Author</a>
</footer>
</center>
</body>
</html>
|
