<term> inheritance mechanisms </term> are used to capture <term> lexical generalizations </term>
</term> in a program roughly corresponding to <term> arcs </term> in a <term> chart </term> .
the <term> parsing complexity </term> reduces to that of standard <term> chart-based algorithms
<term> extraction and conversion rules </term> to <term> entries </term> from <term> machine readable
strategies </term> , in a similar fashion to the <term> SYSCONJ system </term> developed
<term> language model </term> that attempts to capture <term> long distance constraints </term>
mixture trigram models </term> as compared to using a <term> trigram model </term> . This
<term> speechrepairs </term> , and so is able to mark a <term> transition </term> either as
measure(ment),28-1-H05-1117,bq for <term> automatically evaluating answers to definition questions </term> . Until now
tech,1-1-P84-1047,bq </term> . An <term> entity-oriented approach to restricted-domain parsing </term> is proposed
tech,1-2-C88-1007,bq . The <term> Isomorphic Grammars approach to MT </term> involves developing the <term> grammars
tech,21-1-N03-1004,bq multi-strategy and multi-source approach to question answering </term> which is based
hide detail