├── .dockerignore ├── static ├── assets │ ├── favicon.ico │ ├── favicon-16x16.png │ ├── favicon-32x32.png │ ├── android-chrome-192x192.png │ ├── android-chrome-512x512.png │ ├── site.webmanifest │ ├── js │ │ ├── nearest1k.js │ │ ├── secretWords.js │ │ ├── semantle.js │ │ └── clipboard.js │ └── styles.css └── index.html ├── word2vec ├── train.sh └── train.py ├── .gitignore ├── docker-compose.yml ├── conf.d └── semantle-tr.conf ├── requirements.txt ├── Dockerfile ├── dump-vecs.py ├── templates └── top1k.html ├── README.md ├── store-hints.py ├── dump-hints.py ├── semantle.py ├── LICENSE.md └── COPYING /.dockerignore: -------------------------------------------------------------------------------- 1 | venv 2 | word2vec 3 | -------------------------------------------------------------------------------- /static/assets/favicon.ico: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/frozsgy/semantle-tr/HEAD/static/assets/favicon.ico -------------------------------------------------------------------------------- /static/assets/favicon-16x16.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/frozsgy/semantle-tr/HEAD/static/assets/favicon-16x16.png -------------------------------------------------------------------------------- /static/assets/favicon-32x32.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/frozsgy/semantle-tr/HEAD/static/assets/favicon-32x32.png -------------------------------------------------------------------------------- /static/assets/android-chrome-192x192.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/frozsgy/semantle-tr/HEAD/static/assets/android-chrome-192x192.png -------------------------------------------------------------------------------- /static/assets/android-chrome-512x512.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/frozsgy/semantle-tr/HEAD/static/assets/android-chrome-512x512.png -------------------------------------------------------------------------------- /word2vec/train.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | wget -c https://dumps.wikimedia.org/trwiki/latest/trwiki-latest-pages-articles.xml.bz2 3 | python train.py -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | word2vec.db 2 | word2vec.db-shm 3 | word2vec.db-wal 4 | nearest.pickle 5 | venv/ 6 | .idea/ 7 | *.xml.bz2 8 | wikipedia-out.txt 9 | wikipedia-vector.bin -------------------------------------------------------------------------------- /static/assets/site.webmanifest: -------------------------------------------------------------------------------- 1 | {"name":"","short_name":"","icons":[{"src":"/android-chrome-192x192.png","sizes":"192x192","type":"image/png"},{"src":"/android-chrome-512x512.png","sizes":"512x512","type":"image/png"}],"theme_color":"#ffffff","background_color":"#ffffff","display":"standalone"} -------------------------------------------------------------------------------- /docker-compose.yml: -------------------------------------------------------------------------------- 1 | version: '3.3' 2 | services: 3 | semantle-tr: 4 | container_name: semantle-tr 5 | build: . 6 | networks: 7 | - web_nw 8 | nginx: 9 | container_name: semantle-tr-nginx 10 | image: "nginx:1.13.5" 11 | ports: 12 | - "80:80" 13 | volumes: 14 | - ./conf.d:/etc/nginx/conf.d 15 | networks: 16 | - web_nw 17 | depends_on: 18 | - semantle-tr 19 | networks: 20 | web_nw: 21 | driver: bridge -------------------------------------------------------------------------------- /conf.d/semantle-tr.conf: -------------------------------------------------------------------------------- 1 | server { 2 | listen 80; 3 | server_name localhost; 4 | 5 | location / { 6 | proxy_set_header Host $host; 7 | proxy_set_header X-Real-IP $remote_addr; 8 | proxy_set_header X-Forwarded-For $proxy_add_x_forwarded_for; 9 | proxy_set_header X-Forwarded-Proto $scheme; 10 | proxy_set_header Host $http_host; 11 | 12 | proxy_pass http://semantle-tr:5005; 13 | } 14 | } 15 | 16 | -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | aniso8601==9.0.1 2 | black==22.1.0 3 | click==8.0.3 4 | Flask==2.0.3 5 | Flask-RESTful==0.3.6 6 | future==0.17.1 7 | gensim==4.1.2 8 | gunicorn==20.1.0 9 | itsdangerous==2.0.1 10 | Jinja2==3.0.3 11 | joblib==1.1.0 12 | MarkupSafe==2.0.1 13 | more-itertools==8.12.0 14 | mypy-extensions==0.4.3 15 | nltk==3.6.7 16 | numpy==1.22.1 17 | pathspec==0.9.0 18 | platformdirs==2.5.1 19 | pytz==2021.3 20 | regex==2022.1.18 21 | scipy==1.7.3 22 | six==1.16.0 23 | smart-open==5.2.1 24 | tomli==2.0.1 25 | tqdm==4.62.3 26 | typing_extensions==4.1.1 27 | Werkzeug==2.0.2 28 | -------------------------------------------------------------------------------- /Dockerfile: -------------------------------------------------------------------------------- 1 | # For more information, please refer to https://aka.ms/vscode-docker-python 2 | FROM python:3.9-slim-buster 3 | 4 | # Keeps Python from generating .pyc files in the container 5 | ENV PYTHONDONTWRITEBYTECODE=1 6 | 7 | # Turns off buffering for easier container logging 8 | ENV PYTHONUNBUFFERED=1 9 | 10 | # Install pip requirements 11 | COPY requirements.txt . 12 | RUN pip3 install --no-cache-dir -r requirements.txt 13 | 14 | WORKDIR /app 15 | COPY . /app 16 | 17 | EXPOSE 5005 18 | 19 | RUN adduser -u 5678 --disabled-password --gecos "" appuser && chown -R appuser /app 20 | USER appuser 21 | 22 | # During debugging, this entry point will be overridden. For more information, please refer to https://aka.ms/vscode-docker-python-debug 23 | CMD ["gunicorn", "--bind", "0.0.0.0:5005", "semantle:app"] -------------------------------------------------------------------------------- /static/assets/js/nearest1k.js: -------------------------------------------------------------------------------- 1 | function $(id) { 2 | if (id.charAt(0) !== '#') return false; 3 | return document.getElementById(id.substring(1)); 4 | } 5 | 6 | function init() { 7 | const now = Date.now(); 8 | const today = Math.floor(now / 86400000); 9 | const initialDay = 19021; 10 | const puzzleNumber = (today - initialDay) % secretWords.length; 11 | const secret = secretWords[puzzleNumber].toLowerCase(); 12 | 13 | if (secret != $('#word').innerHTML) { 14 | $('#nearest').style="display:block;"; 15 | } else { 16 | $('#warning').style="display:block"; 17 | $('#warning').addEventListener('click', function(event) { 18 | $('#warning').style="display:none"; 19 | $('#nearest').style="display:block"; 20 | }); 21 | } 22 | } 23 | 24 | window.addEventListener('load', init); 25 | -------------------------------------------------------------------------------- /dump-vecs.py: -------------------------------------------------------------------------------- 1 | import collections.abc 2 | import sqlite3 3 | 4 | import gensim.models.keyedvectors as word2vec 5 | import numpy as np 6 | import tqdm 7 | from more_itertools import chunked 8 | 9 | collections.Mapping = collections.abc.Mapping 10 | 11 | model = word2vec.KeyedVectors.load_word2vec_format("word2vec/wikipedia-vector.bin", binary=True) 12 | 13 | con = sqlite3.connect("word2vec.db") 14 | con.execute("PRAGMA journal_mode=WAL") 15 | cur = con.cursor() 16 | cur.execute("""create table if not exists word2vec (word text PRIMARY KEY, vec blob)""") 17 | con.commit() 18 | 19 | 20 | def bfloat(vec): 21 | """ 22 | Half of each floating point vector happens to be zero in the Google model. 23 | Possibly using truncated float32 = bfloat. Discard to save space. 24 | """ 25 | vec.dtype = np.int16 26 | return vec[1::2].tobytes() 27 | 28 | 29 | CHUNK_SIZE = 1111 30 | con.execute("DELETE FROM word2vec") 31 | for words in chunked(tqdm.tqdm(model.key_to_index), CHUNK_SIZE): 32 | with con: 33 | con.executemany( 34 | "insert into word2vec values(?,?)", 35 | ((word, bfloat(model[word])) for word in words), 36 | ) 37 | -------------------------------------------------------------------------------- /templates/top1k.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Semantle Türkçe: Yakın Sözcükler 9 | 10 | 11 | 17 | 34 | 35 |
36 | Semantle Türkçe'ye geri dön 37 | 38 | 39 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Semantle Türkçe 2 | 3 | This repository contains the Turkish version of [Semantle](https://semantle.novalis.org/). 4 | 5 | ## Initial Setup 6 | 7 | - Create a virtual environment and install required Python modules from `requirements.txt`. 8 | - Use the `word2vec/train.sh` file to train a Turkish Word2Vec model using the Wikipedia corpus. 9 | - Run `python dump-vecs.py` to initialize the SQLite database with vectors. 10 | - Run `python dump-hints.py` to create hints pickle. 11 | - Run `python store-hints.py` to import the hints pickle to the database. 12 | 13 | ## Deployment & Running the App 14 | 15 | - Run `docker-compose up -d`. The project should be up and running at HTTP port 80. 16 | 17 | ## Notes 18 | 19 | This project was forked from the original [Semantle](https://gitlab.com/novalis_dt/semantle) repository and some modifications to the `dump-hints.py` file were cherry picked from the [Semantle-es](https://github.com/A12Studios/semantle-es) repository. 20 | 21 | ## Known Bugs 22 | 23 | - Since Turkish is an agglutinative language, while looking for similar words you will see lots of words with suffixes. I'm planning to clean up the corpus to work with lemmas or stems and improve the performance. 24 | 25 | ## Want to Contribute? 26 | 27 | Go ahead, they're always appreciated! 28 | 29 | --- 30 | 31 | Made in Ankara with 💙 -------------------------------------------------------------------------------- /store-hints.py: -------------------------------------------------------------------------------- 1 | import pickle 2 | import sqlite3 3 | 4 | import tqdm 5 | 6 | con = sqlite3.connect("word2vec.db") 7 | con.execute("PRAGMA journal_mode=WAL") 8 | cur = con.cursor() 9 | cur.execute( 10 | """create table if not exists nearby 11 | (word text, neighbor text, similarity float, percentile integer, 12 | PRIMARY KEY (word, neighbor))""" 13 | ) 14 | 15 | cur.execute( 16 | """create table if not exists similarity_range 17 | (word text PRIMARY KEY, top float, top10 float, rest float)""" 18 | ) 19 | con.commit() 20 | 21 | with open(b"nearest.pickle", "rb") as f: 22 | nearest = pickle.load(f) 23 | 24 | CHUNK_SIZE = 1111 25 | with con: 26 | con.execute("DELETE FROM nearby") 27 | con.execute("DELETE FROM similarity_range") 28 | for secret, neighbors in tqdm.tqdm(nearest.items()): 29 | con.executemany( 30 | "insert into nearby (word, neighbor, similarity, percentile) values (?, ?, ?, ?)", 31 | ( 32 | (secret, neighbor, "%s" % score, (1 + idx)) 33 | for idx, (score, neighbor) in enumerate(neighbors) 34 | ), 35 | ) 36 | 37 | top = neighbors[-2][0] 38 | top10 = neighbors[-11][0] 39 | rest = neighbors[0][0] 40 | con.execute( 41 | "insert into similarity_range (word, top, top10, rest) values (?, ?, ?, ?)", 42 | (secret, "%s" % top, "%s" % top10, "%s" % rest), 43 | ) 44 | 45 | con.commit() 46 | -------------------------------------------------------------------------------- /dump-hints.py: -------------------------------------------------------------------------------- 1 | import pickle 2 | import time 3 | 4 | import gensim.models.keyedvectors as word2vec 5 | from tqdm import tqdm 6 | 7 | 8 | def get_common_words_set(): 9 | result = set() 10 | 11 | with open("tr_50k.txt") as common_words: 12 | for line in common_words: 13 | result.add(line.split()[0]) 14 | return result 15 | 16 | 17 | common_words_set = get_common_words_set() 18 | TOP_N = 1000 19 | 20 | t_word2vec = time.process_time() 21 | print("loading word2vec file...") 22 | model = word2vec.KeyedVectors.load_word2vec_format("word2vec/wikipedia-vector.bin", binary=True) 23 | print(f'done in {time.process_time() - t_word2vec} seconds') 24 | 25 | hints = {} 26 | with open("static/assets/js/secretWords.js", encoding="utf-8") as secret_words: 27 | for secret in tqdm(iterable=secret_words.readlines(), desc='generating hints (takes 1~2 minutes to start)'): 28 | secret = secret.strip() 29 | if not '"' in secret: 30 | continue 31 | secret = secret.strip('",') 32 | # secret might not be in the model vocabulary if we loaded a subset 33 | # of the model. Skip generating hints if that's the case 34 | if secret not in model.key_to_index: 35 | continue 36 | # Calculate nearest using KeyedVectors' `most_similar`. 37 | # It calculates cosine similarity, which is what 38 | # the original Semantle does. 39 | # The first call to `most_similar` is s l o w: the progress 40 | # indicator will start moving after a minute or so. 41 | # This is _way_ faster than doing a nested "secret x vocab" loop. 42 | # Slice up to TOP_N -1 to leave room for the secret word. 43 | most_similar = [it for it in model.most_similar(secret, topn=100 * TOP_N) if it[0] in common_words_set][ 44 | 0:TOP_N - 1] 45 | # Nearest must include the secret. `most_similar` doesn't, so we need to add it manually. 46 | most_similar.extend([(secret, 1)]) 47 | if len(most_similar) < TOP_N: 48 | raise RuntimeError( 49 | f'most_similar has too few common words: {len(most_similar)} after filtering, needs {TOP_N}') 50 | # store-hints.py expects a (score, word) tuple 51 | nearest = [(item[1], item[0]) for item in most_similar] 52 | # store-hints.py relies on nearest's order to get the closest, 10th and 1000th nearby element. 53 | nearest.sort() 54 | hints[secret] = nearest 55 | 56 | with open(b"nearest.pickle", "wb") as pickled: 57 | pickle.dump(hints, pickled) 58 | -------------------------------------------------------------------------------- /word2vec/train.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | # -*- coding: utf-8 -*- 3 | import logging 4 | import multiprocessing 5 | 6 | from gensim import utils 7 | from gensim.corpora import WikiCorpus 8 | from gensim.models import Word2Vec 9 | from gensim.models.word2vec import LineSentence 10 | 11 | 12 | def tokenize_tr(content, token_min_len=2, token_max_len=50, lower=True): 13 | if lower: 14 | lower_map = {ord(u'A'): u'a', ord(u'A'): u'a', ord(u'B'): u'b', ord(u'C'): u'c', ord(u'Ç'): u'ç', 15 | ord(u'D'): u'd', ord(u'E'): u'e', ord(u'F'): u'f', ord(u'G'): u'g', ord(u'Ğ'): u'ğ', 16 | ord(u'H'): u'h', ord(u'I'): u'ı', ord(u'İ'): u'i', ord(u'J'): u'j', ord(u'K'): u'k', 17 | ord(u'L'): u'l', ord(u'M'): u'm', ord(u'N'): u'n', ord(u'O'): u'o', ord(u'Ö'): u'ö', 18 | ord(u'P'): u'p', ord(u'R'): u'r', ord(u'S'): u's', ord(u'Ş'): u'ş', ord(u'T'): u't', 19 | ord(u'U'): u'u', ord(u'Ü'): u'ü', ord(u'V'): u'v', ord(u'Y'): u'y', ord(u'Z'): u'z'} 20 | content = content.translate(lower_map) 21 | return [ 22 | utils.to_unicode(token) for token in utils.tokenize(content, lower=False, errors='ignore') 23 | if token_min_len <= len(token) <= token_max_len and not token.startswith('_') 24 | ] 25 | 26 | 27 | def train(): 28 | logging.basicConfig(level=logging.INFO, format='%(asctime)s %(levelname)s %(message)s') 29 | 30 | wiki_file = "trwiki-latest-pages-articles.xml.bz2" 31 | wiki_out = "wikipedia-out.txt" 32 | wiki_vector = "wikipedia-vector.bin" 33 | 34 | wiki = WikiCorpus(wiki_file, tokenizer_func=tokenize_tr) 35 | logging.info("Wikipedia dump is opened.") 36 | 37 | output = open(wiki_out, "w", encoding="utf-8") 38 | logging.info("Output file is created.") 39 | 40 | i = 0 41 | 42 | for text in wiki.get_texts(): 43 | output.write(" ".join(text) + "\n") 44 | i += 1 45 | if i % 10000 == 0: 46 | logging.info("Saved " + str(i) + " articles.") 47 | 48 | output.close() 49 | 50 | logging.info("Vector training has started.") 51 | 52 | model = Word2Vec( 53 | sentences=LineSentence(wiki_out), 54 | vector_size=300, 55 | window=7, 56 | min_count=3, 57 | workers=multiprocessing.cpu_count() 58 | ) 59 | logging.info("Vector training has completed.") 60 | 61 | logging.info("Saving Word2Vec binary file...") 62 | model.wv.save_word2vec_format(wiki_vector, binary=True) 63 | logging.info("Word2Vec binary file has saved.") 64 | 65 | 66 | if __name__ == '__main__': 67 | train() 68 | -------------------------------------------------------------------------------- /static/assets/styles.css: -------------------------------------------------------------------------------- 1 | * { 2 | box-sizing: border-box; 3 | } 4 | 5 | body, input, button { 6 | font-size: 17px; 7 | line-height: 1.59; 8 | -webkit-font-smoothing: subpixel-antialiased; 9 | font-family:-apple-system-font, BlinkMacSystemFont, 'Helvetica Neue', sans-serif; 10 | text-rendering: optimizeLegibility; 11 | font-weight:400; 12 | } 13 | 14 | body { 15 | margin: 0 auto; 16 | max-width: 800px; 17 | padding: 1em; 18 | } 19 | 20 | body.dialog-open { 21 | overflow: hidden; 22 | } 23 | 24 | body.rules-open #rules-underlay { 25 | display: block; 26 | } 27 | 28 | body.settings-open #settings-underlay { 29 | display: block; 30 | } 31 | 32 | header { 33 | align-items: center; 34 | display: flex; 35 | justify-content: space-between; 36 | } 37 | 38 | h2 { 39 | margin: 0; 40 | } 41 | 42 | #menu { 43 | display: flex; 44 | column-gap: .5em; 45 | } 46 | 47 | #menu button, 48 | .dialog-close { 49 | background: transparent; 50 | border: none; 51 | padding: 0; 52 | } 53 | 54 | #menu button svg { 55 | height: 1.5em; 56 | width: 1.5em; 57 | } 58 | 59 | .dialog-underlay { 60 | background: rgba(0,0,0,.5); 61 | bottom: 0; 62 | display: none; 63 | left: 0; 64 | position: fixed; 65 | right: 0; 66 | top: 0; 67 | } 68 | 69 | .dialog { 70 | background: white; 71 | left: 2em; 72 | margin-bottom: 2em; 73 | margin-left: auto; 74 | margin-right: auto; 75 | max-width: 40em; 76 | overflow: hidden; 77 | position: fixed; 78 | right: 2em; 79 | top: 2em; 80 | z-index: 1; 81 | } 82 | 83 | .dialog-close { 84 | color: black; 85 | font-size: 1.5em; 86 | height: 1em; 87 | line-height: 1em; 88 | right: .5em; 89 | position: absolute; 90 | top: .5em; 91 | width: 1em; 92 | z-index: 2; 93 | } 94 | 95 | .dialog-content { 96 | max-height: calc(100vh - 4em); 97 | padding: 2em; 98 | overflow: auto; 99 | } 100 | 101 | .dialog-content > *:first-child { 102 | margin-top: 0; 103 | } 104 | 105 | .dialog-content > *:last-child { 106 | margin-bottom: 0; 107 | } 108 | 109 | #error { 110 | color: #f00; 111 | } 112 | 113 | #guess-wrapper { 114 | display: flex; 115 | margin: 20px 0; 116 | align-items: center; 117 | } 118 | 119 | #guess-wrapper input, 120 | #give-up-btn { 121 | height: 2.5em; 122 | padding: .5em; 123 | } 124 | 125 | #guesses { 126 | margin-bottom:40px; 127 | } 128 | 129 | #guess { 130 | width: 100%; 131 | } 132 | 133 | th { 134 | padding-right: 3em; 135 | text-align: start; 136 | } 137 | 138 | th#chronoOrder, th#alphaOrder, th#similarityOrder, input:not([type=text]), button { 139 | cursor: pointer; 140 | } 141 | 142 | .gaveup { 143 | border: 1px solid black; 144 | margin-bottom: 1em; 145 | padding: 1em; 146 | background-color: #eeeeff; 147 | } 148 | 149 | .gaveup > *:first-child { 150 | margin-top: 0; 151 | } 152 | 153 | .close { 154 | text-align: left; 155 | } 156 | 157 | .percentile, 158 | .progress-container, 159 | .progress-bar { 160 | display: inline-block; 161 | } 162 | 163 | .percentile { 164 | text-align: right; 165 | width: 5em; 166 | } 167 | 168 | .progress-container { 169 | background-color: #eeeeee; 170 | width: 10em; 171 | } 172 | 173 | .progress-bar { 174 | background-color:#008000; 175 | } 176 | 177 | /*"Unusual word found! This word is not in the list of \"normal\" words that we use for the top-1000 list, but it is still similar!";*/ 178 | 179 | .weirdWord { 180 | position: relative; 181 | display: inline-block; 182 | border-bottom: 1px dotted black; 183 | } 184 | 185 | .weirdWord .tooltiptext { 186 | visibility: hidden; 187 | width: 20em; 188 | background-color: black; 189 | color: #fff; 190 | text-align: center; 191 | padding: 0.3ex 0; 192 | border-radius: 1ex; 193 | 194 | position: absolute; 195 | z-index: 1; 196 | } 197 | 198 | 199 | .weirdWord:hover .tooltiptext { 200 | visibility: visible; 201 | } 202 | 203 | footer { 204 | margin-top: 200px; 205 | } 206 | 207 | @media only screen and (max-width: 640px) { 208 | body, input, button { 209 | font-size: 14px; 210 | } 211 | 212 | table { 213 | width: 100%; 214 | } 215 | 216 | th { 217 | padding-right: .5em; 218 | } 219 | } 220 | 221 | /* Dark mode */ 222 | body.dark { 223 | background: #111; 224 | color: #fafafa; 225 | color-scheme: dark; 226 | } 227 | 228 | body.dark a { 229 | color: #9af; 230 | } 231 | 232 | body.dark #menu button { 233 | color: #fafafa; 234 | } 235 | 236 | body.dark .dialog { 237 | background: #333; 238 | } 239 | 240 | body.dark .dialog-close { 241 | color: #fafafa; 242 | } 243 | 244 | body.dark .progress-container { 245 | background: #333; 246 | } 247 | 248 | body.dark .gaveup { 249 | background: #334; 250 | } 251 | 252 | body.dark .weirdWord { 253 | border-color: #fafafa; 254 | } 255 | -------------------------------------------------------------------------------- /semantle.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | from flask import ( 4 | Flask, 5 | request, 6 | jsonify, 7 | send_file, 8 | send_from_directory, 9 | render_template, 10 | ) 11 | import struct 12 | import sqlite3 13 | import base64 14 | from functools import lru_cache 15 | 16 | app = Flask(__name__) 17 | 18 | 19 | @app.route("/") 20 | def send_index(): 21 | return send_file("static/index.html") 22 | 23 | 24 | @app.route("/favicon.ico") 25 | def send_favicon(): 26 | return send_file("static/assets/favicon.ico") 27 | 28 | 29 | @app.route("/assets/") 30 | def send_static(path): 31 | return send_from_directory("static/assets", path) 32 | 33 | 34 | def expand_bfloat(vec, half_length=600): 35 | """ 36 | expand truncated float32 to float32 37 | """ 38 | if len(vec) == half_length: 39 | vec = b"".join((b"\00\00" + bytes(pair)) for pair in zip(vec[::2], vec[1::2])) 40 | return vec 41 | 42 | 43 | @app.route("/model/") 44 | def word(word): 45 | try: 46 | con = sqlite3.connect("word2vec.db") 47 | cur = con.cursor() 48 | res = cur.execute("SELECT vec FROM word2vec WHERE word = ?", (word,)) 49 | res = list(cur.fetchone()) 50 | con.close() 51 | if not res: 52 | return "" 53 | res = res[0] 54 | return jsonify(list(struct.unpack("300f", expand_bfloat(res)))) 55 | except Exception as e: 56 | print(e) 57 | return jsonify(e) 58 | 59 | 60 | @lru_cache(maxsize=50000) 61 | def get_model2(secret, word): 62 | con = sqlite3.connect("word2vec.db") 63 | cur = con.cursor() 64 | res = cur.execute( 65 | "SELECT vec, percentile FROM word2vec left outer join nearby on nearby.word=? and nearby.neighbor=? WHERE word2vec.word = ?", 66 | (secret, word, word), 67 | ) 68 | row = cur.fetchone() 69 | if row: 70 | row = list(row) 71 | con.close() 72 | if not row: 73 | return "" 74 | vec = row[0] 75 | result = {"vec": list(struct.unpack("300f", expand_bfloat(vec)))} 76 | if row[1]: 77 | result["percentile"] = row[1] 78 | return jsonify(result) 79 | 80 | 81 | @app.route("/model2//") 82 | def model2(secret, word): 83 | try: 84 | return get_model2(secret, word) 85 | except Exception as e: 86 | print(e) 87 | return jsonify(e) 88 | 89 | 90 | @app.route("/similarity/") 91 | def similarity(word): 92 | try: 93 | con = sqlite3.connect("word2vec.db") 94 | cur = con.cursor() 95 | res = cur.execute( 96 | "SELECT top, top10, rest FROM similarity_range WHERE word = ?", (word,) 97 | ) 98 | res = list(cur.fetchone()) 99 | con.close() 100 | if not res: 101 | return "" 102 | return jsonify({"top": res[0], "top10": res[1], "rest": res[2]}) 103 | except Exception as e: 104 | print(e) 105 | return jsonify(e) 106 | 107 | 108 | @app.route("/nearby/") 109 | def nearby(word): 110 | try: 111 | con = sqlite3.connect("word2vec.db") 112 | cur = con.cursor() 113 | res = cur.execute( 114 | "SELECT neighbor FROM nearby WHERE word = ? order by percentile desc limit 10 offset 1", 115 | (word,), 116 | ) 117 | rows = cur.fetchall() 118 | con.close() 119 | if not rows: 120 | return "" 121 | return jsonify([row[0] for row in rows]) 122 | except Exception as e: 123 | print(e) 124 | return jsonify(e) 125 | 126 | @app.route("/nearby_1k") 127 | def nearby_1k(): 128 | try: 129 | word_b64 = request.args.get('word') 130 | word = base64.b64decode(word_b64).decode("utf-8") 131 | 132 | con = sqlite3.connect("word2vec.db") 133 | cur = con.cursor() 134 | res = cur.execute( 135 | "SELECT neighbor, percentile, similarity FROM nearby WHERE word = ? order by percentile desc limit 1000 offset 1 ", 136 | (word,), 137 | ) 138 | rows = cur.fetchall() 139 | con.close() 140 | words = [ 141 | dict( 142 | neighbor=row[0], 143 | percentile=int(row[1]), 144 | similarity="%0.2f" % (100 * row[2]), 145 | ) 146 | for row in rows 147 | ] 148 | return render_template("top1k.html", word=word, words=words) 149 | 150 | except Exception as e: 151 | import traceback 152 | 153 | traceback.print_exc() 154 | return "Oops, error" 155 | 156 | 157 | @app.errorhandler(404) 158 | def not_found(error): 159 | return "page not found" 160 | 161 | 162 | @app.errorhandler(500) 163 | def error_handler(error): 164 | return error 165 | 166 | 167 | @app.after_request 168 | def add_header(response): 169 | response.headers["Cache-Control"] = "no-store" 170 | return response 171 | 172 | 173 | if __name__ == "__main__": 174 | import sqlite3 175 | 176 | app.run(host="0.0.0.0", port=5005) 177 | -------------------------------------------------------------------------------- /static/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | Semantle Türkçe 7 | 8 | 9 | 10 | 11 | 12 | 13 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |

