Parsing Complexity
metric
ID: parsingcomplexity
Related Papers
Some Computational Properties of Tree Adjoining Grammars
Tree Adjoining Grammar (TAG) is u formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Jo~hi,Levy, mad Takakashi I~'Sl and by [Jo~hi, l~l. A …...
Emergent Parsing and Generation with Generalized Chart
A new, flexible inference method for Horn logic pro- gram is proposed. It is also a drastic gencndization of chart I)aming, partial instaatiation of clauses in a pro- gram ronghly …...
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewrit- ing System (LCFRS) into two simpler produc- tions by factoring out a subset of the nontermi- nals …...