context-free grammar formalism
Generalized Multitext Grammars
... titext Grammar (MTG), a formalism for synchro- nizing context-free grammars recently proposed by Melamed ...generate context- free languages to component grammars whose gen- ...
8
Compound Probabilistic Context Free Grammars for Grammar Induction
... to grammar induction require specify- ing a probabilistic grammar ...(e.g. formalism, num- ber and shape of rules), and fitting its parameters through ...probabilistic context-free ...
17
Accurate Context Free Parsing with Combinatory Categorial Grammar
... The context-freeness of a number of CCGs should not be considered evidence that there is no ad- vantage to CCG as a grammar ...the context-free grammars extracted from the Penn treebank, these ...
10
Left To Right Parsing and Bilexical Context Free Grammars
... Abstract We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction o[r] ...
8
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
Using Contextual Representations to Efficiently Learn Context-Free Languages
... a formalism like GPSG (Generalised Phrase Structure Grammar) (Gazdar et ...meta- grammar—a compact way of specifying a very large CFG with richly structured ...
38
A Grammar Formalism and Parser for Linearization based HPSG
... As with Earley’s algorithm, the bulk of the work performed by the algorithm is borne by two steps, prediction and completion. Unlike the context-free case, however, it is not possible to anchor these steps ...
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
Representing and Learning Grammars in Answer Set Programming
... Deciding satisfiability for a general ILP LAS context task is Σ P 2 complete (in the propositional case); however, if there are no negative examples then the complexity is only N P - complete. ILASP tasks with no ...
10
An Alternative Method of Training Probabilistic LR Parsers
... a context-free grammar cannot be expressed in terms of the LR parser constructed from that grammar, under the restrictions of the existing approaches to training of LR ...the ...
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
A Context Free Process as a Pushdown Automaton
... a context-free process may have unbounded branching [8] that we need to mimic with our pushdown ...of context-free processes we have bounded branching, and thus we don’t need the forgetfulness ...
7
Alphabetic Flat Splicing Pure Context-free Grammar Systems
... Pure context-free grammars [6] which make use of only one kind of symbols, called terminal symbols, have been investigated in formal string language theory for their generating power and other ...pure ...
6
Context Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
... representation which maintains these beneficial proper- ties. Although proofs have not been provided here, the algorithm can be shown to satisfy our initial formal def- inition of transfer as nondeterministic, ...
5
Robust German Noun Chunking With a Probabilistic Context Free Grammar
... A head-lexicalised probabilistic context-free parser, called LoPar (Schmid, 1999), was used for pars- ing. The functionality of LoPar encompasses purely symbolic parsing as well as Viterbi parsing, inside- ...
7
Probabilistic Context Free Grammar Induction Based on Structural Zeros
... the grammar fac- torization method described, factored non-terminals can only occur as the second child of a binary pro- ...parent-annotated grammar, we use a version of the parser that also takes advantage ...
8
A Variant of Extended Two-dimensional Context-free Picture Grammar
... several grammar models [2] that generate two-dimensional (2D) picture languages have been proposed, generalizing concepts and techniques of formal string language ...two-dimensional grammar model, called ...
8
Manually constructed context free grammar for Myanmar syllable structure
... constructed context free grammar (CFG) with “111” productions to describe the Myanmar Syllable ...LL(1) grammar so that we can apply conventional parsing technique called predictive top-down ...
6
Using Semantics in Non Context Free Parsing of Montague Grammar
... 1978b Evaluating English sentences in a logical model, presented to the 7th Inter- national Conference on Computation Linguistics, University of Bergen, Norway August 14-18.. Ann Arbor, [r] ...
16
Improving Semantic Parsing with Enriched Synchronous Context Free Grammar
... Semantic parsing maps a sentence in natu- ral language into a structured meaning rep- resentation. Previous studies show that se- mantic parsing with synchronous context- free grammars (SCFGs) achieves ...
11