|
|
Parsing Based on Deep Pushdown Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis investigates deep pushdown automata and introduces their modification called controlled deep pushdown automata. Distributed deep pushdown automata systems and parallel communicating deep pushdown automata systems are described. Their accepting power and properties are investigated and several variants are introduced. This thesis proves that the accepting power of one such variant of parallel communicating deep pushdown automata systems is equal to the accepting power of Turing machines. A method for syntactical analysis based on the previously introduced automata systems is described.
|
|
|
Advanced Error Recovery during Bottom-Up Parsing
Regéciová, Dominika ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
This bachelor thesis deals with advanced methods for error recovery during bottom-up parsing. It describes and compares methods with the modified grammar FUN. It creates a web-based interface, Project Alan, where chosen methods are implemented for the simulation of error recovery process. The author also added her own method and she compared it with others.
|
|
|
Robust Parsing of Noisy Content
Daiber, Joachim ; Zeman, Daniel (advisor) ; Mareček, David (referee)
While parsing performance on in-domain text has developed steadily in recent years, out-of-domain text and grammatically noisy text remain an obstacle and often lead to significant decreases in parsing accuracy. In this thesis, we focus on the parsing of noisy content, such as user-generated content in services like Twitter. We investigate the question whether a preprocessing step based on machine translation techniques and unsupervised models for text-normalization can improve parsing performance on noisy data. Existing data sets are evaluated and a new data set for dependency parsing of grammatically noisy Twitter data is introduced. We show that text-normalization together with a combination of domain-specific and generic part-of-speech taggers can lead to a significant improvement in parsing accuracy. Powered by TCPDF (www.tcpdf.org)
|
|
|
Machine Understanding for Text Messages Used in Aviation
Lieskovský, Pavol ; Rajnoha, Martin (referee) ; Povoda, Lukáš (advisor)
This work deals with problems of NOTAM in text format, which is used in aeronautics. It documents the difference between text and digital format of NOTAM, special types of NOTAM messages and items from which the NOTAM consist of. It describes syntax and the functions of program, which was made within the frame of this thesis. The program is fully capable of correct parsing and processing of the NOTAM. The program can display each area of processed NOTAM messages in map and also provides detection of collision between these areas and flight plan
|
|
|
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
|
|
|
Parsing Based on Regulated Automata
Genčúrová, Ľubica ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This work deals with the design, applicability and the implementation of parsing methods based on pushdown automata that regulate the use of their rules by linear control languages. These automata are more powerful than ordinary automata and they are as powerful as Turing machine. The pushdown automata regulated by linear control languages characterize the family of recursively enumerable languages.
|
|
|
New Versions of Automata and Grammar Systems
Lichota, Lukáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This work deals with the modification of classical grammar systems with context-free base and defines new, modified linear grammar systems with linear grammar base. Also it deals with modification in automata systems, where each automaton is generative as strong as linear grammar, which is satisfied with the usage of one-turn push-down automata. This thesis also contains view on program realisation of theoretical models, which were described in theoretical part and introduces two programs for syntax analysis built based on it.
|
|
|
Parsing Based on Automata with Deep Pushdowns
Rusek, David ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This paper addresses the issue of design and implementation of syntactic analysis based on the context sensitive languages, respectively, grammars that contains constructs, which isn't possible to analyze with the help of the standard parsers based on the context free grammars. More specifically, this paper deals with the possibility of adding context sensitive support to the classic LL-analysis by replacing the standard pushdown automata (PDA) with deep pushdown automata (DP), which were introduced and published by prof. Alexander Meduna.
|
|
|
User tools to support automated functional testing of prototypes in product development
Grabovský, Štěpán ; Macháček, Jiří (referee) ; Svoboda, Radomír (advisor)
This work deals with develop of PC application to support automated testing of prototypes, which are developing in Honeywell International, Inc., ACS division in Brno. There was created a PC software witch executes testing process based on input script files. For select script files and specify other necessary information was designed a graphic user interface. Testing information are being presented in a program information control in real-time as the same as results of tests. The application also allow to users save the log file. The program has been realized in C# programing language.
|
|
| |
guest ::
