| |
Textual Information Systems (36TIS)
course in Czech language
full-time study course, currently not teaching
Number of teaching periods (lectures + seminars): 2+2
Termination: Credit, examination
Summary:
| |
Classification of textual information systems, string searching methods, KMP algorithm, AC algorithm, finite automata (FA), BM and CW algorithms, two-way jumping automata, approximate string searching, index methods, text analysis, thesaurus, signature methods, data compression-models and coding, statistical methods, dictionary methods, spell-checkers, hypertext.
|
Course Syllabus:
| |
- Basic notions and a classification of information systems
- Pattern matching, models of pattern matching algorithms
- Simulation of non-deterministic FA, dynamic programming and bit-wise parallelism
- Pattern matching engines, KMP and AC algorithms
- Backward string matching, BM and CW algorithms
- Two-way finite automata with jump
- Factor automata
- Indexing, text analysis, thesaurus
- Signature methods
- Data compression, modeling and coding
- Statistical methods of data compression
- Dictionary methods of data compression
- Syntactical methods of data compression
- Spell-checking
|
Seminar syllabus:
| |
- LaTeX, basic notions
- LaTeX, mathematical typesetting
- LaTeX, graphics
- Finite automata for string matching
- Finite automata for sequence matching
- Simulation of finite automata, dynamic programming
- Simulation of finite automata, bit-wise parallelism
- Boyer-Moore algorithm and its variants
- Two-way automata with jump
- Fulltext system with indexing
- Data compression, statistical methods
- Data compression, dictionary methods
- Models of data for data compression
|
|
 
|
