Tuning the Selection of Correction Candidates for Garbled Tokens using Error Dictionaries
暂无分享,去创建一个
Klaus U. Schulz | Stoyan Mihov | Ulrich Reffle | Christoph Ringlstetter | Petar Mitankin | Annette Gotscharek
[1] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[2] Klaus U. Schulz,et al. Orthographic Errors in Web Pages: Toward Cleaner Web Corpora , 2006, Computational Linguistics.
[3] Andreas Arning. Fehlersuche in großen Datenmengen unter Verwendung der in den Daten vorhandenen Redundanz , 1997, DISKI.
[4] Klaus U. Schulz,et al. Fast string correction with Levenshtein automata , 2002, International Journal on Document Analysis and Recognition.
[5] Justin Zobel,et al. Finding approximate matches in large lexicons , 1995, Softw. Pract. Exp..
[6] Klaus U. Schulz,et al. Fast Selection of Small and Precise Candidate Sets from Dictionaries for Text Correction Tasks , 2007, Ninth International Conference on Document Analysis and Recognition (ICDAR 2007).
[7] D. R. McGregor,et al. Fast approximate string matching , 1988, Softw. Pract. Exp..
[8] F TichyWalter. The string-to-string correction problem with block moves , 1984 .
[9] Klaus U. Schulz,et al. Fast Approximate Search in Large Dictionaries , 2004, CL.
[10] Klaus U. Schulz,et al. Deriving Symbol Dependent Edit Weights for Text Correction_The Use of Error Dictionaries , 2007 .
[11] Karen Kukich,et al. Techniques for automatically correcting words in text , 1992, CSUR.
[12] Klaus U. Schulz,et al. A visual and interactive tool for optimizing lexical postcorrection of OCR results , 2003, 2003 Conference on Computer Vision and Pattern Recognition Workshop.
[13] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .