Results 11 to 20 of about 557 (235)
m-Linear Context-Free Rewriting Systems as Abstract Categorial Grammars [PDF]
, 2003 This paper presents a coding of m-linear context-free rewriting systems (m-LCFRS) into abstract categorial grammars (ACG). Thus, it shows the latter formalism, which offers a powerful grammatical framework based on a small set of computational primitives, is able to reach some interesting classes of languages w.r.t. natural language modeling.
de Groote, Philippe, Pogodalla, Sylvain
openaire +3 more sources
A Demonstration of the Grrr Graph Rewriting Programming Language [PDF]
, 2000 This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described.
Rodgers, Peter, Vidal, Natalia
core +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Empirical Risk Minimization for Probabilistic Grammars: Sample Complexity and Hardness of Learning [PDF]
, 2012 Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. They are used ubiquitously in computational linguistics.
Noah A. Smith +3 more
core +1 more source
A Graph Rewriting Visual Language for Database Programming [PDF]
, 1997 Textual database programming languages are computationally complete, but have the disadvantage of giving the user a non-intuitive view of the database information that is being manipulated.
Rodgers, Peter +3 more
core +1 more source
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
A declarative characterization of different types of multicomponent tree adjoining grammars [PDF]
, 2009 Multicomponent Tree Adjoining Grammars (MCTAGs) are a formalism that has been shown to be useful for many natural language applications. The definition of non-local MCTAG however is problematic since it refers to the process of the derivation itself: a ...
Kallmeyer, Laura
core +1 more source
An earley parsing algorithm for range concatenation grammars [PDF]
, 2009 We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to ...
Yannick Parmentier +5 more
core +1 more source
Grammars and cellular automata for evolving neural networks architectures [PDF]
, 2000 IEEE International Conference on Systems, Man, and Cybernetics. Nashville, TN, 8-11 October 2000The class of feedforward neural networks trained with back-propagation admits a large variety of specific architectures applicable to approximation pattern ...
Molina López, José Manuel +3 more
core +1 more source
Ten virtues of structured graphs [PDF]
, 2009 This paper extends the invited talk by the first author about the virtues of structured graphs. The motivation behind the talk and this paper relies on our experience on the development of ADR, a formal approach for the design of styleconformant ...
Lluch-Lafuente, Alberto +3 more
core +2 more sources