National Repository of Grey Literature 4 records found  Search took 0.01 seconds. 
Approximate String Matching in Preprocessed Documents
Toth, Róbert ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the problem of approximate string matching, also called string matching allowing errors. The thesis targets the area of offline algorithms, which allows very fast pattern matching thanks to index created during initial text preprocessing phase. Initially, we will define the problem itself and demonstrate variety of its applications, followed by short survey of different approaches to cope with this problem. Several existing algorithms based on suffix trees will be explained in detail and new hybrid algorithm will be proposed. Algorithms wil be implemented in C programming language and thoroughly compared in series of experiments with focus on newly presented algorithm.
Aproximate String Matching
Toth, Róbert ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the problem of approximate string matching, ie. string matching allowing errors. Initially, we will define the problem itself and demonstrate variety of it's applications, followed by short survey of different approaches to cope with this problem. The remaining part of the work is focused on algorithms based on the use of deterministic finite automatons. Main algorithms in this area will be presented. Those will be implemented in Python programming language and thoroughly compared in series of experiments.
Aproximate String Matching
Toth, Róbert ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the problem of approximate string matching, ie. string matching allowing errors. Initially, we will define the problem itself and demonstrate variety of it's applications, followed by short survey of different approaches to cope with this problem. The remaining part of the work is focused on algorithms based on the use of deterministic finite automatons. Main algorithms in this area will be presented. Those will be implemented in Python programming language and thoroughly compared in series of experiments.
Approximate String Matching in Preprocessed Documents
Toth, Róbert ; Košař, Vlastimil (referee) ; Kaštil, Jan (advisor)
This thesis deals with the problem of approximate string matching, also called string matching allowing errors. The thesis targets the area of offline algorithms, which allows very fast pattern matching thanks to index created during initial text preprocessing phase. Initially, we will define the problem itself and demonstrate variety of its applications, followed by short survey of different approaches to cope with this problem. Several existing algorithms based on suffix trees will be explained in detail and new hybrid algorithm will be proposed. Algorithms wil be implemented in C programming language and thoroughly compared in series of experiments with focus on newly presented algorithm.

See also: similar author names
1 Tóth, Radovan
2 Tóth, Richard
1 Tóth, Roland
Interested in being notified about new results for this query?
Subscribe to the RSS feed.