Sciweavers

182 search results - page 3 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
FLAIRS
2003
13 years 9 months ago
MDL-Based Context-Free Graph Grammar Induction
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
CPP
2011
107views more  CPP 2011»
12 years 7 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
ICGI
2010
Springer
13 years 5 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
LACL
2005
Springer
14 years 1 months ago
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
Peter Ljunglöf
MLMTA
2007
13 years 9 months ago
GenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
- While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to...
Faizan Javed, Marjan Mernik, Barrett R. Bryant, Al...