source: trunk/CrypPlugins/WordPatterns/WordPatternsDescription.xaml @ 1378

Last change on this file since 1378 was 962, checked in by Matthäus Wander, 12 years ago


  • does not show a warning anymore when a missing property in save file is marked with the DontSave attribute


  • changed AssemblyCompany to "CrypTool2" as this string is being used to determine AppData directory (where the user.config file is located)
  • added support for arbitrary enums as TaskPane settings (see WordPatterns how to use them)


  • fixed some bugs in Dictionary file handling


  • added XAML description
  • added case sensitivity setting (enum!)
  • minor sample fix

Note: New binaries are not included as I have some more unfinished core changes on my machine.

File size: 2.7 KB
1<FlowDocument PagePadding="5,0,5,0" AllowDrop="True" NumberSubstitution.CultureSource="User" xmlns="">
2    <Paragraph>
3        <Run FontSize="28" xml:lang="de-de">WordPatterns</Run>
4    </Paragraph>
5    <Paragraph>
6        <Run xml:lang="de-de" xml:space="preserve">The WordPatterns plugin searches for words which share the same character pattern. A </Run><Run FontWeight="Bold" xml:lang="de-de" xml:space="preserve">pattern </Run><Run xml:lang="de-de">is a sequence of numbers; each character of the word maps to a consecutive number, while same characters map to the same number. The resulting number sequence represents the character repetitions and equalities of a word, preserving the positions of the repetitions. The pattern does not represent the word content. The character values are lost and thus the word can not be retrieved solely by its pattern.</Run>
7    </Paragraph>
8    <Paragraph>
9        <Run FontSize="20" xml:lang="de-de">Example</Run>
10    </Paragraph>
11    <Paragraph>
12        <Run xml:lang="de-de">For example the word ANNA has a length of four characters and consists of two different characters (A and N). Therefore the corresponding sequence has a length of four numbers, while two consecutive numbers are being used, namely 1 and 2. A is found first in the word and maps to 1. N is the next different character and maps to 2. Therefore the resulting pattern is 1-2-2-1.</Run>
13    </Paragraph>
14    <Paragraph>
15        <Run xml:lang="de-de">Different words may have the same word pattern. As another example the word NOON also results in the pattern 1-2-2-1.</Run>
16    </Paragraph>
17    <Paragraph>
18        <Run FontSize="20" xml:lang="de-de">Area of Application</Run>
19    </Paragraph>
20    <Paragraph>
21        <Run xml:lang="de-de">The word pattern search aids in the cryptanalysis of monoalphabetical substitution ciphers. For this purpose a dictionary is required, from which the pattern of each word is precomputed once. Then, the pattern of a given ciphertext word can be used to search for possible plaintext candidates from the chosen dictionary.</Run>
22    </Paragraph>
23    <Paragraph>
24        <Run FontSize="20" xml:lang="de-de">Usage</Run>
25    </Paragraph>
26    <Paragraph>
27        <Run xml:lang="de-de">Enter the input word, whose pattern is used to retrieve matching words from the dictionary, as string (for example TextInput plugin). Enter the list of words to be searched for as string array (for example Dictionary plugin). Depending on the size of the dictionary the precomputation may take some seconds. The output is a list of matching words as single string, separated by newline.</Run>
28    </Paragraph>
Note: See TracBrowser for help on using the repository browser.