ICGI
2000
Springer
14 years 3 months ago
2000
Springer
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...
ICGI
2000
Springer
14 years 3 months ago
2000
Springer
Let BC be the model of behaviourally correct function learning as introduced by B
ICGI
2000
Springer
14 years 3 months ago
2000
Springer
ICGI
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
ICGI
2000
Springer
14 years 3 months ago
2000
Springer
