28 research outputs found
A fuzzy frame-based knowledge representation formalism
This paper describes a formalism for representing imprecise knowledge which combines traditional frame-based formalisms with fuzzy logic and fuzzy IF-THEN rules. Inference in this formalism is based on unification and the calculus of fuzzy IF-THEN rules, and lends itself to an efficient implementation
From functional specification to syntactic structures: systemic grammar and tree adjoining grammar
A Graphical Model for Context-Free Grammar ParsingCompiler Construction
In the compiler literature, parsing algorithms for context-free grammars are presented using string rewriting systems or abstract machines such as pushdown automata. Unfortunately, the resulting descriptions can be baroque, and even a basic understanding of some parsing algorithms, such as Earley\u2019s algorithm for general context-free grammars, can be elusive. In this paper, we present a graphical representation of context-free grammars called the Grammar Flow Graph (GFG) that permits parsing problems to be phrased as path problems in graphs; intuitively, the GFG plays the same role for context-free grammars that nondeterministic finite-state automata play for regular grammars. We show that the GFG permits an elementary treatment of Earley\u2019s algorithm that is much easier to understand than previous descriptions of this algorithm. In addition, look-ahead computation can be expressed as a simple inter-procedural dataflow analysis problem, providing an unexpected link between front-end and back-end technologies in compilers. These results suggest that the GFG can be a new foundation for the study of context-free grammars
Languages as hyperplanes: grammatical inference with string kernels
Using string kernels, languages can be represented as hyperplanes in a high dimensional feature space. We present a new family of grammatical inference algorithms based on this idea. We demonstrate that some mildly context sensitive languages can be represented in this way and it is possible to efficiently learn these using kernel PCA. We present some experiments demonstrating the effectiveness of this approach on some standard examples of context sensitive languages using small synthetic data sets