11 search results - page 1 / 3 » Subgraph Queries by Context-free Grammars |
119
click to vote
ICDT
2010
ACM
15 years 27 days 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
14 years 11 months ago
1996
ICGI
2010
Springer
14 years 6 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...
100
click to vote
ICGI
2000
Springer
15 years 1 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
14 years 10 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...