Results 1 to 10 of about 64,378 (120)
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence and itemset mining. The proposed system offers data miners the possibility to specify and explore pattern domains declaratively, in a way which is very similar to the ...
Nijssen, Siegfried, De Raedt, Luc
openaire +2 more sources
<p>Graphics are graphs with attributes at their vertices. Graphic grammars are natural extensions of graph and attribute grammars with rules that are attributed extensions of the ''pushout'' productions of graph grammars. The theory of graphic grammars is presented and various programming implementations will be discussed.
Lilia Hess, Brian H. Mayoh
openaire +2 more sources
Synchronization of Grammars [PDF]
Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata.
Caucal, Didier, Hassen, Stéphane
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Universal Grammar is a universal grammar
Language is the most distinctive feature of humans, but there is no consensus on what is characteristic of language. From the point of view of computing, we argue that ‘the human brain circuitry that implements language is Turing complete’. This thesis makes evolutionary sense and natural languages are expressive enough, but two issues against it ...
openaire +2 more sources
Grammar and context in Functional Discourse Grammar [PDF]
This article presents a proposal for the organization of the Contextual Component in Functional Discourse Grammar. A guiding principle in this proposal is that, given the fact that Functional Discourse Grammar is a theory of grammar, the Contextual Component should provide the information that is necessary for a proper functioning of the grammar rather
Kees Hengeveld, J. Lachlan Mackenzie
openaire +4 more sources
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena.
openaire +3 more sources
Lexical Functional Grammar as a Construction Grammar
Lexical Functional Grammar (LFG) is a lexicalist, constraint-based grammatical theory that shares a lot of the basic assumptions of Construction Grammar (CxG), such as a commitment to surface-oriented descriptions (no transformations), and the simultaneous representation of form, meaning, and other grammatical information (no derivations). Nevertheless,
openaire +3 more sources
Position-restricted grammar forms and grammars
AbstractThis paper deals with the question of canonical types for grammar forms and grammars. A grammar (form) is called position restricted of type (m1,…,mn+ 1) if n⩾2, each m1 is a nonnegative integer, and each production is either of the type ξ0 → u, u a terminal word, or ξ0→w1ξ1w2⋯wnξnwn+1, where each ξ is a variable and each wi is a terminal word ...
Meera Blattner, Seymour Ginsburg
openaire +2 more sources
A new type of grammar for generating formal languages, called a conditional grammar is presented. A conditional grammar generates the language in a deterministic way and its operation resembles that of a program. Classes of languages generated by some subclasses of conditional grammars are investigated and related to known classes of languages.
openaire +2 more sources

