Difference between revisions of "Configuration:Create Dictionary"
Line 1: | Line 1: | ||
− | The computer checks the validity of placed words with every move (if not running in challenge mode) and asks for confirmation in case of unknown words. To avoid those queries and to let the computer participate in the game | + | The computer checks the validity of placed words with every move (if not running in challenge mode) and asks for confirmation in case of unknown words. To avoid those queries and to let the computer participate in the game a comprehensible dictionary is essential. |
− | The dictionary is just a simple text file with a formatting according the [[wikipedia:INI_file|ini file format], but with the ending <code>.dic</code>. The program is capable to read different | + | The dictionary is just a simple text file with a formatting according the [[wikipedia:INI_file|ini file format], but with the ending <code>.dic</code>. The program is capable to read different encodings but will always save in [[wikipedia:UTF-8|UTF-8 format]]. |
− | If a dictionary is | + | If a dictionary is saved by the program, which happens after any change, the content will be encrypted. The corresponding <code>[Key]</code> must not get changed. |
− | + | ||
== Configuration of the header and applying of categories == | == Configuration of the header and applying of categories == |
Latest revision as of 14:20, 17 June 2015
The computer checks the validity of placed words with every move (if not running in challenge mode) and asks for confirmation in case of unknown words. To avoid those queries and to let the computer participate in the game a comprehensible dictionary is essential.
The dictionary is just a simple text file with a formatting according the [[wikipedia:INI_file|ini file format], but with the ending .dic
. The program is capable to read different encodings but will always save in UTF-8 format.
If a dictionary is saved by the program, which happens after any change, the content will be encrypted. The corresponding [Key]
must not get changed.
Configuration of the header and applying of categories
General information are provided at the top, using the Words can be assigned to categories, whose names are listed in the section The section |
[Header] Author=John Doe Version=0.0.1 Licence=GPL Comment=Just a demo StandardCategory=Nouns [Categories] 1=Verb 2=Adjective [Words] AA AARDVARK=an African anteater ABDUCE=to abduct;1 ADDITIVELY=;2 |
In the example the word AA has no meaning and is assigned to the standard category "Nouns". The second word AARDVARK got a meaning but no special category again. And the next two words are assigned to the category 1 (Verb) and 2 (Adjective) with or without a description.
Handling of digraphs
Dictionary that contains of digraphs or trigraphs needs special treatment. For a proper use of those multi characters letters you have to configure the letter set accordingly. For example, the Spanish Scrabble rules show the digraphs CH, LL, and RR as single character on one tile. Since it's not possible to enter the character directly, the dictionary replaces them by 1, 2, and 3. That means entries in the section You can use any character for replacement. |
[Header] Version=100003 Author=MIO StandardCategory=Conforme al DRAE License=Creative Commons NC3 Release=2010-05-21 Comentario=Los dígrafos CH, LL y RR han sido reemplazados por 1, 2 y 3 respectivamente. [Replace] 1=CH 2=LL 3=RR [Categories] [Words] 2AMAR 1AMPU3A |
Integration of letter set
In case of a dictionary that does not have an inbuilt letter set or if you define a very specific dictionary like math, it could be useful to add the appropriate standard letter set to the dictionary. If a distribution is provided with the dictionary, the program will check the current configuration after loading the dictionary and applies it on confirmation. The parameter are specified at section |
[Header] ... Letters=⁼,0,1,2,3,4,5,6,7,8,9,−,×,÷,+,.,!,^,²,³,√,∜,∞,>,< Values=0,3,1,2,4,3,3,4,5,4,4,6,6,7,6,8,10,9,10,10,7,10,10,10,10 Counts=18,6,10,8,7,7,7,7,6,6,6,4,4,3,4,3,1,1,1,1,3,1,1,1,1 ... [Words] −1+26×4⁼103=;3 −1+4×26⁼103=;3 ... |
Language: |
Deutsch • English • Español • Français • Gaeilge • Gàidhlig • Italiano • Svenska |