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 15 of 15 for “"context-free grammar"”.
-
Recognition of mathematics using a two-dimensional trainable context-free grammar
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Extraction of Basic Noun Phrases from Natural Language Using Statistical Context-Free Grammar
… from natural language texts using two different grammars: stochastic context-free grammar (SCFG) and non-statistical context free grammar (CFG). Precision and recall were calculated to determine how many precise and correct noun phrases were extracted using these two grammars. Several text files …
-
Approximation algorithms for grammar-based data compression
This thesis considers the smallest grammar problem: find the smallest context-free grammar that generates exactly one given string. We show that this problem is intractable, and so our objective is to find approximation algorithms. This simple question is connected to many areas of research. Most …
-
Dinatural transformations and polymorphic operators
… notions of canonical dinatural transformation, context-free grammar, initial algebra, and polymorphic operator are elaborated. The theorem that the dinatural transformations between certain functors in the category of partial equivalence relations are exactly the canonical dinaturals is proved. …
-
Language acquisition by computer: Learning categories, agreement and morphology under psychological constraints
… manner, learning parts of categories first, then context-free grammar rules based on these categories, and finally agreemnt rules on top of the context-free grammar rules. CAM duplicates the partial order relations observed by R. Brown (Brown, 1973) in children for the progressive, the plural, the …
-
Linguistically-motivated sub-word modeling with applications to speech recognition
… model. The linguistic model is designed using a context-free grammar which describes the sub-syllabic structure of English words, and encapsulates phonotactic and phonological constraints. The context-free grammar is supported by a probability model, which captures the statistics of the parses …
-
Using Two-Level Grammars to Describe the Syntax of English.
Two-level grammars (2LGs) have traditionally been used to define the syntax and semantics of programming languages. However, this paper will show that 2LGs can also be used to describe the syntax of English sentences, as well as to perform context checks to ensure that an English sentence is …
-
Sequentialized Language Models
… a new compression framework employing a static context-free grammar and an adaptive finite-context statistical model. These compressors are adaptive, general compressors that operate in linear time and bounded space. We show these compressors can deliver substantial reductions in both …
-
Sistema Evolutivo Bio-inspirado en el Comportamiento Bacteriano
… automatically generate intelligent systems. The grammar-guided evolutionary automatic system (GGEAS) is an evolutionary framework with a modular design that is capable of adapting grammar-guided genetic programming techniques for use in the construction of intelligent systems for different …
-
Improving the Eco-system of Passwords
… Markov models outperform Probabilistic Context Free Grammar models. Secondly, we improve password policies and practice used by websites by studying how to best check weak passwords. We model different password strength checking methods as Password Ranking Algorithms (PRAs), and …
-
Specification and verification of context conditions for programming languages
Context conditions - also called static semantics - are the constraints on computer programs that cannot be reasonably expressed by a context-free grammar, but that can be statically checked without considering the execution properties - semantics - of the program. Such conditions tend to be …
-
Model selection in compositional spaces
… compositional structure can be represented by a context-free grammar whose production rules correspond to these motifs. By exploiting the structure of this grammar, we can generically and eciently infer latent components and estimate predictive likelihood for nearly 2500 model structures using a …
-
Visual language representation for use case evolution and traceability
… of existing efficient parsing algorithms for context-free grammars. As an application of the RE/TRAC representation, this research depicts the hierarchical step-wise refinement of UML use case diagrams to demonstrate evolving system requirements. In the current arena of software development, …
-
Information theory of random trees induced by stochastic grammars.
… an α-random tree having n leaves, and there is a context-free grammar describing how each Tn is randomly generated. In particular, balanced α-random tree models are examined, meaning that the context-free grammars which are employed satisfy a type of balance condition. We obtain three types of …
-
Interaktivní generátor syntaxe heterogenních datových struktur
V dnešní době jsou softwarové systémy často skládány z několika komponent předávající si data různými komunikačními kanály. I přes to, že existuje řada standardizovaných formátů kódování dat, vývojáři stále vytváří své vlastní většinou s ohledem na specifické použití jimi vytvářeného softwaru. …