An Error-Correcting Parser for a Context-Free Language Based on the Context-Dependent Similarity
Patterns are essentially context-dependent. This paper describes an error-correcting parser for a context-free language, which finds most similar sentences to an input sentence based on the context-dependent similarity(CDS). The proposed algorithm is obtained by modifying the Lyon’s error-correcting parser. Possible application are to the problem of pattern recognition, speech recognition and language processing.
KeywordsCost Function Parse Table Error Cost Input Sentence Similar Sentence
Unable to display preview. Download preview PDF.
- (1).Fu, K.S.: “Error-correcting parsers for syntactic pattern recognition” in DATA Structure, Computer Graphics and Pattern Recognition, Klinger et.al. Eds. Academic, N.Y. (1976).Google Scholar
- (6).Yamasaki, S. and Tonomura, T.:“On a bottom-up least error correction algorithm for context-free languages”, J. Inf. Process. Soc. Jpn. 18, pp.781–788(1977).Google Scholar
- (7).Cocke, J. and Schwarts, Y.T.:“Programming language and their compilers”, Courant Inst, of Mathematical Science, N.Y.(1967).Google Scholar
- (8).Tanaka, E.: “An improved error-correcting parser for a context-free language”, Trans. IECE, Jpn, E-67, 7, pp.379–385(1984).Google Scholar
- (11).Okuda, T., Tanaka, E. and Kasai, T.:“A garbled word correcting method by an extended metric”, Ann. Joint Meeting of Electrical and Electronics Eng. Tokai Distinct, Jpn., 18a-B-6 (1972).Google Scholar
- (12).Tanaka, E.: “A context-dependent similarity measure for strings”, Trans. IECE, Jpn, J-67-A, 6, pp.612–613 (1984).Google Scholar