scholarly journals N-Gram Based Test Sequence Generation from Finite State Models

Author(s):  
Paolo Tonella ◽  
Roberto Tiella ◽  
Cu D. Nguyen
Author(s):  
A. H. TOSELLI ◽  
A. JUAN ◽  
J. GONZÁLEZ ◽  
I. SALVADOR ◽  
E. VIDAL ◽  
...  

The interpretation of handwritten sentences is carried out using a holistic approach in which both text image recognition and the interpretation itself are tightly integrated. Conventional approaches follow a serial, first-recognition then-interpretation scheme which cannot adequately use semantic–pragmatic knowledge to recover from recognition errors. Stochastic finite-sate transducers are shown to be suitable models for this integration, permitting a full exploitation of the final interpretation constraints. Continuous-density hidden Markov models are embedded in the edges of the transducer to account for lexical and morphological constraints. Robustness with respect to stroke vertical variability is achieved by integrating tangent vectors into the emission densities of these models. Experimental results are reported on a syntax-constrained interpretation task which show the effectiveness of the proposed approaches. These results are also shown to be comparatively better than those achieved with other conventional, N-gram-based techniques which do not take advantage of full integration.


Author(s):  
DAVID LLORENS ◽  
JUAN MIGUEL VILAR ◽  
FRANCISCO CASACUBERTA

We address the problem of smoothing the probability distribution defined by a finite state automaton. Our approach extends the ideas employed for smoothing n-gram models. This extension is obtained by interpreting n-gram models as finite state models. The experiments show that our smoothing improves perplexity over smoothed n-grams and Error Correcting Parsing techniques.


Sign in / Sign up

Export Citation Format

Share Document