11 search results - page 1 / 3 » Subgraph Queries by Context-free Grammars |
ICDT
2010
ACM
13 years 8 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
AAAI
1996
13 years 6 months ago
1996
ICGI
2010
Springer
13 years 2 months ago
2010
Springer
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...
ICGI
2000
Springer
13 years 9 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
2010
Springer
13 years 6 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...