Searching for "Context-Free Grammars on Trees" – sorted by Relevance.
-
Compiling Declarative Specifications of Parsing Algorithms
- of schemata for context-free grammars, tree adjoining grammars and other grammatical formalisms, providing
- Cited by 1 (1 self) – Add To MetaCart
-
Hierarchical stochastic image grammars for classification and segmentation
- classification, probabilistic context-free grammar, segmentation, statistical image model, stochastic context-free
- Cited by 3 (1 self) – Add To MetaCart
-
The Descriptive Complexity of Generalized Local Sets
- Abstract Context-free grammars and tree automata, because they are required to be finite, are limited
- Cited by 3 (1 self) – Add To MetaCart
-
From Context-Free Grammars With Priorities to Character Class Grammars
- context-free grammar with priorities to a character class grammar that does only generate trees without
- Cited by 1 (0 self) – Add To MetaCart
-
Lexical Constraint Grammars
- directly be applied to McCawley’s conception of context-free grammar: the trees licensing sentences in a
- Add To MetaCart
-
Top-down parsing with simultaneous evaluation of noncircular attribute grammars
- of syntax trees of strings which are generated by the underlying context--free grammar G 0 , into a set A
- Cited by 4 (4 self) – Add To MetaCart
-
A Parser for Harmonic Context-Free Grammars
- A Parser for Harmonic Context-Free Grammars Abstract Harmonic Grammar is a connectionist
- Cited by 1 (0 self) – Add To MetaCart
-
Quasi-Synchronous Grammars: Alignment by Soft Projection of Syntactic Dependencies
- -synchronous context-free grammar (QCFG) for generating translations of a source tree T1. The QCFG generates the target
- Cited by 5 (2 self) – Add To MetaCart
-
Automatic learning of parallel dependency treelet pairs
- , such as Synchronous Context Free Grammars (S-CFG) or Synchronous Tree Adjoining Grammars (S-TAG) (Shieber and Schabes
- Cited by 8 (2 self) – Add To MetaCart
-
Visual languages: Generating structure-editors from pattern-based speci
- as the central data structures.They are specified by a context-free grammar (tree grammar). An attribute grammar
- Cited by 3 (2 self) – Add To MetaCart

