Although adequate models of
<term>
human language
</term>
for
<term>
syntactic analysis
</term>
and
<term>
semantic interpretation
</term>
are of at least
<term>
context-free complexity
</term>
, for applications such as
<term>
speech processing
</term>
in which speed is important
<term>
finite-state models
</term>
are often preferred .
#29792Although 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 important finite-state models are often preferred.
tech,27-2-P97-1058,ak
These requirements may be reconciled by using the more complex
<term>
grammar
</term>
to automatically derive a finite-state approximation which can then be used as a filter to guide
<term>
speech recognition
</term>
or to reject many hypotheses at an early stage of
<term>
processing
</term>
.
#29832These 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 of processing.