Context-free tree grammar
Towards A Context- Free Grammar For Arabic Words
... stage. Context- Free-Grammar is a formal grammar which is used to present the structure of a ...parse tree can be seen as a graphical representation of a ...
6
Tree Insertion Grammar: A Cubic Time, Parsable Formalism that Lexicalizes Context Free Grammar without Changing the Trees Produced
... 6.1 The Size of LTIG Grammars The top of Figure 17 shows the n u m b e r of elementary initial and auxiliary trees in grammars created by the LTIG procedure given the various test gramma[r] ...
36
Manually constructed context free grammar for Myanmar syllable structure
... Again, it is necessary to calculate the probability values for each production based on the frequency of occurrence of a syllable in a dictionary we referred or using TreeBank. We need Myanmar corpus or a tree ...
6
Compound Probabilistic Context Free Grammars for Grammar Induction
... formation followed by a sigmoid. If SHIFT is cho- sen, we obtain a distribution over the vocabulary via another affine transformation over the stack representation followed by a softmax. Then we sample the next word from ...
17
Improving Semantic Parsing with Enriched Synchronous Context Free Grammar
... MRL tree. tsVB (Jones et al., 2012) used tree transducers, which were similar to the hybrid tree structures, to learn a generative process under a Bayesian frame- ...hybrid tree structures ...
11
Synchronous Context Free Tree Grammars
... linear context-free rewriting system (LCFRS) (Vijay-Shanker et ...a context-free grammar in which each nonterminal has a fixed number of parameter positions, each of which contains a ...
9
Book Reviews: Beyond Grammar: An Experience based Theory of Language
... The result is that counts of tree fragments of a wide range of sizes are considered: everything from counts of single-level rules as in a Stochastic Context-Free Grammar to counts of en-[r] ...
5
Context Free Grammar Analysis for Arabic Sentences
... Parsing (syntactic analysis) is the process of mapping the sen- tence (string of words) to its parse tree. To do that, an efficient Context-Free Grammar (CFG), which defines the language, is ...
5
A Generic Parser for Strings and Trees
... a context free grammar, a regular tree grammar, or from ...regular tree automata, combined with a newly introduced concept, called state instantiation and transition ...a ...
30
Restrictions on Monadic Context Free Tree Grammars
... Proof. Since it is enough to show the existence of a weakly equivalent grammar, without loss of gen- erality, we may assume that G is in strong normal form. We may also assume that the initial nonter- minal S ...
7
CRYPTOSCANF: CRYPTOSYSTEM USING CFG
... Context free grammars present the desirable cryptographic property that it is easy to generate and validate strings from a given grammar; however it is hard to identify a grammar given only ...
12
Using Contextual Representations to Efficiently Learn Context-Free Languages
... of context-free languages ...of context-free languages (Eyraud et ...learning context- free grammars (see Adriaans, 2002 for ...for context-free grammatical ...
38
A Direct Link between Tree Adjoining and Context Free Tree Grammars
... are tree-generating systems which enjoy widespread use in natural lan- guage processing to model syntactic phenomena which can not be adequately described by context- free ...contrast, ...
5
An Augmented Context Free Grammar for Discourse
... An Augmented Context Free Grammar for Discourse An Augmented Context Free Grammar for Discourse Abstract This paper presents an augmented context free grammar which describes important features of the[.] ...
5
Generalized Multitext Grammars
... Transduction Grammar (ITG) (Wu, 1997) and Syntax-Directed Translation Schema (SDTS) (Aho and Ullman, 1969) lack both of these prop- ...Synchronous Tree Adjoining Grammar (STAG) (Shieber, 1994) lacks ...
8
State machine of place-labelled Petri net controlled grammars
... controlled grammar is presented by the investigation of subclass of place-labelled Petri net controlled grammar, namely state ...controlled grammar is given, where each transition of place-labelled ...
5
An Alternative Method of Training Probabilistic LR Parsers
... ambiguous context-free grammars ...this context, the LR parsing strategy can be seen as a particular map- ping from context-free grammars to ...
8
Alphabetic Flat Splicing Pure Context-free Grammar Systems
... two-dimensional grammar models have been utilized [9] to generate certain types of picture patterns, such as “floor designs” (or also called “kolam patterns”) treating the picture pattern as an array over terminal ...
6
Context Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
... given context-free grammar representing the source packed structure a context-free grammar representing the tar- get packed ...source grammar derivations), the target ...
5
Robust German Noun Chunking With a Probabilistic Context Free Grammar
... between nominative and accusative case is due to the fact that both cases are expressed by identical morphology in the feminine and neutral genders in German. The morphologic similarity between ac- cusative and dative is ...
7