|
|
Regular Expression Based Searching in Text Files
Šimek, Ota ; Samek, Jan (referee) ; Rozman, Jaroslav (advisor)
This paper desribes the design, analysis and implementation of the program, whichis used to search for specific parts of text in text and xml files. To search, you must create a template using two text-matching technigues. These are the regular expressions and XPath expressions. This is desribed in the first chapter. Application allows to process large number of files or files with a high content.
|
|
|
Conversion of Models of Regular Languages
Navrkal, David ; Kučera, Jiří (referee) ; Křivka, Zbyněk (advisor)
p { margin-bottom: 0.08in; direction: ltr; color: rgb(0, 0, 0); line-height: 150%; widows: 2; orphans: 2; }p.western { font-family: "Times New Roman",serif; font-size: 11pt; }p.cjk { font-family: "Times New Roman",serif; font-size: 11pt; }p.ctl { font-family: "Times New Roman",serif; font-size: 12pt; } My thesis deals with how to didactically demonstrate models of regular languages focusing on their mutual conversions. These conversions are transformation of regular expressions to finite automata (FA), remove epsilon rules from FA and determinization FA. The goal was implement demonstration of these transformations in an application. In this thesis I document development of this application. This application was programmed in language C++ using graphic library Qt 5. The application was developed in an operating system (OS) Linux and tested in OS Microsoft Windows 7. All these conversions are implemented. The application is user-friendly, intuitive and functional. The application was not tested on a wider sample of students. As the main benefit, the application can help students of formal languages and finite automata better understand this theory using didactical examples. Source codes of this project (regularConvertor) are available online on Github server.
|
|
|
Dictionary Up-Translation System
Schovajsa, Michal ; Kouřil, Jan (referee) ; Smrž, Pavel (advisor)
The thesis concerns with the processing of dictionaries in electronic form, converting them into an unified form, and the problems arising in the process in particular. The subject of the work is to create a system for the elimination of some of these problems in order to facilitate machine processing of dictionaries. At first, different issues of dictionaries transferred into an unified form are concerned. Then, the thesis deals with the solution of these issues and the creation of tools for this purpose. Finally, the results and the efficiency of the instruments created are evaluated.
|
|
|
Context-Dependent Scanner
Hatina, Peter ; Koutný, Jiří (referee) ; Čermák, Martin (advisor)
This paper is devoted to principles of a lexical analysis and to a means of context resolution of a lexeme type, depending on its source code position. The lexical analysis, process of a lexical analyzer creation and possible solution for context lexeme recognition, based on a multiple automata system, is described. Lexical analyzer functionality is extended to accept tokens in other languages code blocks.
|
|
|
Parallel Lexical Analyzer
Ježek, Lukáš ; Koutný, Jiří (referee) ; Čermák, Martin (advisor)
This bachelor thesis deals with generating a lexical analyzer which analyzes a file in parallel, i.e. by several threads at a time. The analyzer is generated on the basis of regular language and is represented by finite automaton with the necessary functions. The emphasis is placed on the parallel processing. The possibility of forward and back threads processing is discussed in this thesis. The method of the forward threads was decided to be used for implementation. The problems during implementation that lead to almost none of the desired speed-up of the analysis are discussed.
|
|
|
Construction of the Generalized Finite Automaton
Šoka, Martin ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
The thesis deals with the creation of an algorithm for the construction of the generalized finite automaton. This automaton differs from the conventional finite automaton by the fact that its transitions are defined by words, therefore it is possible to reduce the number of states of the generalized finite automaton. The introduction includes definitions of terms used later in the thesis. In the next chapters I describe the algorithm itself, including the comprehensive analysis of the heuristics for finding a maximal acyclic subgraph in the graph of the automaton. It also describes implementation of the algorithm and experimentation with automatons created by the algorithm.
|
|
|
Filtering of Texts Extracted from PDF, OCR or Web
Žigárdi, Tomáš ; Plchot, Oldřich (referee) ; Szőke, Igor (advisor)
This bachelor thesis describes normalization of texts created by conversion of other formats and creation of pronunciation dictionaries. They are important in speech processing process. Mistakes caused by conversion and original solution of this problem are analyzed. Design and implementation of normalization steps and pronunciation dictionaries is shown. Results are compared with results of original solution of this problem.
|
|
|
Language Version Tools for Web Portal of BUT
Pavlíček, Milan ; Burget, Radek (referee) ; Marušinec, Jaromír (advisor)
The main purpose of this master's thesis is to create language version tools for web Portal of BUT. There are possibilities of applications using databases or without them. The next part of the thesis analyses current situation of the web Portal of BUT. I described individually servers, tools and mainly solution ensuring multilingual sites. Thereinafter I attend to design and implementation of required system. This system consists of some single scripts and web applications for web developers and translators. Finally I will describe the procedure of integration of this system to current web Portal of BUT.
|
|
|
NNTP Server as a Windows Network Service
Loupanec, Josef ; Ráb, Jaroslav (referee) ; Očenášek, Pavel (advisor)
This work includes specification and analysis of requirements, design and implementation of the internet news server. The server controls newsgroups and associated news. It provides availability of the articles by NNTP protocol and HTTP protocol (by web interface). The server supports a user authentication and an optional proxy mode, when all NNTP requests are resent to another remote NNTP server. A mechanism that provides news-downloading from remote NNTP servers and performs distribution function is included too. The application is designed to run on MS Windows NT (and higher version) as a NT service. The server is configurable by a graphic user interface. The work also includes theoretical information needed for successful accomplishment of the above-mentioned requirements.
|
|
| |
guest ::
