|
| |
|
|
Jumping Language Models
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.
|
|
| |
|
| |
|
|
Joining Segments in Czech Complex Sentences
Čech, Josef ; Kuboň, Vladislav (advisor) ; Krůza, Oldřich (referee)
Title: Joining segments in Czech sentences Author: Bc. Josef Čech Department: Institute of Formal and Applied Linguistics Supervisor: doc. RNDr. Vladislav Kuboň Ph.D. e-mail: vk@ufal.mff.cuni.cz Abstract: This thesis follows up segmentation of complex sentences to linguistic motivated objects - segments - and their mutual relations. These relations can be used for next work with segments. Main purpose for mapping relations is their joining into next level unit - clause. Theoretically should be possible to analyse each clause of complex sentence separately. Analysis of set of clauses should be quicker than of analysis whole complex sentence. Segments should be found thanks to linguistic separators and rule approach. Rule approach proves in problem relations between neighbouring segments. This thesis should attest that rule approach is best solution for joining segments into clauses. Position tag of segment was part of this thesis. This tag should be used in methods dealing with segments instead of custom segment. Keyword: segment, clause, tag, joining segments, syntactic analysis
|
|
|
Joining Segments in Czech Complex Sentences
Čech, Josef ; Kuboň, Vladislav (advisor) ; Krůza, Oldřich (referee)
Title: Joining segments in Czech sentences Author: Bc. Josef Čech Department: Institute of Formal and Applied Linguistics Supervisor: doc. RNDr. Vladislav Kuboň Ph.D. e-mail: vk@ufal.mff.cuni.cz Abstract: This thesis follows up segmentation of complex sentences to linguistic motivated objects - segments - and their mutual relations. These relations can be used for next work with segments. Main purpose for mapping relations is their joining into next level unit - clause. Theoretically should be possible to analyze each clause of complex sentence separately. Analysis of set of clauses should be quicker than of analysis whole complex sentence. Segments should be found thanks to linguistic separators and rule approach. Rule approach prove in problem relations between neighbouring segments. This thesis should attest that rule approach is best solution for joining segments into clauses. Position tag of segment was part of this thesis. This tag should be used in metods dealing with segments instead of custom segment. Keyword: segment, clause, tag, joinig segments, syntactic analysis
|
|
|
Parsing Based on Tree-Controled Grammars
Granát, Štěpán ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to design and implement the parser of grammars, whose derivation tree is limited by inspection of levels. Common parsing procedures are studied in detail and then it is discussed, how they could be extended by inspection of derivation tree. The most important part of the thesis is a draft of continuous inspection of the derivation tree simultaneously with its construction, which allows close cooperation between these two processes. This approach enables significant increasing of the parser power.
|
|
|
New Versions of Jumping Automata
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this thesis is introduction and investigation of extended version of jumping automata. These versions are specified by strictly size and direction of jump. This thesis examine their power and perform comparison with other automata types. Also there are shown equivalent grammar models. Main motivation for this thesis are research and effort to improve some features of general jumping finite automata. This work consider using this automata types for specific language families and syntactic analysis process.
|
|
|
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.
|
|
|
Detection and Error Recovery for Syntactic Analysis
Sák, Vladimír ; Dolíhal, Luděk (referee) ; Zámečníková, Eva (advisor)
Bachelor's thesis deals with error detection and recovery for syntactic analysis. The main goal of work was to design and implement a method for error detection and recovery. The proposed method is based on the Hartmann method for error detection and error recovery. The user interface, using cross-platform framework Qt was also implemented. As a result, the application prints all of the information about errors while parsing the source code.
|
guest ::
