diff options
| author | Kumar Damani <me@kumardamani.net> | 2024-08-14 04:49:54 +0000 |
|---|---|---|
| committer | Kumar Damani <me@kumardamani.net> | 2024-08-14 04:49:54 +0000 |
| commit | a223c3fdaa7861d5f932ba2079dab5dfcf63bec5 (patch) | |
| tree | fcc8a2f90926e640f2205f391681e7a0300bb3c8 /about.html | |
Initial commit
Diffstat (limited to 'about.html')
| -rw-r--r-- | about.html | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/about.html b/about.html new file mode 100644 index 0000000..c0536e2 --- /dev/null +++ b/about.html @@ -0,0 +1,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> |