We deal with text processing, pattern matching and syntax analysis every day, and new areas emerging. We can consider programming languages, communication protocols or a simple text as well-know examples. Therefore, we need new effective methods which fit into these areas. In this work, we explore the topics of parallel grammars, E0L-systems and multigenerative grammar systems. The goal is to improve the Cocke-Younger-Kasami algorithm and present a stronger algorithm of analysis
This thesis provides a summary of knowledge of grammar systems. The thesis proposes modifications of...
We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Gram...
Although Evolutionary Computation (EC) has been used with considerable success to evolve computer pr...
S analýzou řetězců, hledáním vzorů a kontrolou syntaktické správnosti se setkáváme každý den, ať jde...
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a l...
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorith...
Traditional parsing methods for general context-free grammars have been re-investigated in order to ...
[Abstract] Parsing CYK-like algorithms are inherently parallel: there are a lot of cells in the char...
We discuss four previously published parsing algorithms for parallell multiple context-free grammar ...
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
The goal of this bachelor thesis is to create and implement a parallel version of a Cocke-Younger-Ka...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
This topic of this thesis is parallel parsing using context-free grammars and attribute grammars. Th...
Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the...
Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the...
This thesis provides a summary of knowledge of grammar systems. The thesis proposes modifications of...
We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Gram...
Although Evolutionary Computation (EC) has been used with considerable success to evolve computer pr...
S analýzou řetězců, hledáním vzorů a kontrolou syntaktické správnosti se setkáváme každý den, ať jde...
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a l...
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorith...
Traditional parsing methods for general context-free grammars have been re-investigated in order to ...
[Abstract] Parsing CYK-like algorithms are inherently parallel: there are a lot of cells in the char...
We discuss four previously published parsing algorithms for parallell multiple context-free grammar ...
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
The goal of this bachelor thesis is to create and implement a parallel version of a Cocke-Younger-Ka...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
This topic of this thesis is parallel parsing using context-free grammars and attribute grammars. Th...
Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the...
Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the...
This thesis provides a summary of knowledge of grammar systems. The thesis proposes modifications of...
We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Gram...
Although Evolutionary Computation (EC) has been used with considerable success to evolve computer pr...