Results 1  10
of
38,959
Generalized ContextFree Grammars
, 1996
"... We consider several language generating formalisms from the literature, such as stringvalued attribute grammars with only sattributes, parallel multiple contextfree grammars, relational grammars and topdown treetostring transducers, of which we have chosen the OnlyS stringvalued attribute gra ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider several language generating formalisms from the literature, such as stringvalued attribute grammars with only sattributes, parallel multiple contextfree grammars, relational grammars and topdown treetostring transducers, of which we have chosen the OnlyS stringvalued attribute
Modularized ContextFree Grammars
 In MOL6  Sixth Meeting on Mathematics of Language
, 1999
"... Given two contextfree grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 [ G 2 ) 6= L(G 1 ) [ L(G 2 ). In order to account for modularity of grammars, another way of defining the meaning of grammars ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Given two contextfree grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 [ G 2 ) 6= L(G 1 ) [ L(G 2 ). In order to account for modularity of grammars, another way of defining the meaning
Multiple ContextFree Grammars
"... Multiple contextfree grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called mMCFG if all tuples have at most m components. In this summary I will outline that the expressivity of mMCFG’s increases with the parameter m and that the class ..."
Abstract
 Add to MetaCart
Multiple contextfree grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called mMCFG if all tuples have at most m components. In this summary I will outline that the expressivity of mMCFG’s increases with the parameter m
ContextFree Grammars and Languages
"... � � V is a finite set of variables (nonterminals) � ∑, the alphabet, is a finite set of terminal symbols � P is a finite set of rules of the form V × (V ∪ ∑)*, and � S ∈ V, is the start symbol � � A production rule of the form A → ww, where w ∈ (V ∪ ∑)*, applied to the string uAv yields uwv, and u ..."
Abstract
 Add to MetaCart
and v define the context in which A occurs. � Because the context places no limitations on the applicability of a rule, such a grammar is called contextfree grammar (CFG) 2
Ordered ContextFree Grammars
"... Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any
Pregroup Grammars and Contextfree Grammars
"... Pregroup grammars were introduced by Lambek [20] as a new formalism of typelogical grammars. They are weakly equivalent to contextfree grammars ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Pregroup grammars were introduced by Lambek [20] as a new formalism of typelogical grammars. They are weakly equivalent to contextfree grammars
ContextFree Grammar for Bangla
"... Abstract: This paper proposes a way of producing contextfree grammar for Bangla Language. The grammar proposed by this paper can successfully parse a number of sentences having seven to eight words of length, extracted randomly from a newspaper article. We have defined a tag set and according to th ..."
Abstract
 Add to MetaCart
Abstract: This paper proposes a way of producing contextfree grammar for Bangla Language. The grammar proposed by this paper can successfully parse a number of sentences having seven to eight words of length, extracted randomly from a newspaper article. We have defined a tag set and according
Objectoriented parallel parsing for contextfree grammars
 In Proceedings of the 12th conference on Computational linguistics  Volume 2
, 1988
"... Objectoriented parallel parsing for contextfree grammars ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Objectoriented parallel parsing for contextfree grammars
Stochastic ContextFree Grammars
, 2004
"... Introduction: Strings, Grammars & Formal Languages Stochastic contextfree grammars, or SCFGs, are generative systems of stochastic languages. In other words, a SCFG specifies a probability distribution over the set of all possible strings that are concatenated from a finite alphabet . Defin ..."
Abstract
 Add to MetaCart
Introduction: Strings, Grammars & Formal Languages Stochastic contextfree grammars, or SCFGs, are generative systems of stochastic languages. In other words, a SCFG specifies a probability distribution over the set of all possible strings that are concatenated from a finite alphabet
Consistency of Probabilistic ContextFree Grammars Consistency of Probabilistic ContextFree Grammars
"... We present an algorithm for deciding whether an arbitrary proper probabilistic contextfree grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity O(n 3 ) in the unitcost model of computation. Moreover, we develop a novel charact ..."
Abstract
 Add to MetaCart
We present an algorithm for deciding whether an arbitrary proper probabilistic contextfree grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity O(n 3 ) in the unitcost model of computation. Moreover, we develop a novel
Results 1  10
of
38,959