tech,12-5-H01-1041,bq knowledge-based automated acquisition of grammars </term> . Having been trained on <term> Korean
other,5-1-P01-1007,bq theoretical study of the <term> range concatenation grammar [ RCG ] formalism </term> has revealed many
lr,11-3-P01-1007,bq <term> RCG </term> , any <term> tree adjoining grammar </term> can be parsed in <term> O ( n6 ) time
model,11-6-P01-1007,bq method </term> on a <term> wide coverage English grammar </term> are given . While <term> paraphrasing
other,6-1-P01-1047,bq logical definition </term> of <term> Minimalist grammars </term> , that are <term> Stabler 's formalization
other,9-2-P01-1047,bq leads to a neat relation to <term> categorial grammar </term> , ( yielding a treatment of <term>
other,12-1-N03-1026,bq techniques </term> for <term> Lexical-Functional Grammars ( LFG ) </term> to the domain of <term> sentence
other,8-2-H05-1101,bq pairs of <term> probabilistic context-free grammars </term> working in a ' synchronous ' way
other,15-2-P05-1067,bq probabilistic synchronous dependency insertion grammar </term> . <term> Synchronous dependency insertion
other,0-3-P05-1067,bq </term> . <term> Synchronous dependency insertion grammars </term> are a version of <term> synchronous
other,8-3-P05-1067,bq </term> are a version of <term> synchronous grammars </term> defined on <term> dependency trees </term>
other,9-4-P05-1067,bq <term> approach </term> to inducing such a <term> grammar </term> from <term> parallel corpora </term>
other,12-3-P06-1018,bq powerful enough to strongly simulate many <term> grammar formalisms </term> , such as <term> rewriting
other,20-3-P06-1018,bq rewriting systems </term> , <term> dependency grammars </term> , <term> TAG </term> , <term> HPSG </term>
other,23-2-P06-1052,bq <term> USRs </term> computed by <term> large-scale grammars </term> . We evaluate the algorithm on a <term>
tech,22-1-P06-2001,bq checker </term> to be integrated in a <term> grammar checker </term> for <term> Basque </term> . After
other,14-1-C82-1054,bq parsing algorithm </term> for <term> context-free grammars </term> . It is argued that the resulting
other,5-4-J82-3002,bq </term> . With the aid of a <term> logic-based grammar formalism </term> called <term> extraposition
other,9-4-J82-3002,bq formalism </term> called <term> extraposition grammars </term> , <term> Chat-80 </term> translates <term>
other,1-3-P84-1047,bq are grouped together . Like <term> semantic grammar </term> , this allows easy exploitation of
hide detail