Optimal and information theoretic syntactic pattern recognition involving traditional and transposition errors
From MaRDI portal
Publication:6567774
DOI10.1007/3-540-62034-6_52zbMATH Open1541.68334MaRDI QIDQ6567774FDOQ6567774
Authors: B. John Oommen, R. K. S. Loke 
Publication date: 5 July 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The String-to-String Correction Problem
- 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
- Syntactic methods in pattern recognition
- A common basis for similarity measures involving two strings†
- A Method for the Correction of Garbled Words Based on the Levenshtein Metric
- Experiments in Text Recognition with the Modified Viterbi Algorithm
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)
