| other,4-1-P97-1058,ak | </term> . Although adequate models of <term> | human language | </term> for <term> syntactic analysis </term> | #29773 Although adequate models ofhuman language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. | |
| tech,7-1-P97-1058,ak | models of <term> human language </term> for <term> | syntactic analysis | </term> and <term> semantic interpretation </term> | #29776 Although adequate models of human language forsyntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. | |
| tech,10-1-P97-1058,ak | <term> syntactic analysis </term> and <term> | semantic interpretation | </term> are of at least <term> context-free | #29779 Although adequate models of human language for syntactic analysis andsemantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. | |
| other,16-1-P97-1058,ak | interpretation </term> are of at least <term> | context-free complexity | </term> , for applications such as <term> speech | #29785 Although adequate models of human language for syntactic analysis and semantic interpretation are of at leastcontext-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. | |
| tech,23-1-P97-1058,ak | complexity </term> , for applications such as <term> | speech processing | </term> in which speed is important <term> | #29792 Although adequate models of human language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such asspeech processing in which speed is important finite-state models are often preferred. | |
| tech,30-1-P97-1058,ak | </term> in which speed is important <term> | finite-state models | </term> are often preferred . These requirements | #29799 Although adequate models of human language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is importantfinite-state models are often preferred. | |
| lr,10-2-P97-1058,ak | reconciled by using the more complex <term> | grammar | </term> to automatically derive a finite-state | #29815 These requirements may be reconciled by using the more complexgrammar to automatically derive a finite-state approximation which can then be used as a filter to guide speech recognition or to reject many hypotheses at an early stage of processing. | |
| tech,27-2-P97-1058,ak | then be used as a filter to guide <term> | speech recognition | </term> or to reject many hypotheses at an | #29832 These requirements may be reconciled by using the more complex grammar to automatically derive a finite-state approximation which can then be used as a filter to guidespeech recognition or to reject many hypotheses at an early stage of processing. | |
| tech,39-2-P97-1058,ak | many hypotheses at an early stage of <term> | processing | </term> . A method is presented here for | #29844 These requirements may be reconciled by using the more complex grammar to automatically derive a finite-state approximation which can then be used as a filter to guide speech recognition or to reject many hypotheses at an early stage ofprocessing. | |
| lr,11-3-P97-1058,ak | such finite-state approximations from <term> | context-free grammars | </term> . It is essentially different from | #29857 A method is presented here for calculating such finite-state approximations fromcontext-free grammars. |