Semantle Türkçe

32 | 48 |
49 |
50 | 84 |
85 |

86 |
87 |
89 |
90 | 93 | 94 |
95 |
96 |
97 |
98 | 99 |
100 | 101 |
102 | 103 | 104 | 105 | 106 |
107 |

Sık Sorulan Sorular

108 | 109 |

S: Bu fikir aklına nereden geldi?

110 |

C: Wordle bağımlısıyım! Her gün 111 | yeni bir versiyonunu keşfediyorum ve oynamaktan büyük keyif alıyorum. Geçtiğimiz günlerde 112 | Twitter'da Semantle'ı görünce oldukça hoşuma gitti ve henüz Türkçe 113 | versiyonunun olmadığını 114 | görünce kolları sıvayıp işe koyuldum. 115 | 116 |

S: Peki nasıl çalışıyor?

117 |

C: Word2Vec adında bir Doğal Dil İşleme aracıyla kelimeler arasındaki yakınlık ilişkisiyle çalışıyor. 118 | Word2Vec hakkında bir şeyler okumak isterseniz, İngilizce bir kaynak olarak 119 | burayı önerebilirim. 120 |

S: Hangi veri setini kullandın?

121 |

C: Vikipedi'deki makalelerden kendi veri setimi oluşturdum. Açıkçası biraz aceleci davrandığım için 122 | yer yer hataları var ve bunun farkındayım. Fırsat buldukça düzeltmeye çalışacağım.

123 |

S: Dünün sözcüğü neydi?

124 |

C: Dünün sözcüğü "".

125 |

S: Dünün sözcüğüne en yakın sözcükler neydi?

126 |

C: 127 |

S: Kaynak koduna erişebilir miyim?

128 |

C: Evet!

129 |

S: Başka dillerde oynayabilir miyim?

130 |

C: Evet, orijinal İngilizce halinin yanı sıra, 131 | İsveççe, 132 | İbranice, 133 | İspanyolca, 134 | Portekizce, 135 | ve Fransızca dillerinde de oynayabilirsiniz.

136 |

S: Günün sözcüğü nasıl seçiliyor?

137 |

C: Wiktionary'deki en popüler 1000 138 | Türkçe Sözcük listesinin sırasını karıştırarak oyuna ekledim. Yaklaşık 3 yıl boyunca bir sorunla 139 | karşılaşmadan Semantle Türkçe oynamaya devam edebileceğinizi garanti ediyorum :)

