Abstract
An algorithm is presented for obtaining a representation of patterns in strings of symbols. The patterns are represented by equations among bit values in a binary encoding of the symbols. An application is described where the symbols are English letters and the strings are words. The patterns enable the solution of cryptograms, and the construction of crossword puzzles.
Original language | English |
---|---|
Pages (from-to) | 119-128 |
Number of pages | 10 |
Journal | Pattern Recognition Letters |
Volume | 5 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1987 |
Keywords
- puzzle solving
- Relational patterns