Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"formal grammars"”.
-
The Use of Formal Grammars in Automatic Speech Recognition
… speech. This thesis presents the application of formal grammars to model a FE in an IWR system. The method is to construct, in the training mode, one grammar for each word in the vocabulary, directly from a set of sample strings of 'features' represented by symbols. In the recognition mode, an …
-
Computer assisted application of stochastic structuring techniques in musical composition and control of digital sound synthesis systems
… of recent advances in the development of certain formal grammars for the description of musical structures. Methods of general application of the techniques are suggested, and in particular, in the light of the development of alternative methods of non-standard synthesis, the use of stochastic web …
-
A Novel Process Model-driven Approach to Comparing Educational Courses using Ontology Alignment
… chosen as the data model due to its ability to formally specify semantics, to represent taxonomies and to make inferences regarding data. The formal grammars of a keyword and a learning outcome were created to enable the semi-automated population of the ontology from the module templates. The …
-
Procedurally generating surface detail for 3D models using voxel-based cellular automata
… detail CA. The grammar we develop is similar to formal grammars used in procedural generation, such as L-systems and shape grammars. Our system is composed of three main sections: a model converter, grammar and CA executor. The model converter changes polygon-mesh models to and from a voxel-based …
-
Weighted Logics and Weighted Simple Automata for Context-Free Languages of Infinite Words
… Greibach normal forms of ω-context-free grammars as well as a new type of Büchi pushdown automata, the simple pushdown automata. Simple pushdown automata do not use e-transitions and can change the stack only by at most one symbol. We show that simple pushdown automata of infinite words …
-
Rozšíření Blenderu pro generování tradičního korejského nábytku
Cílem této práce je vytvořit rozšíření pro platformu Blender, umožňující procedurální generování tradičního korejského nábytku. Práce se snaží zlepšit nedostatek volně dostupných řešení. Model nábytku je implementován jakožto Geometry Node modifikátor. Nábytek má více variací pro jeho jednotlivé …