Sciweavers

35 search results - page 1 / 7
» Constructive Learning of Context-Free Languages with a Subpa...
Sort
View
ICGI
2000
Springer
13 years 7 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...
CALCO
2005
Springer
126views Mathematics» more  CALCO 2005»
13 years 9 months ago
Context-Free Languages via Coalgebraic Trace Semantics
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
Ichiro Hasuo, Bart Jacobs
ECML
2003
Springer
13 years 8 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer
CPP
2011
107views more  CPP 2011»
12 years 3 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
MLMTA
2007
13 years 5 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...