The performance prediction method on sentence recognition system using a finite state automaton

Author(s):  
T. Otsuki ◽  
A. Ito ◽  
S. Makino ◽  
T. Otomo
Author(s):  
SHOZO MAKINO ◽  
AKINORI ITO ◽  
MITSURU ENDO ◽  
KEN’ITI KIDO

This paper describes an overview of a continuous speech recognition system composed of an acoustic processor and a linguistic processor. The system deals with 843 conceptual words and 431 functional words. We have constructed an acoustic processor using a modified learning vector quantization method (MLVQ2) for phoneme recognition. The phoneme recognition score was 85.5% for 226 sentences uttered by two male speakers. The linguistic processor is composed of a processor for spotting bunsetsu units (i.e. units similar to a “phrase” in English) and a syntactic processor. The structure of the bunsetsu unit is effectively described by a finite-state automaton, the test-set word-perplexity of which is 230. In the processor for spotting bunsetsu units, using a syntax-driven continuous-DP matching algorithm, the bunsetsu units are spotted from a recognized phoneme sequence and then a bunsetsu unit lattice is generated. In the syntactic processor, the bunsetsu unit lattice is parsed based on the dependency grammar, which is expressed as the correspondence between a FEATURE marker in a modifier-bunsetsu and a SLOT-FILLER marker in a head-bunsetsu. The recognition scores of the bunsetsu units and conceptual words were 75.2% and 88.9% respectively for 226 sentences uttered by the two male speakers.


2009 ◽  
Vol 30 (5) ◽  
pp. 1343-1369 ◽  
Author(s):  
DANNY CALEGARI ◽  
KOJI FUJIWARA

AbstractA function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite-state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left- and right-invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include:(1)homomorphisms to ℤ;(2)word length with respect to a finite generating set;(3)most known explicit constructions of quasimorphisms (e.g. the Epstein–Fujiwara counting quasimorphisms).We show that bicombable functions on word-hyperbolic groups satisfy acentral limit theorem: if$\overline {\phi }_n$is the value of ϕ on a random element of word lengthn(in a certain sense), there areEandσfor which there is convergence in the sense of distribution$n^{-1/2}(\overline {\phi }_n - nE) \to N(0,\sigma )$, whereN(0,σ) denotes the normal distribution with standard deviationσ. As a corollary, we show that ifS1andS2are any two finite generating sets forG, there is an algebraic numberλ1,2depending onS1andS2such that almost every word of lengthnin theS1metric has word lengthn⋅λ1,2in theS2metric, with error of size$O(\sqrt {n})$.


Author(s):  
E Swain

A one-dimensional centrifugal compressor performance prediction technique that has been available for some time is updated as a result of extracting the component performance from three-dimensional computational fluid dynamic (CFD) analyses. Confidence in the CFD results is provided by comparison of overall performance for one of the compressor examples. The extracted impeller characteristic is compared with the original impeller loss model, and this indicated that some improvement was desirable. The position of least impeller loss was determined using a traditional axial compressor cascade method, and suitable algebraic expressions were derived to match the CFD data. The merit of the approach lies with the relative ease that CFD component performance currently can be achieved and adjusting one-dimensional methods to agree with the CFD-derived models.


Sign in / Sign up

Export Citation Format

Share Document