Error detection, recovery, and repair in the translation of inorganic nomenclatures. 2. A proposed strategy

Journal of Chemical Information and Computer Sciences

Volumn 36, Issue 1, 1996, Pages 16-24

  Luque Ruiz, I ^a   Cruz Soto, J L ^a   Gomez Nieto M A ^a  

^a UNIVERSITY OF CÓRDOBA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011924909     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci950222u     Document Type: Article

References (25)

1. Tarhio, J.; Ukkonen, E. Approximate Boyer-Moore String Matching. SIAM J. Comput. 1993, 22(2), 243-260.
2. Cole, R. Tight Bounds on the Complexity of the Boyer-Moore String Molecular Algorithm. Courant Institute: New York University, Technical Report, New York, 1991.
3. Apostolico, A.; Giancarlo, R. The Boyer-Moore-Galil String Searching Strategies Revisited." SIAM J. Comput. 1986, 15(1), 98-105.
4. Boyer, R.; Moore, S. A Fast String Matching Algorithm. J. CACM 1977, 20, 762-777.
5. Gali., Z. On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm. J. CACM 1979, 22, 505-508.
6. Marzal, A.; Vidal, E. Computation of Normalized Edit Distance and Applications. IEEE Trans. Pattern Anal. Machine. 1993, 15(9), 926-932.
7. Levenshtein, V. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. soDiet. Phys. Dokl. 1966, 6, 126-136.
8. Luque Ruiz, I.; Cruz Soto, J. L.; Gómez-Nieto, M. A. Error detection, recovery and repair in the translation of inorganic nomenclatures. 1. A study of the problem. J. Chem. Inf. Comput. Sci. 1995, 35, xxxx.
9. Hippe, Z. Artificial Intelligence in Chemistry; Elsevier: Amsterdam, 1991.
10. Ukkonen, E.; Wood, D. Approximate String Matching with Suffix Automata. Algorithmica 1993, 10(5), 353-364.
11. Jokinen, P.; Tarhio, J.; Ukkonen, E. Comparison of Approximate String Matching Algorithms. Helsinki University, Department of Computer Science, Technical Report: A-1991-7, 1991.
12. Ukkonen, E. Finding Approximate Patterns in Strings. J. Algorithms 1985, 6, 132-137.
13. Fischer, C. N.; Leblanc, R. J. Grafting a Compiler; The Benjamin Cummings Publisher: 1988.
14. Lewis, P. M.; Rosenkrantz, D. J.; Stearns, R. E. Compiler Design Theory; Addison-Wesley: 1976.
15. Trembay, J. P.; Sonrenson, P. G. The Theory and Practice of Compiler Writing; McGraw-Hill: 1985.
16. Aho, A. V.; Ullman, J. D. The Theory of Parsing, Translation, and Compiling. Volumen I: Parsing; Prentice-Hall: 1972.
17. Bratchikov, I. L.; Diallo, M. M. Elementary and Structural Language Errors and Methods for their Handling. Automatic Control Comput. Sci. 1991, 25(4), 81-84.
18. Segal, J.; Ahmad, K.; Rogers, M. The Role of Systematic Errors in Developmental Studies of Programming Languages Learners. J. Educ. Comput. Res. 1992, 8(2) 129-153.
19. Pollock, J. J. Spelling Error Detection and Correction by Computer: Some Notes and Bibliography. J. Documentation 1982, 38(4) 282-291.
20. Pollock, J. J.; Zamora, A. Collection and Characterization of Spelling Errors in Scientific and Scholarly Text. J. Am. Soc. Inf. Sci. 1983, 324(1), 51-58.
21. Chang, W. I.; Lampe, J. Theoretical and Empirical Comparison of Approximate String Matching Algorithms. Technical Report: 91-653, CA, 1991.
22. Kukich, K. Techniques for Automatically Correcting Words in Text. ACM Comput. Surveys 1992, 24(4), 377-439.
23. Bertossi, A. A.; Lucio, F.; Lodi, E.; Pagli, L. String Matching with Weighted Errors. Theoretical Comput. Sci. 1990, 73(3), 319-328.
24. Jacquet, P.; Szpankowski, W. Autocorrelation on Words and Its Applications. Analysis of Suffix Trees by String Ruler Approach. J. Combinatorial Theory 1994, 66(2), 237-269.
25. Luque Ruiz, I.; Cruz Soto, J. L.; Gómez-Nieto, M. A. Error detection, recovery and drepair in the translation of inorganic nomenclatures. 3. An Error Handler. J. Chem. Inf. Comput. Sci. Submitted for publication, 1995.