## A Formal Theory for Optimal and Information Theoretic Syntactic Pattern Recognition (0)

### Cached

### Download Links

- [www.scs.carleton.ca]
- [people.scs.carleton.ca]
- [people.scs.carleton.ca:8008]
- [www.scs.carleton.ca]
- DBLP

### Other Repositories/Bibliography

Citations: | 4 - 2 self |

### BibTeX

@MISC{Oommen_aformal,

author = {B. J. Oommen and R. L. Kashyap},

title = {A Formal Theory for Optimal and Information Theoretic Syntactic Pattern Recognition},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we present a foundational basis for optimal and information theoretic syntactic pattern recognition. We do this by developing a rigorous model, M * , for channels which permit arbitrarily distributed substitution, deletion and insertion syntactic errors. More explicitly, if A is any finite alphabet and A * the set of words over A, we specify a stochastically consistent scheme by which a string U A * can be transformed into any Y A * by means of arbitrarily distributed substitution, deletion and insertion operations. The scheme is shown to be Functionally Complete and stochastically consistent. Apart from the synthesis aspects, we also deal with the analysis of such a model and derive a technique by which Pr[Y|U], the probability of receiving Y given that U was transmitted, can be computed in cubic time using dynamic programming. One of the salient features of this scheme is that it demonstrates how dynamic programming can be applied to evaluate quantities involv...