set </term> is 49.3 % . Similar results were also obtained on the <term> February '92 benchmark
algorithm </term> . In addition , it could also be used to help evaluate <term> disambiguation
not covered by the <term> grammar </term> . We also report here on the performance of the <term>
</term> in <term> compound nouns </term> , but also can find the correct candidates for the
logic program </term> is proposed . It is also a drastic generalization of <term> chart
</term> , and <term> word matchings </term> , are also factored in by modifying the <term> transition
hide detail