Context-free Grammar

A A Trellis-Based Algorithm For Estimating The Parameters Of (2008)

Hidden Stochastic, Context-free Grammar

The paper presents a new algorithm for estimating the pa-rameters of a hidden stochastic context-free grammar. In con-trast to the Inside/Outside (I/O) algorithm it does not require the grammar to be...

Extending a Parsing Strategy to Become Probabilistic Part I Parsing Strategy Basics Context-Free Grammars (2007)

Tu Dresden, Lena Morgenroth, An Example, Top-down Parsing, Context-free Grammar

A context-free grammar (CFG) is a 4-tuple G = (Σ, N, S, P), with: Σ the alphabet, a finite set of terminal symbols N a finite set of nonterminal symbols S ∈ N the start symbol P ⊆ N × (Σ ∪...

Tree Insertion Grammar: A Cubic-Time Parsable Formalism That Lexicalizes Context-Free Grammar without Changing the Trees Produced (1994)

That Lexicalizes, Context-free Grammar, Yves Schabes, Richard C. Waters

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is...