140 | 141 |
Orijinal versiyonu David Turner tarafından yapılmış olup, Mustafa Ozan Alpay tarafından Türkçeye uyarlanmıştır. Word2Vec veri 143 | seti Vikipedi makaleleri kullanılarak oluşturulmuştur. 144 |
145 |
146 |
147 | 160 |
161 | 168 | 169 | 170 | -------------------------------------------------------------------------------- /static/assets/js/secretWords.js: -------------------------------------------------------------------------------- 1 | secretWords = [ 2 | "mektup", 3 | "uçak", 4 | "nefret", 5 | "barış", 6 | "söylenmek", 7 | "üst", 8 | "dikkat", 9 | "inanmak", 10 | "cami", 11 | "duvar", 12 | "beyin", 13 | "iletişim", 14 | "şey", 15 | "yürek", 16 | "elbette", 17 | "dönüşmek", 18 | "kolay", 19 | "sürücü", 20 | "politika", 21 | "yanmak", 22 | "proje", 23 | "hız", 24 | "ağaç", 25 | "başka", 26 | "hastalık", 27 | "ya", 28 | "masa", 29 | "amaç", 30 | "yürümek", 31 | "gene", 32 | "yaşlı", 33 | "bayrak", 34 | "herhangi", 35 | "başkan", 36 | "milyar", 37 | "söz", 38 | "karanlık", 39 | "ücret", 40 | "üretmek", 41 | "yaz", 42 | "tercih", 43 | "yazılmak", 44 | "cihaz", 45 | "miktar", 46 | "çizgi", 47 | "tek", 48 | "yayın", 49 | "sevmek", 50 | "yüksek", 51 | "öyle", 52 | "derece", 53 | "koşmak", 54 | "büyük", 55 | "doğal", 56 | "mümkün", 57 | "yaptırmak", 58 | "mağaza", 59 | "kent", 60 | "sorun", 61 | "hiç", 62 | "sokak", 63 | "yetmek", 64 | "bundan", 65 | "devam", 66 | "güvenlik", 67 | "düşünülmek", 68 | "katkı", 69 | "birlikte", 70 | "örneğin", 71 | "yardım", 72 | "acı", 73 | "altın", 74 | "aday", 75 | "hayal", 76 | "gerekli", 77 | "hemen", 78 | "yeterli", 79 | "kaçmak", 80 | "almak", 81 | "cam", 82 | "sahip", 83 | "etraf", 84 | "küçük", 85 | "köpek", 86 | "bacak", 87 | "hızlı", 88 | "sırt", 89 | "batı", 90 | "kanal", 91 | "neden", 92 | "elektrik", 93 | "taraf", 94 | "yüzyıl", 95 | "parti", 96 | "pencere", 97 | "ağabey", 98 | "düzey", 99 | "birkaç", 100 | "çıkmak", 101 | "dakika", 102 | "servis", 103 | "lira", 104 | "polis", 105 | "ile", 106 | "mücadele", 107 | "kültür", 108 | "korkmak", 109 | "suç", 110 | "takılmak", 111 | "sıcaklık", 112 | "vermek", 113 | "beş", 114 | "tarz", 115 | "kitap", 116 | "takım", 117 | "parça", 118 | "üstüne", 119 | "kurmak", 120 | "kalmak", 121 | "değişim", 122 | "çağ", 123 | "teknoloji", 124 | "davranış", 125 | "kalkmak", 126 | "ise", 127 | "yaşam", 128 | "zaman", 129 | "yüz", 130 | "eğer", 131 | "gazete", 132 | "tepki", 133 | "ön", 134 | "hikaye", 135 | "ağırlık", 136 | "paşa", 137 | "ihtiyaç", 138 | "anlayış", 139 | "genç", 140 | "düşünce", 141 | "beri", 142 | "boş", 143 | "beraber", 144 | "maç", 145 | "internet", 146 | "teknik", 147 | "cep", 148 | "sıcak", 149 | "artmak", 150 | "modern", 151 | "güzel", 152 | "yöntem", 153 | "içermek", 154 | "belki", 155 | "denmek", 156 | "dün", 157 | "cadde", 158 | "asker", 159 | "baş", 160 | "değerlendirmek", 161 | "bakanlık", 162 | "dört", 163 | "yumurta", 164 | "kimse", 165 | "oysa", 166 | "müdür", 167 | "hak", 168 | "bölüm", 169 | "uyumak", 170 | "açı", 171 | "yani", 172 | "hastahane", 173 | "söylemek", 174 | "kurulmak", 175 | "güven", 176 | "evet", 177 | "uygulama", 178 | "etki", 179 | "orman", 180 | "anlatmak", 181 | "hazırlanmak", 182 | "oluşturmak", 183 | "adet", 184 | "özellikle", 185 | "yaşanmak", 186 | "yatak", 187 | "dost", 188 | "tüm", 189 | "et", 190 | "yaş", 191 | "yıldız", 192 | "hata", 193 | "şart", 194 | "ayrılmak", 195 | "gün", 196 | "merkez", 197 | "sigara", 198 | "üzeri", 199 | "atmak", 200 | "zarar", 201 | "uygulamak", 202 | "ve", 203 | "piyasa", 204 | "burada", 205 | "üretim", 206 | "ünlü", 207 | "rol", 208 | "iyi", 209 | "hanım", 210 | "fotoğraf", 211 | "madde", 212 | "dünya", 213 | "kullanım", 214 | "medya", 215 | "iki", 216 | "öğretmen", 217 | "yön", 218 | "karışmak", 219 | "hücre", 220 | "sayılmak", 221 | "aşama", 222 | "dolayı", 223 | "fakat", 224 | "üretilmek", 225 | "fiyat", 226 | "müşteri", 227 | "fark", 228 | "sorumluluk", 229 | "üzerinde", 230 | "idi", 231 | "çocuk", 232 | "kaldırmak", 233 | "şirket", 234 | "ora", 235 | "çiçek", 236 | "oturmak", 237 | "dış", 238 | "enflasyon", 239 | "türlü", 240 | "ayırmak", 241 | "kaybetmek", 242 | "anlamak", 243 | "belge", 244 | "akşam", 245 | "belediye", 246 | "boyun", 247 | "hesap", 248 | "aşağı", 249 | "kanun", 250 | "kahve", 251 | "dinlemek", 252 | "kötü", 253 | "bebek", 254 | "sınıf", 255 | "çıkarmak", 256 | "gece", 257 | "çok", 258 | "yoksa", 259 | "sunmak", 260 | "artırmak", 261 | "kimlik", 262 | "değer", 263 | "ilişki", 264 | "yanıt", 265 | "plan", 266 | "ev", 267 | "demek", 268 | "yağ", 269 | "kenar", 270 | "para", 271 | "dolu", 272 | "biçim", 273 | "din", 274 | "kan", 275 | "fazla", 276 | "soğuk", 277 | "açık", 278 | "sanatçı", 279 | "resim", 280 | "birim", 281 | "geçen", 282 | "görüş", 283 | "kardeş", 284 | "ilgi", 285 | "koşul", 286 | "kelime", 287 | "silah", 288 | "eylem", 289 | "önem", 290 | "gülmek", 291 | "zevk", 292 | "kredi", 293 | "yüzden", 294 | "lazım", 295 | "baba", 296 | "öteki", 297 | "eser", 298 | "anlaşılmak", 299 | "organ", 300 | "görünmek", 301 | "faiz", 302 | "balık", 303 | "birinci", 304 | "var", 305 | "fırsat", 306 | "yatmak", 307 | "ekonomi", 308 | "bozulmak", 309 | "zengin", 310 | "kişi", 311 | "kesmek", 312 | "henüz", 313 | "sürdürmek", 314 | "ışık", 315 | "hâlâ", 316 | "orta", 317 | "saymak", 318 | "boyut", 319 | "taşımak", 320 | "gazeteci", 321 | "spor", 322 | "koltuk", 323 | "bu", 324 | "basmak", 325 | "biz", 326 | "uzatmak", 327 | "eleman", 328 | "olay", 329 | "belli", 330 | "kulak", 331 | "eklemek", 332 | "görüntü", 333 | "beden", 334 | "sözcük", 335 | "tanımak", 336 | "kim", 337 | "ürün", 338 | "yazar", 339 | "alan", 340 | "yaprak", 341 | "sonuç", 342 | "kriz", 343 | "şiir", 344 | "ileri", 345 | "geçmek", 346 | "soru", 347 | "kabul", 348 | "anlam", 349 | "artış", 350 | "götürmek", 351 | "köy", 352 | "üzerine", 353 | "ilk", 354 | "hatta", 355 | "kapanmak", 356 | "alışveriş", 357 | "bağlamak", 358 | "gaz", 359 | "sana", 360 | "hazır", 361 | "yayımlanmak", 362 | "tamam", 363 | "örgüt", 364 | "bakmak", 365 | "yerine", 366 | "çevirmek", 367 | "bitki", 368 | "yapı", 369 | "hangi", 370 | "eş", 371 | "tür", 372 | "gelmek", 373 | "içinde", 374 | "büyümek", 375 | "tam", 376 | "su", 377 | "mutfak", 378 | "program", 379 | "belirlenmek", 380 | "üçüncü", 381 | "temiz", 382 | "talep", 383 | "sistem", 384 | "getirmek", 385 | "ilaç", 386 | "iş", 387 | "vücut", 388 | "etmek", 389 | "hızla", 390 | "birisi", 391 | "kontrol", 392 | "yaklaşmak", 393 | "bulunmak", 394 | "toprak", 395 | "malzeme", 396 | "kural", 397 | "bura", 398 | "bağlanmak", 399 | "iç", 400 | "hem", 401 | "yararlanmak", 402 | "bölge", 403 | "düşük", 404 | "göz", 405 | "vatandaş", 406 | "ortam", 407 | "özel", 408 | "derin", 409 | "yemek", 410 | "yoğun", 411 | "el", 412 | "denge", 413 | "çıkar", 414 | "roman", 415 | "kaynak", 416 | "kurtulmak", 417 | "öykü", 418 | "ayak", 419 | "hafta", 420 | "aynı", 421 | "yer", 422 | "şöyle", 423 | "tutmak", 424 | "telefon", 425 | "karşı", 426 | "ağlamak", 427 | "hoş", 428 | "korku", 429 | "yakın", 430 | "bakış", 431 | "dil", 432 | "toplum", 433 | "ek", 434 | "on", 435 | "sağlıklı", 436 | "yeni", 437 | "firma", 438 | "hedef", 439 | "televizyon", 440 | "normal", 441 | "an", 442 | "bakan", 443 | "peki", 444 | "insan", 445 | "kez", 446 | "güç", 447 | "özgürlük", 448 | "gerçek", 449 | "sıra", 450 | "yanlış", 451 | "doğru", 452 | "kuruluş", 453 | "müzik", 454 | "farklı", 455 | "alt", 456 | "ifade", 457 | "açmak", 458 | "durmak", 459 | "ölüm", 460 | "uzak", 461 | "tamamen", 462 | "ki", 463 | "acaba", 464 | "yasa", 465 | "deniz", 466 | "eski", 467 | "uğraşmak", 468 | "ekonomik", 469 | "laf", 470 | "hissetmek", 471 | "ölçü", 472 | "mesela", 473 | "orada", 474 | "atılmak", 475 | "kesim", 476 | "çay", 477 | "ara", 478 | "iyice", 479 | "benzemek", 480 | "öğrenci", 481 | "meyve", 482 | "ayrıca", 483 | "ilerlemek", 484 | "oran", 485 | "bilmek", 486 | "sunulmak", 487 | "destek", 488 | "koymak", 489 | "ancak", 490 | "sahne", 491 | "meydan", 492 | "getirilmek", 493 | "nokta", 494 | "karşılık", 495 | "salon", 496 | "önemli", 497 | "karşılaşmak", 498 | "eğitim", 499 | "çekmek", 500 | "geçmiş", 501 | "oğul", 502 | "savaş", 503 | "ilgilenmek", 504 | "kilo", 505 | "bilim", 506 | "aşmak", 507 | "çalışma", 508 | "bina", 509 | "sanat", 510 | "bütün", 511 | "göre", 512 | "görev", 513 | "istemek", 514 | "uygulanmak", 515 | "karşılamak", 516 | "satış", 517 | "geçirmek", 518 | "kimi", 519 | "bugün", 520 | "sinema", 521 | "şekil", 522 | "pek", 523 | "duygu", 524 | "allah", 525 | "süreç", 526 | "bağırmak", 527 | "ay", 528 | "sol", 529 | "izin", 530 | "aramak", 531 | "gizli", 532 | "sarmak", 533 | "sürmek", 534 | "ses", 535 | "ait", 536 | "sanayi", 537 | "birden", 538 | "toplantı", 539 | "sıkıntı", 540 | "beklemek", 541 | "dilemek", 542 | "hareket", 543 | "onun", 544 | "her", 545 | "beyan", 546 | "sadece", 547 | "tehlike", 548 | "yan", 549 | "erkek", 550 | "son", 551 | "yönetim", 552 | "kas", 553 | "uzanmak", 554 | "hatırlamak", 555 | "yükselmek", 556 | "aile", 557 | "kurtarmak", 558 | "kesilmek", 559 | "karı", 560 | "otobüs", 561 | "doktor", 562 | "enerji", 563 | "şimdi", 564 | "renk", 565 | "başlamak", 566 | "saygı", 567 | "satmak", 568 | "ince", 569 | "gelişmek", 570 | "model", 571 | "yazmak", 572 | "trafik", 573 | "sokmak", 574 | "birbiri", 575 | "kapatmak", 576 | "hayvan", 577 | "yarı", 578 | "kısa", 579 | "diğer", 580 | "kamu", 581 | "tip", 582 | "millet", 583 | "asla", 584 | "düzenlemek", 585 | "reklam", 586 | "öğrenmek", 587 | "deri", 588 | "dağ", 589 | "ödemek", 590 | "at", 591 | "demokrasi", 592 | "yıl", 593 | "değişiklik", 594 | "genellikle", 595 | "çalışmak", 596 | "alınmak", 597 | "yalnızca", 598 | "sert", 599 | "dolaşmak", 600 | "koca", 601 | "kapı", 602 | "toplumsal", 603 | "doğa", 604 | "istek", 605 | "güçlü", 606 | "hizmet", 607 | "az", 608 | "uymak", 609 | "içerisi", 610 | "şarkı", 611 | "sormak", 612 | "şehir", 613 | "binmek", 614 | "kullanmak", 615 | "isim", 616 | "olmak", 617 | "yetenek", 618 | "bitmek", 619 | "tane", 620 | "ikinci", 621 | "banka", 622 | "milyon", 623 | "kavram", 624 | "istenmek", 625 | "beyaz", 626 | "eşya", 627 | "hasta", 628 | "sektör", 629 | "en", 630 | "gider", 631 | "ad", 632 | "bir", 633 | "imkan", 634 | "yatırım", 635 | "canlı", 636 | "hakkında", 637 | "bırakmak", 638 | "azalmak", 639 | "sosyal", 640 | "abla", 641 | "boyunca", 642 | "özellik", 643 | "üstünde", 644 | "ruh", 645 | "giderek", 646 | "rahat", 647 | "niye", 648 | "uzman", 649 | "işlemek", 650 | "ağız", 651 | "daha", 652 | "çerçeve", 653 | "çaba", 654 | "meclis", 655 | "çizmek", 656 | "çünkü", 657 | "ilke", 658 | "tekrar", 659 | "önce", 660 | "saç", 661 | "sevgi", 662 | "bitirmek", 663 | "ana", 664 | "çeşitli", 665 | "gelecek", 666 | "gitmek", 667 | "kaç", 668 | "devlet", 669 | "cümle", 670 | "görmek", 671 | "biri", 672 | "korumak", 673 | "olanak", 674 | "dışarı", 675 | "sen", 676 | "kesin", 677 | "düşünmek", 678 | "hele", 679 | "göndermek", 680 | "siz", 681 | "basit", 682 | "yapılmak", 683 | "bunu", 684 | "oyun", 685 | "arka", 686 | "varmak", 687 | "şarap", 688 | "bazı", 689 | "meslek", 690 | "dergi", 691 | "kısım", 692 | "oldukça", 693 | "dayanmak", 694 | "ben", 695 | "defa", 696 | "denilmek", 697 | "baskı", 698 | "vurmak", 699 | "arkadaş", 700 | "kalp", 701 | "geç", 702 | "kullanılmak", 703 | "işçi", 704 | "inmek", 705 | "ülke", 706 | "çeşit", 707 | "ticaret", 708 | "basın", 709 | "doldurmak", 710 | "aşk", 711 | "tüketici", 712 | "koku", 713 | "işte", 714 | "yüzünden", 715 | "süt", 716 | "hafif", 717 | "uluslararası", 718 | "sağlık", 719 | "çözüm", 720 | "tabi", 721 | "pazar", 722 | "herkes", 723 | "marka", 724 | "okur", 725 | "kağıt", 726 | "açıklamak", 727 | "böylece", 728 | "başarılı", 729 | "gibi", 730 | "buna", 731 | "hayır", 732 | "karar", 733 | "giymek", 734 | "hükümet", 735 | "kadar", 736 | "araç", 737 | "geniş", 738 | "vakit", 739 | "seçmek", 740 | "değil", 741 | "sigorta", 742 | "kırmızı", 743 | "yol", 744 | "üye", 745 | "genel", 746 | "anne", 747 | "taş", 748 | "çıkarılmak", 749 | "gönül", 750 | "diye", 751 | "mesele", 752 | "yayılmak", 753 | "davranmak", 754 | "akmak", 755 | "bağlı", 756 | "film", 757 | "üniversite", 758 | "böyle", 759 | "sabah", 760 | "yine", 761 | "ateş", 762 | "girmek", 763 | "dolayısıyla", 764 | "köşe", 765 | "hiçbir", 766 | "değişmek", 767 | "işlem", 768 | "oluşmak", 769 | "bilinç", 770 | "konu", 771 | "çoğu", 772 | "sonra", 773 | "bilgi", 774 | "akıl", 775 | "yeniden", 776 | "veya", 777 | "otomobil", 778 | "ilginç", 779 | "açılmak", 780 | "gerçekleşmek", 781 | "ders", 782 | "doğmak", 783 | "yüzde", 784 | "düşmek", 785 | "örnek", 786 | "göstermek", 787 | "oynamak", 788 | "dönmek", 789 | "toplanmak", 790 | "numara", 791 | "gerekmek", 792 | "yok", 793 | "gerçekten", 794 | "hayat", 795 | "asıl", 796 | "evlenmek", 797 | "biraz", 798 | "gerek", 799 | "kazanmak", 800 | "adres", 801 | "yönetici", 802 | "art", 803 | "grup", 804 | "varlık", 805 | "yeşil", 806 | "boy", 807 | "paylaşmak", 808 | "sonunda", 809 | "hepsi", 810 | "cevap", 811 | "rağmen", 812 | "kadın", 813 | "öte", 814 | "neredeyse", 815 | "kurum", 816 | "tarih", 817 | "bazen", 818 | "onlar", 819 | "okul", 820 | "giriş", 821 | "kafa", 822 | "çekilmek", 823 | "tedavi", 824 | "üç", 825 | "besin", 826 | "artık", 827 | "bilinmek", 828 | "yakalamak", 829 | "kere", 830 | "süre", 831 | "çevre", 832 | "yıllık", 833 | "metre", 834 | "birey", 835 | "tavır", 836 | "faaliyet", 837 | "sağlanmak", 838 | "gelişme", 839 | "seçim", 840 | "kalan", 841 | "bulmak", 842 | "sınır", 843 | "uygun", 844 | "güneş", 845 | "belirlemek", 846 | "haber", 847 | "bunlar", 848 | "ulaşmak", 849 | "site", 850 | "kat", 851 | "araştırma", 852 | "izlemek", 853 | "hukuk", 854 | "geliştirmek", 855 | "bey", 856 | "seyretmek", 857 | "sağlamak", 858 | "yabancı", 859 | "benzer", 860 | "yukarıda", 861 | "hazırlamak", 862 | "hal", 863 | "yazı", 864 | "toplam", 865 | "sürekli", 866 | "okumak", 867 | "birçok", 868 | "yaklaşık", 869 | "ağır", 870 | "cilt", 871 | "kaza", 872 | "hoca", 873 | "ayrı", 874 | "ekmek", 875 | "sebep", 876 | "cumhuriyet", 877 | "yönelik", 878 | "düzen", 879 | "kalite", 880 | "parmak", 881 | "ama", 882 | "rüzgar", 883 | "adım", 884 | "kol", 885 | "duymak", 886 | "kılmak", 887 | "vitamin", 888 | "ortak", 889 | "ilgili", 890 | "araba", 891 | "içmek", 892 | "değiştirmek", 893 | "risk", 894 | "kendi", 895 | "ne", 896 | "yaratmak", 897 | "olma", 898 | "gelir", 899 | "için", 900 | "çalmak", 901 | "etkilemek", 902 | "uzun", 903 | "daire", 904 | "belirtilmek", 905 | "görülmek", 906 | "zor", 907 | "problem", 908 | "işletme", 909 | "unutmak", 910 | "içeri", 911 | "değişik", 912 | "kısaca", 913 | "kız", 914 | "sanki", 915 | "birer", 916 | "halk", 917 | "öldürmek", 918 | "ceza", 919 | "inanç", 920 | "burun", 921 | "mutlaka", 922 | "ölmek", 923 | "hep", 924 | "yakmak", 925 | "günlük", 926 | "mekân", 927 | "geri", 928 | "tanrı", 929 | "sene", 930 | "belirtmek", 931 | "aslında", 932 | "makine", 933 | "dönem", 934 | "sevgili", 935 | "saat", 936 | "görüşmek", 937 | "temel", 938 | "yavaş", 939 | "nasıl", 940 | "başarı", 941 | "o", 942 | "vergi", 943 | "yalnız", 944 | "karıştırmak", 945 | "verilmek", 946 | "toplamak", 947 | "durum", 948 | "incelemek", 949 | "nitelik", 950 | "aşırı", 951 | "bilgisayar", 952 | "gelen", 953 | "fikir", 954 | "mahalle", 955 | "tuz", 956 | "sayı", 957 | "yarar", 958 | "üzere", 959 | "top", 960 | "otel", 961 | "uç", 962 | "yapmak", 963 | "yedi", 964 | "adam", 965 | "oda", 966 | "bahçe", 967 | "birlik", 968 | "bile", 969 | "tatlı", 970 | "nerede", 971 | "dükkan", 972 | "katılmak", 973 | "mevcut", 974 | "can", 975 | "tutulmak", 976 | "edilmek", 977 | "ciddi", 978 | "şu", 979 | "sayfa", 980 | "hava", 981 | "yaşamak", 982 | "sağ", 983 | "üstelik", 984 | "zaten", 985 | "bunun", 986 | "konuşmak", 987 | "mal", 988 | ] 989 | -------------------------------------------------------------------------------- /static/assets/js/semantle.js: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2022, David Turner 3 | 4 | This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 3. 5 | 6 | This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. 7 | 8 | You should have received a copy of the GNU General Public License along with this program. If not, see . 9 | */ 10 | 'use strict'; 11 | 12 | let gameOver = false; 13 | let firstGuess = true; 14 | let guesses = []; 15 | let latestGuess = undefined; 16 | let guessed = new Set(); 17 | let guessCount = 0; 18 | let model = null; 19 | const now = Date.now() + 10800000; 20 | const today = Math.floor(now / 86400000); 21 | const initialDay = 19070; 22 | const puzzleNumber = (today - initialDay) % secretWords.length; 23 | const yesterdayPuzzleNumber = (today - initialDay + secretWords.length - 1) % secretWords.length; 24 | const storage = window.localStorage; 25 | let caps = 0; 26 | let warnedCaps = 0; 27 | let chrono_forward = 1; 28 | let darkModeMql = window.matchMedia('(prefers-color-scheme: dark)'); 29 | let darkMode = false; 30 | 31 | function $(q) { 32 | return document.querySelector(q); 33 | } 34 | 35 | function mag(a) { 36 | return Math.sqrt(a.reduce(function (sum, val) { 37 | return sum + val * val; 38 | }, 0)); 39 | } 40 | 41 | function dot(f1, f2) { 42 | return f1.reduce(function (sum, a, idx) { 43 | return sum + a * f2[idx]; 44 | }, 0); 45 | } 46 | 47 | function getCosSim(f1, f2) { 48 | return dot(f1, f2) / (mag(f1) * mag(f2)); 49 | } 50 | 51 | 52 | function plus(v1, v2) { 53 | const out = []; 54 | for (let i = 0; i < v1.length; i++) { 55 | out.push(v1[i] + v2[i]); 56 | } 57 | return out; 58 | } 59 | 60 | function minus(v1, v2) { 61 | const out = []; 62 | for (let i = 0; i < v1.length; i++) { 63 | out.push(v1[i] - v2[i]); 64 | } 65 | return out; 66 | } 67 | 68 | 69 | function scale(v, s) { 70 | const out = []; 71 | for (let i = 0; i < v.length; i++) { 72 | out.push(v[i] * s); 73 | } 74 | return out; 75 | } 76 | 77 | 78 | function project_along(v1, v2, t) { 79 | const v = minus(v2, v1); 80 | const num = dot(minus(t, v1), v); 81 | const denom = dot(v, v); 82 | return num / denom; 83 | } 84 | 85 | function share() { 86 | // We use the stored guesses here, because those are not updated again 87 | // once you win -- we don't want to include post-win guesses here. 88 | const text = solveStory(JSON.parse(storage.getItem("guesses")), puzzleNumber); 89 | const copied = ClipboardJS.copy(text); 90 | 91 | if (copied) { 92 | alert("Panoya kopyalandı"); 93 | } else { 94 | alert("Panoya kopyalama başarısız oldu"); 95 | } 96 | } 97 | 98 | const words_selected = []; 99 | const cache = {}; 100 | let secret = ""; 101 | let secretVec = null; 102 | let similarityStory = null; 103 | 104 | function select(word, secretVec) { 105 | /* 106 | let model; 107 | if (!(word in cache)) { 108 | // this can happen on a reload, since we do not store 109 | // the vectors in localstorage 110 | model = cache[word]; 111 | } else { 112 | model = getModel(word); 113 | cache[word] = model; 114 | } 115 | words_selected.push([word, model.vec]); 116 | if (words_selected.length > 2) { 117 | words_selected.pop(); 118 | } 119 | const proj = project_along(words_selected[0][1], words_selected[1][1], 120 | target); 121 | console.log(proj); 122 | */ 123 | } 124 | 125 | function guessRow(similarity, oldGuess, percentile, guessNumber, guess) { 126 | let percentileText = "(soğuk)"; 127 | let progress = ""; 128 | let cls = ""; 129 | if (similarity >= similarityStory.rest * 100) { 130 | percentileText = '????Alışılmışın dışında sözcük bulundu! Bu sözcük yakın sözcükler için kullandığımız listede olmamasına rağmen yine de ilişkili! (Bir kısaltma ya da özel isim olabilir mi?)'; 131 | } 132 | if (percentile) { 133 | if (percentile == 1000) { 134 | percentileText = "BULUNDU!"; 135 | } else { 136 | cls = "close"; 137 | percentileText = `${percentile}/1000 `; 138 | progress = ` 139 |   140 | `; 141 | } 142 | } 143 | let color; 144 | if (oldGuess === guess) { 145 | color = '#c0c'; 146 | } else if (darkMode) { 147 | color = '#fafafa'; 148 | } else { 149 | color = '#000'; 150 | } 151 | const similarityLevel = similarity * 2.55; 152 | let similarityColor; 153 | if (darkMode) { 154 | similarityColor = `255,${255 - similarityLevel},${255 - similarityLevel}`; 155 | } else { 156 | similarityColor = `${similarityLevel},0,0`; 157 | } 158 | return `${guessNumber}${oldGuess}${similarity.toFixed(2)}${percentileText}${progress} 159 | `; 160 | 161 | } 162 | 163 | function updateLocalTime() { 164 | const now = new Date(); 165 | now.setUTCHours(21, 0, 0, 0); 166 | 167 | $('#localtime').innerHTML = ` ${now.getHours()}:00'a karşılık geliyor`; 168 | } 169 | 170 | function solveStory(guesses, puzzleNumber) { 171 | const guess_count = guesses.length; 172 | if (guess_count == 0) { 173 | return `Semantle Türkçe ${puzzleNumber} numaralı bulmacada tek bir tahminde bile bulunmadan pes ettim.`; 174 | } 175 | 176 | if (guess_count == 1) { 177 | return `Semantle Türkçe ${puzzleNumber} numaralı bulmacayı ilk tahminimde çözdüm!`; 178 | } 179 | 180 | let describe = function (similarity, percentile) { 181 | let out = `${similarity.toFixed(2)} idi`; 182 | if (percentile) { 183 | out += ` (${percentile}/1000)`; 184 | } 185 | return out; 186 | } 187 | 188 | const guesses_chrono = guesses.slice(); 189 | guesses_chrono.sort(function (a, b) { 190 | return a[3] - b[3] 191 | }); 192 | 193 | let [similarity, old_guess, percentile, guess_number] = guesses_chrono[0]; 194 | let first_guess = `İlk tahminimin benzerlik skoru ${describe(similarity, percentile)}. `; 195 | let first_guess_in_top = !!percentile; 196 | 197 | let first_hit = ''; 198 | if (!first_guess_in_top) { 199 | for (let entry of guesses_chrono) { 200 | [similarity, old_guess, percentile, guess_number] = entry; 201 | if (percentile) { 202 | first_hit = `En yakın 1000'e girebilen ilk tahminim ${guess_number}. tahminimdi. `; 203 | break; 204 | } 205 | } 206 | } 207 | 208 | const penultimate_guess = guesses_chrono[guesses_chrono.length - 2]; 209 | [similarity, old_guess, percentile, guess_number] = penultimate_guess; 210 | const penultimate_guess_msg = `Sondan bir önceki tahminimin benzerlik skoru ise ${describe(similarity, percentile)}. `; 211 | 212 | return `Semantle Türkçe ${puzzleNumber} numaralı bulmacayı ${guess_count} tahminde çözdüm. ${first_guess}${first_hit}${penultimate_guess_msg}http://semantle.ozanalpay.com/`; 213 | } 214 | 215 | let Semantle = (function () { 216 | async function getSimilarityStory(secret) { 217 | const url = "/similarity/" + secret; 218 | const response = await fetch(url); 219 | try { 220 | return await response.json(); 221 | } catch (e) { 222 | return null; 223 | } 224 | } 225 | 226 | async function getModel(word) { 227 | if (cache.hasOwnProperty(word)) { 228 | return cache[word]; 229 | } 230 | const url = "/model2/" + secret + "/" + word.replace(/\ /gi, "_"); 231 | const response = await fetch(url); 232 | try { 233 | return await response.json(); 234 | } catch (e) { 235 | return null; 236 | } 237 | } 238 | 239 | async function getNearby(word) { 240 | const url = "/nearby/" + word; 241 | const response = await fetch(url); 242 | try { 243 | return await response.json(); 244 | } catch (e) { 245 | return null; 246 | } 247 | } 248 | 249 | async function init() { 250 | secret = secretWords[puzzleNumber].toLowerCase(); 251 | const yesterday = secretWords[yesterdayPuzzleNumber].toLowerCase(); 252 | 253 | $('#yesterday').innerHTML = `Dünün sözcüğü: "${yesterday}".`; 254 | $('#yesterday2').innerHTML = yesterday; 255 | 256 | $('#lower').checked = storage.getItem("lower") == "true"; 257 | 258 | $('#lower').onchange = (e) => { 259 | storage.setItem("lower", "" + $('#lower').checked); 260 | }; 261 | 262 | try { 263 | const yesterdayNearby = await getNearby(yesterday); 264 | const secretBase64 = btoa(unescape(encodeURIComponent(yesterday))); 265 | $('#nearbyYesterday').innerHTML = `Azalan yakınlık sırasına göre: ${yesterdayNearby.join(", ")}. Devamını Gör`; 266 | } catch (e) { 267 | $('#nearbyYesterday').innerHTML = `Yakında!`; 268 | } 269 | updateLocalTime(); 270 | 271 | try { 272 | similarityStory = await getSimilarityStory(secret); 273 | $('#similarity-story').innerHTML = `Bugünün oyun numarası ${puzzleNumber}. En yakın sözcüğün benzerlik skoru ${(similarityStory.top * 100).toFixed(2)}, en yakın onuncu sözcüğün yakınlık skoru ${(similarityStory.top10 * 100).toFixed(2)}, ve en yakın bininci sözcüğün yakınlık skoru ise ${(similarityStory.rest * 100).toFixed(2)}.`; 274 | } catch { 275 | // we can live without this in the event that something is broken 276 | } 277 | 278 | const storagePuzzleNumber = storage.getItem("puzzleNumber"); 279 | if (storagePuzzleNumber != puzzleNumber) { 280 | storage.removeItem("guesses"); 281 | storage.removeItem("winState"); 282 | storage.setItem("puzzleNumber", puzzleNumber); 283 | } 284 | 285 | document.querySelectorAll(".dialog-close").forEach((el) => { 286 | el.innerHTML = "" 287 | el.appendChild($("#x-icon").content.cloneNode(true)); 288 | }); 289 | 290 | if (!storage.getItem("readRules")) { 291 | openRules(); 292 | } 293 | 294 | $("#rules-button").addEventListener('click', openRules); 295 | $("#settings-button").addEventListener('click', openSettings); 296 | 297 | document.querySelectorAll(".dialog-underlay, .dialog-close, #capitalized-link").forEach((el) => { 298 | el.addEventListener('click', () => { 299 | document.body.classList.remove('dialog-open', 'rules-open', 'settings-open'); 300 | }); 301 | }); 302 | 303 | document.querySelectorAll(".dialog").forEach((el) => { 304 | el.addEventListener("click", (event) => { 305 | // prevents click from propagating to the underlay, which closes the rules 306 | event.stopPropagation(); 307 | }); 308 | }); 309 | 310 | $("#dark-mode").addEventListener('click', function (event) { 311 | storage.setItem("prefersDarkColorScheme", event.target.checked); 312 | darkModeMql.onchange = null; 313 | darkMode = event.target.checked; 314 | toggleDarkMode(darkMode); 315 | updateGuesses(); 316 | }); 317 | 318 | toggleDarkMode(darkMode); 319 | 320 | if (storage.getItem("prefersDarkColorScheme") === null) { 321 | $("#dark-mode").checked = false; 322 | $("#dark-mode").indeterminate = true; 323 | } 324 | 325 | $('#give-up-btn').addEventListener('click', function (event) { 326 | if (!gameOver) { 327 | if (confirm("Pes etmek istediğinize emin misiniz?")) { 328 | endGame(false, true); 329 | } 330 | } 331 | }); 332 | 333 | $('#form').addEventListener('submit', async function (event) { 334 | event.preventDefault(); 335 | if (secretVec === null) { 336 | secretVec = (await getModel(secret)).vec; 337 | } 338 | $('#guess').focus(); 339 | $('#error').textContent = ""; 340 | let guess = $('#guess').value.trim().replace("!", "").replace("*", ""); 341 | if (!guess) { 342 | return false; 343 | } 344 | if ($("#lower").checked) { 345 | guess = guess.toLowerCase(); 346 | } 347 | 348 | if (guess[0].toLowerCase() != guess[0]) { 349 | caps += 1; 350 | } 351 | if (caps >= 2 && (caps / guesses.length) > 0.4 && !warnedCaps) { 352 | warnedCaps = true; 353 | $("#lower").checked = confirm("Girdiğiniz sözcüklerin ilk harfleri büyük gözüküyor. Bu bazı kelimelerde sorunlara yol açabiliyor, bunu otomatik olarak düzeltmemi ister misiniz?"); 354 | storage.setItem("lower", "true"); 355 | } 356 | 357 | $('#guess').value = ""; 358 | 359 | const guessData = await getModel(guess); 360 | if (!guessData) { 361 | $('#error').textContent = `${guess} diye bir sözcük veritabanımda kayıtlı değil.`; 362 | return false; 363 | } 364 | 365 | let percentile = guessData.percentile; 366 | 367 | const guessVec = guessData.vec; 368 | 369 | cache[guess] = guessData; 370 | 371 | let similarity = getCosSim(guessVec, secretVec) * 100.0; 372 | if (!guessed.has(guess)) { 373 | if (!gameOver) { 374 | guessCount += 1; 375 | } 376 | guessed.add(guess); 377 | 378 | const newEntry = [similarity, guess, percentile, guessCount]; 379 | guesses.push(newEntry); 380 | 381 | const stats = getStats(); 382 | if (!gameOver) { 383 | stats['totalGuesses'] += 1; 384 | } 385 | storage.setItem('stats', JSON.stringify(stats)); 386 | } 387 | guesses.sort(function (a, b) { 388 | return b[0] - a[0] 389 | }); 390 | 391 | if (!gameOver) { 392 | saveGame(-1, -1); 393 | } 394 | 395 | chrono_forward = 1; 396 | 397 | latestGuess = guess; 398 | updateGuesses(); 399 | 400 | firstGuess = false; 401 | if (guess.toLowerCase() === secret && !gameOver) { 402 | endGame(true, true); 403 | } 404 | return false; 405 | }); 406 | 407 | const winState = storage.getItem("winState"); 408 | if (winState != null) { 409 | guesses = JSON.parse(storage.getItem("guesses")); 410 | for (let guess of guesses) { 411 | guessed.add(guess[1]); 412 | } 413 | guessCount = guessed.size; 414 | latestGuess = ""; 415 | updateGuesses(); 416 | if (winState != -1) { 417 | endGame(winState > 0, false); 418 | } 419 | } 420 | } 421 | 422 | function openRules() { 423 | document.body.classList.add('dialog-open', 'rules-open'); 424 | storage.setItem("readRules", true); 425 | $("#rules-close").focus(); 426 | } 427 | 428 | function openSettings() { 429 | document.body.classList.add('dialog-open', 'settings-open'); 430 | $("#settings-close").focus(); 431 | } 432 | 433 | function updateGuesses() { 434 | let inner = `#TahminBenzerlikYakın mı?`; 435 | /* This is dumb: first we find the most-recent word, and put 436 | it at the top. Then we do the rest. */ 437 | for (let entry of guesses) { 438 | let [similarity, oldGuess, percentile, guessNumber] = entry; 439 | if (oldGuess == latestGuess) { 440 | inner += guessRow(similarity, oldGuess, percentile, guessNumber, latestGuess); 441 | } 442 | } 443 | inner += "
"; 444 | for (let entry of guesses) { 445 | let [similarity, oldGuess, percentile, guessNumber] = entry; 446 | if (oldGuess != latestGuess) { 447 | inner += guessRow(similarity, oldGuess, percentile, guessNumber); 448 | } 449 | } 450 | $('#guesses').innerHTML = inner; 451 | $('#chronoOrder').addEventListener('click', event => { 452 | guesses.sort(function (a, b) { 453 | return chrono_forward * (a[3] - b[3]) 454 | }); 455 | chrono_forward *= -1; 456 | updateGuesses(); 457 | }); 458 | $('#alphaOrder').addEventListener('click', event => { 459 | guesses.sort(function (a, b) { 460 | return a[1].localeCompare(b[1]) 461 | }); 462 | chrono_forward = 1; 463 | updateGuesses(); 464 | }); 465 | $('#similarityOrder').addEventListener('click', event => { 466 | guesses.sort(function (a, b) { 467 | return b[0] - a[0] 468 | }); 469 | chrono_forward = 1; 470 | updateGuesses(); 471 | }); 472 | } 473 | 474 | function toggleDarkMode(on) { 475 | document.body.classList[on ? 'add' : 'remove']('dark'); 476 | const darkModeCheckbox = $("#dark-mode"); 477 | // this runs before the DOM is ready, so we need to check 478 | if (darkModeCheckbox) { 479 | darkModeCheckbox.checked = on; 480 | } 481 | } 482 | 483 | function checkMedia() { 484 | const storagePrefersDarkColorScheme = storage.getItem("prefersDarkColorScheme"); 485 | if (storagePrefersDarkColorScheme === 'true' || storagePrefersDarkColorScheme === 'false') { 486 | darkMode = storagePrefersDarkColorScheme === 'true'; 487 | } else { 488 | darkMode = darkModeMql.matches; 489 | darkModeMql.onchange = (e) => { 490 | darkMode = e.matches; 491 | toggleDarkMode(darkMode) 492 | updateGuesses(); 493 | } 494 | } 495 | toggleDarkMode(darkMode); 496 | } 497 | 498 | function saveGame(guessCount, winState) { 499 | // If we are in a tab still open from yesterday, we're done here. 500 | // Don't save anything because we may overwrite today's game! 501 | let savedPuzzleNumber = storage.getItem("puzzleNumber"); 502 | if (savedPuzzleNumber != puzzleNumber) { 503 | return 504 | } 505 | 506 | storage.setItem("winState", winState); 507 | storage.setItem("guesses", JSON.stringify(guesses)); 508 | } 509 | 510 | function getStats() { 511 | const oldStats = storage.getItem("stats"); 512 | if (oldStats == null) { 513 | const stats = { 514 | 'firstPlay': puzzleNumber, 515 | 'lastEnd': puzzleNumber - 1, 516 | 'lastPlay': puzzleNumber, 517 | 'winStreak': 0, 518 | 'playStreak': 0, 519 | 'totalGuesses': 0, 520 | 'wins': 0, 521 | 'giveups': 0, 522 | 'abandons': 0, 523 | 'totalPlays': 0, 524 | }; 525 | storage.setItem("stats", JSON.stringify(stats)); 526 | return stats; 527 | } else { 528 | const stats = JSON.parse(oldStats); 529 | if (stats['lastPlay'] != puzzleNumber) { 530 | const onStreak = (stats['lastPlay'] == puzzleNumber - 1); 531 | if (onStreak) { 532 | stats['playStreak'] += 1; 533 | } 534 | stats['totalPlays'] += 1; 535 | if (stats['lastEnd'] != puzzleNumber - 1) { 536 | stats['abandons'] += 1; 537 | } 538 | stats['lastPlay'] = puzzleNumber; 539 | } 540 | return stats; 541 | } 542 | } 543 | 544 | function endGame(won, countStats) { 545 | let stats; 546 | 547 | stats = getStats(); 548 | if (countStats) { 549 | const onStreak = (stats['lastEnd'] == puzzleNumber - 1); 550 | 551 | stats['lastEnd'] = puzzleNumber; 552 | if (won) { 553 | if (onStreak) { 554 | stats['winStreak'] += 1; 555 | } else { 556 | stats['winStreak'] = 1; 557 | } 558 | stats['wins'] += 1; 559 | } else { 560 | stats['winStreak'] = 0; 561 | stats['giveups'] += 1; 562 | } 563 | storage.setItem("stats", JSON.stringify(stats)); 564 | } 565 | 566 | $('#give-up-btn').style = "display:none;"; 567 | $('#response').classList.add("gaveup"); 568 | gameOver = true; 569 | const secretBase64 = btoa(unescape(encodeURIComponent(secret))); 570 | let response; 571 | if (won) { 572 | response = `

${guesses.length}. tahminde günün sözcüğünü (${secret}) buldun!. Eğer başka sözcüklerle olan benzerliği merak ediyorsan, kelime girmeye devam edebilirsin. Sonuçlarını paylaşmak istersen buraya tıklayabilirsin. Bugünün sözcüğüne en yakın sözcükleri görmek istersen buraya tıklayabilirsin. Yarın görüşmek üzere!

` 573 | } else { 574 | response = `

Pes ettin! Günün sözcüğü ${secret}. Eğer başka sözcüklerle olan benzerliği merak ediyorsan, kelime girmeye devam edebilirsin. Bugünün sözcüğüne en yakın sözcükleri görmek istersen buraya tıklayabilirsin. Yarın görüşmek üzere!

`; 575 | } 576 | 577 | const totalGames = stats['wins'] + stats['giveups'] + stats['abandons']; 578 | response += `
579 | İstatistikler:
580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 |
İlk oyun:${stats['firstPlay']}
Oynanan gün sayısı: ${totalGames}
Kazanılan oyun sayısı:${stats['wins']}
Aralıksız kazanılan oyun sayısı:${stats['winStreak']}
Pes edilen oyun sayısı:${stats['giveups']}
Bitirilmeyen oyun sayısı:${stats['abandons']}
Bugüne kadarki toplam tahmin sayısı:${stats['totalGuesses']}
Bugüne kadarki ortalama tahmin sayısı:${(stats['totalGuesses'] / totalGames).toFixed(2)}
590 | `; 591 | 592 | $('#response').innerHTML = response; 593 | 594 | if (countStats) { 595 | saveGame(guesses.length, won ? 1 : 0); 596 | } 597 | } 598 | 599 | return { 600 | init: init, 601 | checkMedia: checkMedia, 602 | }; 603 | })(); 604 | 605 | // do this when the file loads instead of waiting for DOM to be ready to avoid 606 | // a flash of unstyled content 607 | Semantle.checkMedia(); 608 | 609 | window.addEventListener('load', async () => { 610 | Semantle.init() 611 | }); 612 | -------------------------------------------------------------------------------- /static/assets/js/clipboard.js: -------------------------------------------------------------------------------- 1 | /*! 2 | * clipboard.js v2.0.10 3 | * https://clipboardjs.com/ 4 | * 5 | * Licensed MIT © Zeno Rocha 6 | */ 7 | (function webpackUniversalModuleDefinition(root, factory) { 8 | if(typeof exports === 'object' && typeof module === 'object') 9 | module.exports = factory(); 10 | else if(typeof define === 'function' && define.amd) 11 | define([], factory); 12 | else if(typeof exports === 'object') 13 | exports["ClipboardJS"] = factory(); 14 | else 15 | root["ClipboardJS"] = factory(); 16 | })(this, function() { 17 | return /******/ (function() { // webpackBootstrap 18 | /******/ var __webpack_modules__ = ({ 19 | 20 | /***/ 686: 21 | /***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) { 22 | 23 | "use strict"; 24 | 25 | // EXPORTS 26 | __webpack_require__.d(__webpack_exports__, { 27 | "default": function() { return /* binding */ clipboard; } 28 | }); 29 | 30 | // EXTERNAL MODULE: ./node_modules/tiny-emitter/index.js 31 | var tiny_emitter = __webpack_require__(279); 32 | var tiny_emitter_default = /*#__PURE__*/__webpack_require__.n(tiny_emitter); 33 | // EXTERNAL MODULE: ./node_modules/good-listener/src/listen.js 34 | var listen = __webpack_require__(370); 35 | var listen_default = /*#__PURE__*/__webpack_require__.n(listen); 36 | // EXTERNAL MODULE: ./node_modules/select/src/select.js 37 | var src_select = __webpack_require__(817); 38 | var select_default = /*#__PURE__*/__webpack_require__.n(src_select); 39 | ;// CONCATENATED MODULE: ./src/common/command.js 40 | /** 41 | * Executes a given operation type. 42 | * @param {String} type 43 | * @return {Boolean} 44 | */ 45 | function command(type) { 46 | try { 47 | return document.execCommand(type); 48 | } catch (err) { 49 | return false; 50 | } 51 | } 52 | ;// CONCATENATED MODULE: ./src/actions/cut.js 53 | 54 | 55 | /** 56 | * Cut action wrapper. 57 | * @param {String|HTMLElement} target 58 | * @return {String} 59 | */ 60 | 61 | var ClipboardActionCut = function ClipboardActionCut(target) { 62 | var selectedText = select_default()(target); 63 | command('cut'); 64 | return selectedText; 65 | }; 66 | 67 | /* harmony default export */ var actions_cut = (ClipboardActionCut); 68 | ;// CONCATENATED MODULE: ./src/common/create-fake-element.js 69 | /** 70 | * Creates a fake textarea element with a value. 71 | * @param {String} value 72 | * @return {HTMLElement} 73 | */ 74 | function createFakeElement(value) { 75 | var isRTL = document.documentElement.getAttribute('dir') === 'rtl'; 76 | var fakeElement = document.createElement('textarea'); // Prevent zooming on iOS 77 | 78 | fakeElement.style.fontSize = '12pt'; // Reset box model 79 | 80 | fakeElement.style.border = '0'; 81 | fakeElement.style.padding = '0'; 82 | fakeElement.style.margin = '0'; // Move element out of screen horizontally 83 | 84 | fakeElement.style.position = 'absolute'; 85 | fakeElement.style[isRTL ? 'right' : 'left'] = '-9999px'; // Move element to the same position vertically 86 | 87 | var yPosition = window.pageYOffset || document.documentElement.scrollTop; 88 | fakeElement.style.top = "".concat(yPosition, "px"); 89 | fakeElement.setAttribute('readonly', ''); 90 | fakeElement.value = value; 91 | return fakeElement; 92 | } 93 | ;// CONCATENATED MODULE: ./src/actions/copy.js 94 | 95 | 96 | 97 | /** 98 | * Copy action wrapper. 99 | * @param {String|HTMLElement} target 100 | * @param {Object} options 101 | * @return {String} 102 | */ 103 | 104 | var ClipboardActionCopy = function ClipboardActionCopy(target) { 105 | var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : { 106 | container: document.body 107 | }; 108 | var selectedText = ''; 109 | 110 | if (typeof target === 'string') { 111 | var fakeElement = createFakeElement(target); 112 | options.container.appendChild(fakeElement); 113 | selectedText = select_default()(fakeElement); 114 | command('copy'); 115 | fakeElement.remove(); 116 | } else { 117 | selectedText = select_default()(target); 118 | command('copy'); 119 | } 120 | 121 | return selectedText; 122 | }; 123 | 124 | /* harmony default export */ var actions_copy = (ClipboardActionCopy); 125 | ;// CONCATENATED MODULE: ./src/actions/default.js 126 | function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } 127 | 128 | 129 | 130 | /** 131 | * Inner function which performs selection from either `text` or `target` 132 | * properties and then executes copy or cut operations. 133 | * @param {Object} options 134 | */ 135 | 136 | var ClipboardActionDefault = function ClipboardActionDefault() { 137 | var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; 138 | // Defines base properties passed from constructor. 139 | var _options$action = options.action, 140 | action = _options$action === void 0 ? 'copy' : _options$action, 141 | container = options.container, 142 | target = options.target, 143 | text = options.text; // Sets the `action` to be performed which can be either 'copy' or 'cut'. 144 | 145 | if (action !== 'copy' && action !== 'cut') { 146 | throw new Error('Invalid "action" value, use either "copy" or "cut"'); 147 | } // Sets the `target` property using an element that will be have its content copied. 148 | 149 | 150 | if (target !== undefined) { 151 | if (target && _typeof(target) === 'object' && target.nodeType === 1) { 152 | if (action === 'copy' && target.hasAttribute('disabled')) { 153 | throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute'); 154 | } 155 | 156 | if (action === 'cut' && (target.hasAttribute('readonly') || target.hasAttribute('disabled'))) { 157 | throw new Error('Invalid "target" attribute. You can\'t cut text from elements with "readonly" or "disabled" attributes'); 158 | } 159 | } else { 160 | throw new Error('Invalid "target" value, use a valid Element'); 161 | } 162 | } // Define selection strategy based on `text` property. 163 | 164 | 165 | if (text) { 166 | return actions_copy(text, { 167 | container: container 168 | }); 169 | } // Defines which selection strategy based on `target` property. 170 | 171 | 172 | if (target) { 173 | return action === 'cut' ? actions_cut(target) : actions_copy(target, { 174 | container: container 175 | }); 176 | } 177 | }; 178 | 179 | /* harmony default export */ var actions_default = (ClipboardActionDefault); 180 | ;// CONCATENATED MODULE: ./src/clipboard.js 181 | function clipboard_typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { clipboard_typeof = function _typeof(obj) { return typeof obj; }; } else { clipboard_typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return clipboard_typeof(obj); } 182 | 183 | function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } 184 | 185 | function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } 186 | 187 | function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } 188 | 189 | function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } 190 | 191 | function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } 192 | 193 | function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; } 194 | 195 | function _possibleConstructorReturn(self, call) { if (call && (clipboard_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } 196 | 197 | function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } 198 | 199 | function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } } 200 | 201 | function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } 202 | 203 | 204 | 205 | 206 | 207 | 208 | /** 209 | * Helper function to retrieve attribute value. 210 | * @param {String} suffix 211 | * @param {Element} element 212 | */ 213 | 214 | function getAttributeValue(suffix, element) { 215 | var attribute = "data-clipboard-".concat(suffix); 216 | 217 | if (!element.hasAttribute(attribute)) { 218 | return; 219 | } 220 | 221 | return element.getAttribute(attribute); 222 | } 223 | /** 224 | * Base class which takes one or more elements, adds event listeners to them, 225 | * and instantiates a new `ClipboardAction` on each click. 226 | */ 227 | 228 | 229 | var Clipboard = /*#__PURE__*/function (_Emitter) { 230 | _inherits(Clipboard, _Emitter); 231 | 232 | var _super = _createSuper(Clipboard); 233 | 234 | /** 235 | * @param {String|HTMLElement|HTMLCollection|NodeList} trigger 236 | * @param {Object} options 237 | */ 238 | function Clipboard(trigger, options) { 239 | var _this; 240 | 241 | _classCallCheck(this, Clipboard); 242 | 243 | _this = _super.call(this); 244 | 245 | _this.resolveOptions(options); 246 | 247 | _this.listenClick(trigger); 248 | 249 | return _this; 250 | } 251 | /** 252 | * Defines if attributes would be resolved using internal setter functions 253 | * or custom functions that were passed in the constructor. 254 | * @param {Object} options 255 | */ 256 | 257 | 258 | _createClass(Clipboard, [{ 259 | key: "resolveOptions", 260 | value: function resolveOptions() { 261 | var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {}; 262 | this.action = typeof options.action === 'function' ? options.action : this.defaultAction; 263 | this.target = typeof options.target === 'function' ? options.target : this.defaultTarget; 264 | this.text = typeof options.text === 'function' ? options.text : this.defaultText; 265 | this.container = clipboard_typeof(options.container) === 'object' ? options.container : document.body; 266 | } 267 | /** 268 | * Adds a click event listener to the passed trigger. 269 | * @param {String|HTMLElement|HTMLCollection|NodeList} trigger 270 | */ 271 | 272 | }, { 273 | key: "listenClick", 274 | value: function listenClick(trigger) { 275 | var _this2 = this; 276 | 277 | this.listener = listen_default()(trigger, 'click', function (e) { 278 | return _this2.onClick(e); 279 | }); 280 | } 281 | /** 282 | * Defines a new `ClipboardAction` on each click event. 283 | * @param {Event} e 284 | */ 285 | 286 | }, { 287 | key: "onClick", 288 | value: function onClick(e) { 289 | var trigger = e.delegateTarget || e.currentTarget; 290 | var action = this.action(trigger) || 'copy'; 291 | var text = actions_default({ 292 | action: action, 293 | container: this.container, 294 | target: this.target(trigger), 295 | text: this.text(trigger) 296 | }); // Fires an event based on the copy operation result. 297 | 298 | this.emit(text ? 'success' : 'error', { 299 | action: action, 300 | text: text, 301 | trigger: trigger, 302 | clearSelection: function clearSelection() { 303 | if (trigger) { 304 | trigger.focus(); 305 | } 306 | 307 | document.activeElement.blur(); 308 | window.getSelection().removeAllRanges(); 309 | } 310 | }); 311 | } 312 | /** 313 | * Default `action` lookup function. 314 | * @param {Element} trigger 315 | */ 316 | 317 | }, { 318 | key: "defaultAction", 319 | value: function defaultAction(trigger) { 320 | return getAttributeValue('action', trigger); 321 | } 322 | /** 323 | * Default `target` lookup function. 324 | * @param {Element} trigger 325 | */ 326 | 327 | }, { 328 | key: "defaultTarget", 329 | value: function defaultTarget(trigger) { 330 | var selector = getAttributeValue('target', trigger); 331 | 332 | if (selector) { 333 | return document.querySelector(selector); 334 | } 335 | } 336 | /** 337 | * Allow fire programmatically a copy action 338 | * @param {String|HTMLElement} target 339 | * @param {Object} options 340 | * @returns Text copied. 341 | */ 342 | 343 | }, { 344 | key: "defaultText", 345 | 346 | /** 347 | * Default `text` lookup function. 348 | * @param {Element} trigger 349 | */ 350 | value: function defaultText(trigger) { 351 | return getAttributeValue('text', trigger); 352 | } 353 | /** 354 | * Destroy lifecycle. 355 | */ 356 | 357 | }, { 358 | key: "destroy", 359 | value: function destroy() { 360 | this.listener.destroy(); 361 | } 362 | }], [{ 363 | key: "copy", 364 | value: function copy(target) { 365 | var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : { 366 | container: document.body 367 | }; 368 | return actions_copy(target, options); 369 | } 370 | /** 371 | * Allow fire programmatically a cut action 372 | * @param {String|HTMLElement} target 373 | * @returns Text cutted. 374 | */ 375 | 376 | }, { 377 | key: "cut", 378 | value: function cut(target) { 379 | return actions_cut(target); 380 | } 381 | /** 382 | * Returns the support of the given action, or all actions if no action is 383 | * given. 384 | * @param {String} [action] 385 | */ 386 | 387 | }, { 388 | key: "isSupported", 389 | value: function isSupported() { 390 | var action = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : ['copy', 'cut']; 391 | var actions = typeof action === 'string' ? [action] : action; 392 | var support = !!document.queryCommandSupported; 393 | actions.forEach(function (action) { 394 | support = support && !!document.queryCommandSupported(action); 395 | }); 396 | return support; 397 | } 398 | }]); 399 | 400 | return Clipboard; 401 | }((tiny_emitter_default())); 402 | 403 | /* harmony default export */ var clipboard = (Clipboard); 404 | 405 | /***/ }), 406 | 407 | /***/ 828: 408 | /***/ (function(module) { 409 | 410 | var DOCUMENT_NODE_TYPE = 9; 411 | 412 | /** 413 | * A polyfill for Element.matches() 414 | */ 415 | if (typeof Element !== 'undefined' && !Element.prototype.matches) { 416 | var proto = Element.prototype; 417 | 418 | proto.matches = proto.matchesSelector || 419 | proto.mozMatchesSelector || 420 | proto.msMatchesSelector || 421 | proto.oMatchesSelector || 422 | proto.webkitMatchesSelector; 423 | } 424 | 425 | /** 426 | * Finds the closest parent that matches a selector. 427 | * 428 | * @param {Element} element 429 | * @param {String} selector 430 | * @return {Function} 431 | */ 432 | function closest (element, selector) { 433 | while (element && element.nodeType !== DOCUMENT_NODE_TYPE) { 434 | if (typeof element.matches === 'function' && 435 | element.matches(selector)) { 436 | return element; 437 | } 438 | element = element.parentNode; 439 | } 440 | } 441 | 442 | module.exports = closest; 443 | 444 | 445 | /***/ }), 446 | 447 | /***/ 438: 448 | /***/ (function(module, __unused_webpack_exports, __webpack_require__) { 449 | 450 | var closest = __webpack_require__(828); 451 | 452 | /** 453 | * Delegates event to a selector. 454 | * 455 | * @param {Element} element 456 | * @param {String} selector 457 | * @param {String} type 458 | * @param {Function} callback 459 | * @param {Boolean} useCapture 460 | * @return {Object} 461 | */ 462 | function _delegate(element, selector, type, callback, useCapture) { 463 | var listenerFn = listener.apply(this, arguments); 464 | 465 | element.addEventListener(type, listenerFn, useCapture); 466 | 467 | return { 468 | destroy: function() { 469 | element.removeEventListener(type, listenerFn, useCapture); 470 | } 471 | } 472 | } 473 | 474 | /** 475 | * Delegates event to a selector. 476 | * 477 | * @param {Element|String|Array} [elements] 478 | * @param {String} selector 479 | * @param {String} type 480 | * @param {Function} callback 481 | * @param {Boolean} useCapture 482 | * @return {Object} 483 | */ 484 | function delegate(elements, selector, type, callback, useCapture) { 485 | // Handle the regular Element usage 486 | if (typeof elements.addEventListener === 'function') { 487 | return _delegate.apply(null, arguments); 488 | } 489 | 490 | // Handle Element-less usage, it defaults to global delegation 491 | if (typeof type === 'function') { 492 | // Use `document` as the first parameter, then apply arguments 493 | // This is a short way to .unshift `arguments` without running into deoptimizations 494 | return _delegate.bind(null, document).apply(null, arguments); 495 | } 496 | 497 | // Handle Selector-based usage 498 | if (typeof elements === 'string') { 499 | elements = document.querySelectorAll(elements); 500 | } 501 | 502 | // Handle Array-like based usage 503 | return Array.prototype.map.call(elements, function (element) { 504 | return _delegate(element, selector, type, callback, useCapture); 505 | }); 506 | } 507 | 508 | /** 509 | * Finds closest match and invokes callback. 510 | * 511 | * @param {Element} element 512 | * @param {String} selector 513 | * @param {String} type 514 | * @param {Function} callback 515 | * @return {Function} 516 | */ 517 | function listener(element, selector, type, callback) { 518 | return function(e) { 519 | e.delegateTarget = closest(e.target, selector); 520 | 521 | if (e.delegateTarget) { 522 | callback.call(element, e); 523 | } 524 | } 525 | } 526 | 527 | module.exports = delegate; 528 | 529 | 530 | /***/ }), 531 | 532 | /***/ 879: 533 | /***/ (function(__unused_webpack_module, exports) { 534 | 535 | /** 536 | * Check if argument is a HTML element. 537 | * 538 | * @param {Object} value 539 | * @return {Boolean} 540 | */ 541 | exports.node = function(value) { 542 | return value !== undefined 543 | && value instanceof HTMLElement 544 | && value.nodeType === 1; 545 | }; 546 | 547 | /** 548 | * Check if argument is a list of HTML elements. 549 | * 550 | * @param {Object} value 551 | * @return {Boolean} 552 | */ 553 | exports.nodeList = function(value) { 554 | var type = Object.prototype.toString.call(value); 555 | 556 | return value !== undefined 557 | && (type === '[object NodeList]' || type === '[object HTMLCollection]') 558 | && ('length' in value) 559 | && (value.length === 0 || exports.node(value[0])); 560 | }; 561 | 562 | /** 563 | * Check if argument is a string. 564 | * 565 | * @param {Object} value 566 | * @return {Boolean} 567 | */ 568 | exports.string = function(value) { 569 | return typeof value === 'string' 570 | || value instanceof String; 571 | }; 572 | 573 | /** 574 | * Check if argument is a function. 575 | * 576 | * @param {Object} value 577 | * @return {Boolean} 578 | */ 579 | exports.fn = function(value) { 580 | var type = Object.prototype.toString.call(value); 581 | 582 | return type === '[object Function]'; 583 | }; 584 | 585 | 586 | /***/ }), 587 | 588 | /***/ 370: 589 | /***/ (function(module, __unused_webpack_exports, __webpack_require__) { 590 | 591 | var is = __webpack_require__(879); 592 | var delegate = __webpack_require__(438); 593 | 594 | /** 595 | * Validates all params and calls the right 596 | * listener function based on its target type. 597 | * 598 | * @param {String|HTMLElement|HTMLCollection|NodeList} target 599 | * @param {String} type 600 | * @param {Function} callback 601 | * @return {Object} 602 | */ 603 | function listen(target, type, callback) { 604 | if (!target && !type && !callback) { 605 | throw new Error('Missing required arguments'); 606 | } 607 | 608 | if (!is.string(type)) { 609 | throw new TypeError('Second argument must be a String'); 610 | } 611 | 612 | if (!is.fn(callback)) { 613 | throw new TypeError('Third argument must be a Function'); 614 | } 615 | 616 | if (is.node(target)) { 617 | return listenNode(target, type, callback); 618 | } 619 | else if (is.nodeList(target)) { 620 | return listenNodeList(target, type, callback); 621 | } 622 | else if (is.string(target)) { 623 | return listenSelector(target, type, callback); 624 | } 625 | else { 626 | throw new TypeError('First argument must be a String, HTMLElement, HTMLCollection, or NodeList'); 627 | } 628 | } 629 | 630 | /** 631 | * Adds an event listener to a HTML element 632 | * and returns a remove listener function. 633 | * 634 | * @param {HTMLElement} node 635 | * @param {String} type 636 | * @param {Function} callback 637 | * @return {Object} 638 | */ 639 | function listenNode(node, type, callback) { 640 | node.addEventListener(type, callback); 641 | 642 | return { 643 | destroy: function() { 644 | node.removeEventListener(type, callback); 645 | } 646 | } 647 | } 648 | 649 | /** 650 | * Add an event listener to a list of HTML elements 651 | * and returns a remove listener function. 652 | * 653 | * @param {NodeList|HTMLCollection} nodeList 654 | * @param {String} type 655 | * @param {Function} callback 656 | * @return {Object} 657 | */ 658 | function listenNodeList(nodeList, type, callback) { 659 | Array.prototype.forEach.call(nodeList, function(node) { 660 | node.addEventListener(type, callback); 661 | }); 662 | 663 | return { 664 | destroy: function() { 665 | Array.prototype.forEach.call(nodeList, function(node) { 666 | node.removeEventListener(type, callback); 667 | }); 668 | } 669 | } 670 | } 671 | 672 | /** 673 | * Add an event listener to a selector 674 | * and returns a remove listener function. 675 | * 676 | * @param {String} selector 677 | * @param {String} type 678 | * @param {Function} callback 679 | * @return {Object} 680 | */ 681 | function listenSelector(selector, type, callback) { 682 | return delegate(document.body, selector, type, callback); 683 | } 684 | 685 | module.exports = listen; 686 | 687 | 688 | /***/ }), 689 | 690 | /***/ 817: 691 | /***/ (function(module) { 692 | 693 | function select(element) { 694 | var selectedText; 695 | 696 | if (element.nodeName === 'SELECT') { 697 | element.focus(); 698 | 699 | selectedText = element.value; 700 | } 701 | else if (element.nodeName === 'INPUT' || element.nodeName === 'TEXTAREA') { 702 | var isReadOnly = element.hasAttribute('readonly'); 703 | 704 | if (!isReadOnly) { 705 | element.setAttribute('readonly', ''); 706 | } 707 | 708 | element.select(); 709 | element.setSelectionRange(0, element.value.length); 710 | 711 | if (!isReadOnly) { 712 | element.removeAttribute('readonly'); 713 | } 714 | 715 | selectedText = element.value; 716 | } 717 | else { 718 | if (element.hasAttribute('contenteditable')) { 719 | element.focus(); 720 | } 721 | 722 | var selection = window.getSelection(); 723 | var range = document.createRange(); 724 | 725 | range.selectNodeContents(element); 726 | selection.removeAllRanges(); 727 | selection.addRange(range); 728 | 729 | selectedText = selection.toString(); 730 | } 731 | 732 | return selectedText; 733 | } 734 | 735 | module.exports = select; 736 | 737 | 738 | /***/ }), 739 | 740 | /***/ 279: 741 | /***/ (function(module) { 742 | 743 | function E () { 744 | // Keep this empty so it's easier to inherit from 745 | // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3) 746 | } 747 | 748 | E.prototype = { 749 | on: function (name, callback, ctx) { 750 | var e = this.e || (this.e = {}); 751 | 752 | (e[name] || (e[name] = [])).push({ 753 | fn: callback, 754 | ctx: ctx 755 | }); 756 | 757 | return this; 758 | }, 759 | 760 | once: function (name, callback, ctx) { 761 | var self = this; 762 | function listener () { 763 | self.off(name, listener); 764 | callback.apply(ctx, arguments); 765 | }; 766 | 767 | listener._ = callback 768 | return this.on(name, listener, ctx); 769 | }, 770 | 771 | emit: function (name) { 772 | var data = [].slice.call(arguments, 1); 773 | var evtArr = ((this.e || (this.e = {}))[name] || []).slice(); 774 | var i = 0; 775 | var len = evtArr.length; 776 | 777 | for (i; i < len; i++) { 778 | evtArr[i].fn.apply(evtArr[i].ctx, data); 779 | } 780 | 781 | return this; 782 | }, 783 | 784 | off: function (name, callback) { 785 | var e = this.e || (this.e = {}); 786 | var evts = e[name]; 787 | var liveEvents = []; 788 | 789 | if (evts && callback) { 790 | for (var i = 0, len = evts.length; i < len; i++) { 791 | if (evts[i].fn !== callback && evts[i].fn._ !== callback) 792 | liveEvents.push(evts[i]); 793 | } 794 | } 795 | 796 | // Remove event from queue to prevent memory leak 797 | // Suggested by https://github.com/lazd 798 | // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910 799 | 800 | (liveEvents.length) 801 | ? e[name] = liveEvents 802 | : delete e[name]; 803 | 804 | return this; 805 | } 806 | }; 807 | 808 | module.exports = E; 809 | module.exports.TinyEmitter = E; 810 | 811 | 812 | /***/ }) 813 | 814 | /******/ }); 815 | /************************************************************************/ 816 | /******/ // The module cache 817 | /******/ var __webpack_module_cache__ = {}; 818 | /******/ 819 | /******/ // The require function 820 | /******/ function __webpack_require__(moduleId) { 821 | /******/ // Check if module is in cache 822 | /******/ if(__webpack_module_cache__[moduleId]) { 823 | /******/ return __webpack_module_cache__[moduleId].exports; 824 | /******/ } 825 | /******/ // Create a new module (and put it into the cache) 826 | /******/ var module = __webpack_module_cache__[moduleId] = { 827 | /******/ // no module.id needed 828 | /******/ // no module.loaded needed 829 | /******/ exports: {} 830 | /******/ }; 831 | /******/ 832 | /******/ // Execute the module function 833 | /******/ __webpack_modules__[moduleId](module, module.exports, __webpack_require__); 834 | /******/ 835 | /******/ // Return the exports of the module 836 | /******/ return module.exports; 837 | /******/ } 838 | /******/ 839 | /************************************************************************/ 840 | /******/ /* webpack/runtime/compat get default export */ 841 | /******/ !function() { 842 | /******/ // getDefaultExport function for compatibility with non-harmony modules 843 | /******/ __webpack_require__.n = function(module) { 844 | /******/ var getter = module && module.__esModule ? 845 | /******/ function() { return module['default']; } : 846 | /******/ function() { return module; }; 847 | /******/ __webpack_require__.d(getter, { a: getter }); 848 | /******/ return getter; 849 | /******/ }; 850 | /******/ }(); 851 | /******/ 852 | /******/ /* webpack/runtime/define property getters */ 853 | /******/ !function() { 854 | /******/ // define getter functions for harmony exports 855 | /******/ __webpack_require__.d = function(exports, definition) { 856 | /******/ for(var key in definition) { 857 | /******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) { 858 | /******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] }); 859 | /******/ } 860 | /******/ } 861 | /******/ }; 862 | /******/ }(); 863 | /******/ 864 | /******/ /* webpack/runtime/hasOwnProperty shorthand */ 865 | /******/ !function() { 866 | /******/ __webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); } 867 | /******/ }(); 868 | /******/ 869 | /************************************************************************/ 870 | /******/ // module exports must be returned from runtime so entry inlining is disabled 871 | /******/ // startup 872 | /******/ // Load entry module and return exports 873 | /******/ return __webpack_require__(686); 874 | /******/ })() 875 | .default; 876 | }); -------------------------------------------------------------------------------- /LICENSE.md: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | For Semantle: 2 | 3 | 4 | GNU GENERAL PUBLIC LICENSE 5 | Version 3, 29 June 2007 6 | 7 | Copyright (C) 2007 Free Software Foundation, Inc. 8 | Everyone is permitted to copy and distribute verbatim copies 9 | of this license document, but changing it is not allowed. 10 | 11 | Preamble 12 | 13 | The GNU General Public License is a free, copyleft license for 14 | software and other kinds of works. 15 | 16 | The licenses for most software and other practical works are designed 17 | to take away your freedom to share and change the works. By contrast, 18 | the GNU General Public License is intended to guarantee your freedom to 19 | share and change all versions of a program--to make sure it remains free 20 | software for all its users. We, the Free Software Foundation, use the 21 | GNU General Public License for most of our software; it applies also to 22 | any other work released this way by its authors. You can apply it to 23 | your programs, too. 24 | 25 | When we speak of free software, we are referring to freedom, not 26 | price. Our General Public Licenses are designed to make sure that you 27 | have the freedom to distribute copies of free software (and charge for 28 | them if you wish), that you receive source code or can get it if you 29 | want it, that you can change the software or use pieces of it in new 30 | free programs, and that you know you can do these things. 31 | 32 | To protect your rights, we need to prevent others from denying you 33 | these rights or asking you to surrender the rights. Therefore, you have 34 | certain responsibilities if you distribute copies of the software, or if 35 | you modify it: responsibilities to respect the freedom of others. 36 | 37 | For example, if you distribute copies of such a program, whether 38 | gratis or for a fee, you must pass on to the recipients the same 39 | freedoms that you received. You must make sure that they, too, receive 40 | or can get the source code. And you must show them these terms so they 41 | know their rights. 42 | 43 | Developers that use the GNU GPL protect your rights with two steps: 44 | (1) assert copyright on the software, and (2) offer you this License 45 | giving you legal permission to copy, distribute and/or modify it. 46 | 47 | For the developers' and authors' protection, the GPL clearly explains 48 | that there is no warranty for this free software. For both users' and 49 | authors' sake, the GPL requires that modified versions be marked as 50 | changed, so that their problems will not be attributed erroneously to 51 | authors of previous versions. 52 | 53 | Some devices are designed to deny users access to install or run 54 | modified versions of the software inside them, although the manufacturer 55 | can do so. This is fundamentally incompatible with the aim of 56 | protecting users' freedom to change the software. The systematic 57 | pattern of such abuse occurs in the area of products for individuals to 58 | use, which is precisely where it is most unacceptable. Therefore, we 59 | have designed this version of the GPL to prohibit the practice for those 60 | products. If such problems arise substantially in other domains, we 61 | stand ready to extend this provision to those domains in future versions 62 | of the GPL, as needed to protect the freedom of users. 63 | 64 | Finally, every program is threatened constantly by software patents. 65 | States should not allow patents to restrict development and use of 66 | software on general-purpose computers, but in those that do, we wish to 67 | avoid the special danger that patents applied to a free program could 68 | make it effectively proprietary. To prevent this, the GPL assures that 69 | patents cannot be used to render the program non-free. 70 | 71 | The precise terms and conditions for copying, distribution and 72 | modification follow. 73 | 74 | TERMS AND CONDITIONS 75 | 76 | 0. Definitions. 77 | 78 | "This License" refers to version 3 of the GNU General Public License. 79 | 80 | "Copyright" also means copyright-like laws that apply to other kinds of 81 | works, such as semiconductor masks. 82 | 83 | "The Program" refers to any copyrightable work licensed under this 84 | License. Each licensee is addressed as "you". "Licensees" and 85 | "recipients" may be individuals or organizations. 86 | 87 | To "modify" a work means to copy from or adapt all or part of the work 88 | in a fashion requiring copyright permission, other than the making of an 89 | exact copy. The resulting work is called a "modified version" of the 90 | earlier work or a work "based on" the earlier work. 91 | 92 | A "covered work" means either the unmodified Program or a work based 93 | on the Program. 94 | 95 | To "propagate" a work means to do anything with it that, without 96 | permission, would make you directly or secondarily liable for 97 | infringement under applicable copyright law, except executing it on a 98 | computer or modifying a private copy. Propagation includes copying, 99 | distribution (with or without modification), making available to the 100 | public, and in some countries other activities as well. 101 | 102 | To "convey" a work means any kind of propagation that enables other 103 | parties to make or receive copies. Mere interaction with a user through 104 | a computer network, with no transfer of a copy, is not conveying. 105 | 106 | An interactive user interface displays "Appropriate Legal Notices" 107 | to the extent that it includes a convenient and prominently visible 108 | feature that (1) displays an appropriate copyright notice, and (2) 109 | tells the user that there is no warranty for the work (except to the 110 | extent that warranties are provided), that licensees may convey the 111 | work under this License, and how to view a copy of this License. If 112 | the interface presents a list of user commands or options, such as a 113 | menu, a prominent item in the list meets this criterion. 114 | 115 | 1. Source Code. 116 | 117 | The "source code" for a work means the preferred form of the work 118 | for making modifications to it. "Object code" means any non-source 119 | form of a work. 120 | 121 | A "Standard Interface" means an interface that either is an official 122 | standard defined by a recognized standards body, or, in the case of 123 | interfaces specified for a particular programming language, one that 124 | is widely used among developers working in that language. 125 | 126 | The "System Libraries" of an executable work include anything, other 127 | than the work as a whole, that (a) is included in the normal form of 128 | packaging a Major Component, but which is not part of that Major 129 | Component, and (b) serves only to enable use of the work with that 130 | Major Component, or to implement a Standard Interface for which an 131 | implementation is available to the public in source code form. A 132 | "Major Component", in this context, means a major essential component 133 | (kernel, window system, and so on) of the specific operating system 134 | (if any) on which the executable work runs, or a compiler used to 135 | produce the work, or an object code interpreter used to run it. 136 | 137 | The "Corresponding Source" for a work in object code form means all 138 | the source code needed to generate, install, and (for an executable 139 | work) run the object code and to modify the work, including scripts to 140 | control those activities. However, it does not include the work's 141 | System Libraries, or general-purpose tools or generally available free 142 | programs which are used unmodified in performing those activities but 143 | which are not part of the work. For example, Corresponding Source 144 | includes interface definition files associated with source files for 145 | the work, and the source code for shared libraries and dynamically 146 | linked subprograms that the work is specifically designed to require, 147 | such as by intimate data communication or control flow between those 148 | subprograms and other parts of the work. 149 | 150 | The Corresponding Source need not include anything that users 151 | can regenerate automatically from other parts of the Corresponding 152 | Source. 153 | 154 | The Corresponding Source for a work in source code form is that 155 | same work. 156 | 157 | 2. Basic Permissions. 158 | 159 | All rights granted under this License are granted for the term of 160 | copyright on the Program, and are irrevocable provided the stated 161 | conditions are met. This License explicitly affirms your unlimited 162 | permission to run the unmodified Program. The output from running a 163 | covered work is covered by this License only if the output, given its 164 | content, constitutes a covered work. This License acknowledges your 165 | rights of fair use or other equivalent, as provided by copyright law. 166 | 167 | You may make, run and propagate covered works that you do not 168 | convey, without conditions so long as your license otherwise remains 169 | in force. You may convey covered works to others for the sole purpose 170 | of having them make modifications exclusively for you, or provide you 171 | with facilities for running those works, provided that you comply with 172 | the terms of this License in conveying all material for which you do 173 | not control copyright. Those thus making or running the covered works 174 | for you must do so exclusively on your behalf, under your direction 175 | and control, on terms that prohibit them from making any copies of 176 | your copyrighted material outside their relationship with you. 177 | 178 | Conveying under any other circumstances is permitted solely under 179 | the conditions stated below. Sublicensing is not allowed; section 10 180 | makes it unnecessary. 181 | 182 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 183 | 184 | No covered work shall be deemed part of an effective technological 185 | measure under any applicable law fulfilling obligations under article 186 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 187 | similar laws prohibiting or restricting circumvention of such 188 | measures. 189 | 190 | When you convey a covered work, you waive any legal power to forbid 191 | circumvention of technological measures to the extent such circumvention 192 | is effected by exercising rights under this License with respect to 193 | the covered work, and you disclaim any intention to limit operation or 194 | modification of the work as a means of enforcing, against the work's 195 | users, your or third parties' legal rights to forbid circumvention of 196 | technological measures. 197 | 198 | 4. Conveying Verbatim Copies. 199 | 200 | You may convey verbatim copies of the Program's source code as you 201 | receive it, in any medium, provided that you conspicuously and 202 | appropriately publish on each copy an appropriate copyright notice; 203 | keep intact all notices stating that this License and any 204 | non-permissive terms added in accord with section 7 apply to the code; 205 | keep intact all notices of the absence of any warranty; and give all 206 | recipients a copy of this License along with the Program. 207 | 208 | You may charge any price or no price for each copy that you convey, 209 | and you may offer support or warranty protection for a fee. 210 | 211 | 5. Conveying Modified Source Versions. 212 | 213 | You may convey a work based on the Program, or the modifications to 214 | produce it from the Program, in the form of source code under the 215 | terms of section 4, provided that you also meet all of these conditions: 216 | 217 | a) The work must carry prominent notices stating that you modified 218 | it, and giving a relevant date. 219 | 220 | b) The work must carry prominent notices stating that it is 221 | released under this License and any conditions added under section 222 | 7. This requirement modifies the requirement in section 4 to 223 | "keep intact all notices". 224 | 225 | c) You must license the entire work, as a whole, under this 226 | License to anyone who comes into possession of a copy. This 227 | License will therefore apply, along with any applicable section 7 228 | additional terms, to the whole of the work, and all its parts, 229 | regardless of how they are packaged. This License gives no 230 | permission to license the work in any other way, but it does not 231 | invalidate such permission if you have separately received it. 232 | 233 | d) If the work has interactive user interfaces, each must display 234 | Appropriate Legal Notices; however, if the Program has interactive 235 | interfaces that do not display Appropriate Legal Notices, your 236 | work need not make them do so. 237 | 238 | A compilation of a covered work with other separate and independent 239 | works, which are not by their nature extensions of the covered work, 240 | and which are not combined with it such as to form a larger program, 241 | in or on a volume of a storage or distribution medium, is called an 242 | "aggregate" if the compilation and its resulting copyright are not 243 | used to limit the access or legal rights of the compilation's users 244 | beyond what the individual works permit. Inclusion of a covered work 245 | in an aggregate does not cause this License to apply to the other 246 | parts of the aggregate. 247 | 248 | 6. Conveying Non-Source Forms. 249 | 250 | You may convey a covered work in object code form under the terms 251 | of sections 4 and 5, provided that you also convey the 252 | machine-readable Corresponding Source under the terms of this License, 253 | in one of these ways: 254 | 255 | a) Convey the object code in, or embodied in, a physical product 256 | (including a physical distribution medium), accompanied by the 257 | Corresponding Source fixed on a durable physical medium 258 | customarily used for software interchange. 259 | 260 | b) Convey the object code in, or embodied in, a physical product 261 | (including a physical distribution medium), accompanied by a 262 | written offer, valid for at least three years and valid for as 263 | long as you offer spare parts or customer support for that product 264 | model, to give anyone who possesses the object code either (1) a 265 | copy of the Corresponding Source for all the software in the 266 | product that is covered by this License, on a durable physical 267 | medium customarily used for software interchange, for a price no 268 | more than your reasonable cost of physically performing this 269 | conveying of source, or (2) access to copy the 270 | Corresponding Source from a network server at no charge. 271 | 272 | c) Convey individual copies of the object code with a copy of the 273 | written offer to provide the Corresponding Source. This 274 | alternative is allowed only occasionally and noncommercially, and 275 | only if you received the object code with such an offer, in accord 276 | with subsection 6b. 277 | 278 | d) Convey the object code by offering access from a designated 279 | place (gratis or for a charge), and offer equivalent access to the 280 | Corresponding Source in the same way through the same place at no 281 | further charge. You need not require recipients to copy the 282 | Corresponding Source along with the object code. If the place to 283 | copy the object code is a network server, the Corresponding Source 284 | may be on a different server (operated by you or a third party) 285 | that supports equivalent copying facilities, provided you maintain 286 | clear directions next to the object code saying where to find the 287 | Corresponding Source. Regardless of what server hosts the 288 | Corresponding Source, you remain obligated to ensure that it is 289 | available for as long as needed to satisfy these requirements. 290 | 291 | e) Convey the object code using peer-to-peer transmission, provided 292 | you inform other peers where the object code and Corresponding 293 | Source of the work are being offered to the general public at no 294 | charge under subsection 6d. 295 | 296 | A separable portion of the object code, whose source code is excluded 297 | from the Corresponding Source as a System Library, need not be 298 | included in conveying the object code work. 299 | 300 | A "User Product" is either (1) a "consumer product", which means any 301 | tangible personal property which is normally used for personal, family, 302 | or household purposes, or (2) anything designed or sold for incorporation 303 | into a dwelling. In determining whether a product is a consumer product, 304 | doubtful cases shall be resolved in favor of coverage. For a particular 305 | product received by a particular user, "normally used" refers to a 306 | typical or common use of that class of product, regardless of the status 307 | of the particular user or of the way in which the particular user 308 | actually uses, or expects or is expected to use, the product. A product 309 | is a consumer product regardless of whether the product has substantial 310 | commercial, industrial or non-consumer uses, unless such uses represent 311 | the only significant mode of use of the product. 312 | 313 | "Installation Information" for a User Product means any methods, 314 | procedures, authorization keys, or other information required to install 315 | and execute modified versions of a covered work in that User Product from 316 | a modified version of its Corresponding Source. The information must 317 | suffice to ensure that the continued functioning of the modified object 318 | code is in no case prevented or interfered with solely because 319 | modification has been made. 320 | 321 | If you convey an object code work under this section in, or with, or 322 | specifically for use in, a User Product, and the conveying occurs as 323 | part of a transaction in which the right of possession and use of the 324 | User Product is transferred to the recipient in perpetuity or for a 325 | fixed term (regardless of how the transaction is characterized), the 326 | Corresponding Source conveyed under this section must be accompanied 327 | by the Installation Information. But this requirement does not apply 328 | if neither you nor any third party retains the ability to install 329 | modified object code on the User Product (for example, the work has 330 | been installed in ROM). 331 | 332 | The requirement to provide Installation Information does not include a 333 | requirement to continue to provide support service, warranty, or updates 334 | for a work that has been modified or installed by the recipient, or for 335 | the User Product in which it has been modified or installed. Access to a 336 | network may be denied when the modification itself materially and 337 | adversely affects the operation of the network or violates the rules and 338 | protocols for communication across the network. 339 | 340 | Corresponding Source conveyed, and Installation Information provided, 341 | in accord with this section must be in a format that is publicly 342 | documented (and with an implementation available to the public in 343 | source code form), and must require no special password or key for 344 | unpacking, reading or copying. 345 | 346 | 7. Additional Terms. 347 | 348 | "Additional permissions" are terms that supplement the terms of this 349 | License by making exceptions from one or more of its conditions. 350 | Additional permissions that are applicable to the entire Program shall 351 | be treated as though they were included in this License, to the extent 352 | that they are valid under applicable law. If additional permissions 353 | apply only to part of the Program, that part may be used separately 354 | under those permissions, but the entire Program remains governed by 355 | this License without regard to the additional permissions. 356 | 357 | When you convey a copy of a covered work, you may at your option 358 | remove any additional permissions from that copy, or from any part of 359 | it. (Additional permissions may be written to require their own 360 | removal in certain cases when you modify the work.) You may place 361 | additional permissions on material, added by you to a covered work, 362 | for which you have or can give appropriate copyright permission. 363 | 364 | Notwithstanding any other provision of this License, for material you 365 | add to a covered work, you may (if authorized by the copyright holders of 366 | that material) supplement the terms of this License with terms: 367 | 368 | a) Disclaiming warranty or limiting liability differently from the 369 | terms of sections 15 and 16 of this License; or 370 | 371 | b) Requiring preservation of specified reasonable legal notices or 372 | author attributions in that material or in the Appropriate Legal 373 | Notices displayed by works containing it; or 374 | 375 | c) Prohibiting misrepresentation of the origin of that material, or 376 | requiring that modified versions of such material be marked in 377 | reasonable ways as different from the original version; or 378 | 379 | d) Limiting the use for publicity purposes of names of licensors or 380 | authors of the material; or 381 | 382 | e) Declining to grant rights under trademark law for use of some 383 | trade names, trademarks, or service marks; or 384 | 385 | f) Requiring indemnification of licensors and authors of that 386 | material by anyone who conveys the material (or modified versions of 387 | it) with contractual assumptions of liability to the recipient, for 388 | any liability that these contractual assumptions directly impose on 389 | those licensors and authors. 390 | 391 | All other non-permissive additional terms are considered "further 392 | restrictions" within the meaning of section 10. If the Program as you 393 | received it, or any part of it, contains a notice stating that it is 394 | governed by this License along with a term that is a further 395 | restriction, you may remove that term. If a license document contains 396 | a further restriction but permits relicensing or conveying under this 397 | License, you may add to a covered work material governed by the terms 398 | of that license document, provided that the further restriction does 399 | not survive such relicensing or conveying. 400 | 401 | If you add terms to a covered work in accord with this section, you 402 | must place, in the relevant source files, a statement of the 403 | additional terms that apply to those files, or a notice indicating 404 | where to find the applicable terms. 405 | 406 | Additional terms, permissive or non-permissive, may be stated in the 407 | form of a separately written license, or stated as exceptions; 408 | the above requirements apply either way. 409 | 410 | 8. Termination. 411 | 412 | You may not propagate or modify a covered work except as expressly 413 | provided under this License. Any attempt otherwise to propagate or 414 | modify it is void, and will automatically terminate your rights under 415 | this License (including any patent licenses granted under the third 416 | paragraph of section 11). 417 | 418 | However, if you cease all violation of this License, then your 419 | license from a particular copyright holder is reinstated (a) 420 | provisionally, unless and until the copyright holder explicitly and 421 | finally terminates your license, and (b) permanently, if the copyright 422 | holder fails to notify you of the violation by some reasonable means 423 | prior to 60 days after the cessation. 424 | 425 | Moreover, your license from a particular copyright holder is 426 | reinstated permanently if the copyright holder notifies you of the 427 | violation by some reasonable means, this is the first time you have 428 | received notice of violation of this License (for any work) from that 429 | copyright holder, and you cure the violation prior to 30 days after 430 | your receipt of the notice. 431 | 432 | Termination of your rights under this section does not terminate the 433 | licenses of parties who have received copies or rights from you under 434 | this License. If your rights have been terminated and not permanently 435 | reinstated, you do not qualify to receive new licenses for the same 436 | material under section 10. 437 | 438 | 9. Acceptance Not Required for Having Copies. 439 | 440 | You are not required to accept this License in order to receive or 441 | run a copy of the Program. Ancillary propagation of a covered work 442 | occurring solely as a consequence of using peer-to-peer transmission 443 | to receive a copy likewise does not require acceptance. However, 444 | nothing other than this License grants you permission to propagate or 445 | modify any covered work. These actions infringe copyright if you do 446 | not accept this License. Therefore, by modifying or propagating a 447 | covered work, you indicate your acceptance of this License to do so. 448 | 449 | 10. Automatic Licensing of Downstream Recipients. 450 | 451 | Each time you convey a covered work, the recipient automatically 452 | receives a license from the original licensors, to run, modify and 453 | propagate that work, subject to this License. You are not responsible 454 | for enforcing compliance by third parties with this License. 455 | 456 | An "entity transaction" is a transaction transferring control of an 457 | organization, or substantially all assets of one, or subdividing an 458 | organization, or merging organizations. If propagation of a covered 459 | work results from an entity transaction, each party to that 460 | transaction who receives a copy of the work also receives whatever 461 | licenses to the work the party's predecessor in interest had or could 462 | give under the previous paragraph, plus a right to possession of the 463 | Corresponding Source of the work from the predecessor in interest, if 464 | the predecessor has it or can get it with reasonable efforts. 465 | 466 | You may not impose any further restrictions on the exercise of the 467 | rights granted or affirmed under this License. For example, you may 468 | not impose a license fee, royalty, or other charge for exercise of 469 | rights granted under this License, and you may not initiate litigation 470 | (including a cross-claim or counterclaim in a lawsuit) alleging that 471 | any patent claim is infringed by making, using, selling, offering for 472 | sale, or importing the Program or any portion of it. 473 | 474 | 11. Patents. 475 | 476 | A "contributor" is a copyright holder who authorizes use under this 477 | License of the Program or a work on which the Program is based. The 478 | work thus licensed is called the contributor's "contributor version". 479 | 480 | A contributor's "essential patent claims" are all patent claims 481 | owned or controlled by the contributor, whether already acquired or 482 | hereafter acquired, that would be infringed by some manner, permitted 483 | by this License, of making, using, or selling its contributor version, 484 | but do not include claims that would be infringed only as a 485 | consequence of further modification of the contributor version. For 486 | purposes of this definition, "control" includes the right to grant 487 | patent sublicenses in a manner consistent with the requirements of 488 | this License. 489 | 490 | Each contributor grants you a non-exclusive, worldwide, royalty-free 491 | patent license under the contributor's essential patent claims, to 492 | make, use, sell, offer for sale, import and otherwise run, modify and 493 | propagate the contents of its contributor version. 494 | 495 | In the following three paragraphs, a "patent license" is any express 496 | agreement or commitment, however denominated, not to enforce a patent 497 | (such as an express permission to practice a patent or covenant not to 498 | sue for patent infringement). To "grant" such a patent license to a 499 | party means to make such an agreement or commitment not to enforce a 500 | patent against the party. 501 | 502 | If you convey a covered work, knowingly relying on a patent license, 503 | and the Corresponding Source of the work is not available for anyone 504 | to copy, free of charge and under the terms of this License, through a 505 | publicly available network server or other readily accessible means, 506 | then you must either (1) cause the Corresponding Source to be so 507 | available, or (2) arrange to deprive yourself of the benefit of the 508 | patent license for this particular work, or (3) arrange, in a manner 509 | consistent with the requirements of this License, to extend the patent 510 | license to downstream recipients. "Knowingly relying" means you have 511 | actual knowledge that, but for the patent license, your conveying the 512 | covered work in a country, or your recipient's use of the covered work 513 | in a country, would infringe one or more identifiable patents in that 514 | country that you have reason to believe are valid. 515 | 516 | If, pursuant to or in connection with a single transaction or 517 | arrangement, you convey, or propagate by procuring conveyance of, a 518 | covered work, and grant a patent license to some of the parties 519 | receiving the covered work authorizing them to use, propagate, modify 520 | or convey a specific copy of the covered work, then the patent license 521 | you grant is automatically extended to all recipients of the covered 522 | work and works based on it. 523 | 524 | A patent license is "discriminatory" if it does not include within 525 | the scope of its coverage, prohibits the exercise of, or is 526 | conditioned on the non-exercise of one or more of the rights that are 527 | specifically granted under this License. You may not convey a covered 528 | work if you are a party to an arrangement with a third party that is 529 | in the business of distributing software, under which you make payment 530 | to the third party based on the extent of your activity of conveying 531 | the work, and under which the third party grants, to any of the 532 | parties who would receive the covered work from you, a discriminatory 533 | patent license (a) in connection with copies of the covered work 534 | conveyed by you (or copies made from those copies), or (b) primarily 535 | for and in connection with specific products or compilations that 536 | contain the covered work, unless you entered into that arrangement, 537 | or that patent license was granted, prior to 28 March 2007. 538 | 539 | Nothing in this License shall be construed as excluding or limiting 540 | any implied license or other defenses to infringement that may 541 | otherwise be available to you under applicable patent law. 542 | 543 | 12. No Surrender of Others' Freedom. 544 | 545 | If conditions are imposed on you (whether by court order, agreement or 546 | otherwise) that contradict the conditions of this License, they do not 547 | excuse you from the conditions of this License. If you cannot convey a 548 | covered work so as to satisfy simultaneously your obligations under this 549 | License and any other pertinent obligations, then as a consequence you may 550 | not convey it at all. For example, if you agree to terms that obligate you 551 | to collect a royalty for further conveying from those to whom you convey 552 | the Program, the only way you could satisfy both those terms and this 553 | License would be to refrain entirely from conveying the Program. 554 | 555 | 13. Use with the GNU Affero General Public License. 556 | 557 | Notwithstanding any other provision of this License, you have 558 | permission to link or combine any covered work with a work licensed 559 | under version 3 of the GNU Affero General Public License into a single 560 | combined work, and to convey the resulting work. The terms of this 561 | License will continue to apply to the part which is the covered work, 562 | but the special requirements of the GNU Affero General Public License, 563 | section 13, concerning interaction through a network will apply to the 564 | combination as such. 565 | 566 | 14. Revised Versions of this License. 567 | 568 | The Free Software Foundation may publish revised and/or new versions of 569 | the GNU General Public License from time to time. Such new versions will 570 | be similar in spirit to the present version, but may differ in detail to 571 | address new problems or concerns. 572 | 573 | Each version is given a distinguishing version number. If the 574 | Program specifies that a certain numbered version of the GNU General 575 | Public License "or any later version" applies to it, you have the 576 | option of following the terms and conditions either of that numbered 577 | version or of any later version published by the Free Software 578 | Foundation. If the Program does not specify a version number of the 579 | GNU General Public License, you may choose any version ever published 580 | by the Free Software Foundation. 581 | 582 | If the Program specifies that a proxy can decide which future 583 | versions of the GNU General Public License can be used, that proxy's 584 | public statement of acceptance of a version permanently authorizes you 585 | to choose that version for the Program. 586 | 587 | Later license versions may give you additional or different 588 | permissions. However, no additional obligations are imposed on any 589 | author or copyright holder as a result of your choosing to follow a 590 | later version. 591 | 592 | 15. Disclaimer of Warranty. 593 | 594 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 595 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 596 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 597 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 598 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 599 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 600 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 601 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 602 | 603 | 16. Limitation of Liability. 604 | 605 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 606 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 607 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 608 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 609 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 610 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 611 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 612 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 613 | SUCH DAMAGES. 614 | 615 | 17. Interpretation of Sections 15 and 16. 616 | 617 | If the disclaimer of warranty and limitation of liability provided 618 | above cannot be given local legal effect according to their terms, 619 | reviewing courts shall apply local law that most closely approximates 620 | an absolute waiver of all civil liability in connection with the 621 | Program, unless a warranty or assumption of liability accompanies a 622 | copy of the Program in return for a fee. 623 | 624 | END OF TERMS AND CONDITIONS 625 | 626 | How to Apply These Terms to Your New Programs 627 | 628 | If you develop a new program, and you want it to be of the greatest 629 | possible use to the public, the best way to achieve this is to make it 630 | free software which everyone can redistribute and change under these terms. 631 | 632 | To do so, attach the following notices to the program. It is safest 633 | to attach them to the start of each source file to most effectively 634 | state the exclusion of warranty; and each file should have at least 635 | the "copyright" line and a pointer to where the full notice is found. 636 | 637 | 638 | Copyright (C) 639 | 640 | This program is free software: you can redistribute it and/or modify 641 | it under the terms of the GNU General Public License as published by 642 | the Free Software Foundation, either version 3 of the License, or 643 | (at your option) any later version. 644 | 645 | This program is distributed in the hope that it will be useful, 646 | but WITHOUT ANY WARRANTY; without even the implied warranty of 647 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 648 | GNU General Public License for more details. 649 | 650 | You should have received a copy of the GNU General Public License 651 | along with this program. If not, see . 652 | 653 | Also add information on how to contact you by electronic and paper mail. 654 | 655 | If the program does terminal interaction, make it output a short 656 | notice like this when it starts in an interactive mode: 657 | 658 | Copyright (C) 659 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 660 | This is free software, and you are welcome to redistribute it 661 | under certain conditions; type `show c' for details. 662 | 663 | The hypothetical commands `show w' and `show c' should show the appropriate 664 | parts of the General Public License. Of course, your program's commands 665 | might be different; for a GUI interface, you would use an "about box". 666 | 667 | You should also get your employer (if you work as a programmer) or school, 668 | if any, to sign a "copyright disclaimer" for the program, if necessary. 669 | For more information on this, and how to apply and follow the GNU GPL, see 670 | . 671 | 672 | The GNU General Public License does not permit incorporating your program 673 | into proprietary programs. If your program is a subroutine library, you 674 | may consider it more useful to permit linking proprietary applications with 675 | the library. If this is what you want to do, use the GNU Lesser General 676 | Public License instead of this License. But first, please read 677 | . 678 | MIT License 679 | 680 | ----------------------- 681 | For clipboard.js: 682 | 683 | Copyright (c) Zeno Rocha 684 | 685 | Permission is hereby granted, free of charge, to any person obtaining a copy 686 | of this software and associated documentation files (the "Software"), to deal 687 | in the Software without restriction, including without limitation the rights 688 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 689 | copies of the Software, and to permit persons to whom the Software is 690 | furnished to do so, subject to the following conditions: 691 | 692 | The above copyright notice and this permission notice shall be included in all 693 | copies or substantial portions of the Software. 694 | 695 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 696 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 697 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 698 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 699 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 700 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 701 | SOFTWARE. 702 | ----------------- 703 | For british_spellings.js: 704 | 705 | (The MIT License) 706 | 707 | Copyright (c) 2016 708 | 709 | Permission is hereby granted, free of charge, to any person obtaining 710 | a copy of this software and associated documentation files (the 711 | 'Software'), to deal in the Software without restriction, including 712 | without limitation the rights to use, copy, modify, merge, publish, 713 | distribute, sublicense, and/or sell copies of the Software, and to 714 | permit persons to whom the Software is furnished to do so, subject to 715 | the following conditions: 716 | 717 | The above copyright notice and this permission notice shall be 718 | included in all copies or substantial portions of the Software. 719 | 720 | THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, 721 | EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 722 | MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 723 | IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 724 | CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, 725 | TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE 726 | SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 727 | 728 | https://github.com/hyperreality/American-British-English-Translator 729 | ----------------- 730 | For SVG icons (heroicons): 731 | 732 | (The MIT License) 733 | 734 | Copyright (c) 2020 Refactoring UI Inc. 735 | 736 | Permission is hereby granted, free of charge, to any person obtaining a copy 737 | of this software and associated documentation files (the "Software"), to deal 738 | in the Software without restriction, including without limitation the rights 739 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 740 | copies of the Software, and to permit persons to whom the Software is 741 | furnished to do so, subject to the following conditions: 742 | 743 | The above copyright notice and this permission notice shall be included in all 744 | copies or substantial portions of the Software. 745 | 746 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 747 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 748 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 749 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 750 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 751 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 752 | SOFTWARE. 753 | 754 | https://github.com/tailwindlabs/heroicons 755 | --------------------------------------------------------------------------------