tech,10-2-E87-1037,ak formalisms </term> is organized within a <term> chart-parsing framework </term> . The declarative character of the
tech,19-5-E87-1037,ak rule-invocation strategies </term> within <term> context-free chart parsing </term> . The <term> verb forms </term> are often
other,11-1-E87-1037,ak declarative and towards utilizing <term> context-free phrase-structure grammar </term> as a backbone , e.g. <term> LFG </term>
tech,15-3-E87-1037,ak to decide upon an overall optimal <term> control strategy </term> on the part of the <term> processor
other,5-2-E87-1037,ak Typically the processing of these <term> formalisms </term> is organized within a <term> chart-parsing
other,5-3-E87-1037,ak . The declarative character of the <term> formalisms </term> makes it important to decide upon
other,2-1-E87-1037,ak normal form </term> . Currently several <term> grammatical formalisms </term> converge towards being declarative
tech,19-1-E87-1037,ak grammar </term> as a backbone , e.g. <term> LFG </term> and <term> PATR-II </term> . Typically
tech,21-1-E87-1037,ak backbone , e.g. <term> LFG </term> and <term> PATR-II </term> . Typically the processing of these
other,15-4-E87-1037,ak into critical focus : to gain maximal <term> processing efficiency </term> , one has to determine the best way
tech,22-3-E87-1037,ak strategy </term> on the part of the <term> processor </term> . In particular , this brings the
tech,16-5-E87-1037,ak practical comparison of fundamental <term> rule-invocation strategies </term> within <term> context-free chart parsing
tech,6-4-E87-1037,ak </term> . In particular , this brings the <term> rule-invocation strategy </term> into critical focus : to gain maximal
model,28-4-E87-1037,ak determine the best way of putting the <term> rules </term> to use . The aim of this paper is
hide detail