Optimal and information theoretic syntactic pattern recognition involving traditional and transposition errors
From MaRDI portal
Publication:6567774
Recommendations
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A Method for the Correction of Garbled Words Based on the Levenshtein Metric
- A common basis for similarity measures involving two strings†
- A faster algorithm computing string edit distances
- An Extension of the String-to-String Correction Problem
- Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition
- Experiments in Text Recognition with the Modified Viterbi Algorithm
- Syntactic methods in pattern recognition
- The String-to-String Correction Problem
This page was built for publication: Optimal and information theoretic syntactic pattern recognition involving traditional and transposition errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567774)