Skip to main content
SpringerLink
Log in
Book cover

Syntactic and Structural Pattern Recognition pp 19–32Cite as

An Error-Correcting Parser for a Context-Free Language Based on the Context-Dependent Similarity

  • Conference paper

  • 69 Accesses

Part of the book series: NATO ASI Series ((NATO ASI F,volume 45))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  2. Aho, A.V. and Peterson, T.G.: “A minimum distance error-correcting parser for context-free languages”, SIAM J. Comput., 1, pp.305–312 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  3. Earley, J.:“An efficient context-free parsing algorithm”, CACM, 13, pp.94–102 (1970).

    MATH  Google Scholar 

  4. Lyon, G.:“Syntax-directed least-errors analysis for context-free languages; A practical approach”, Comm. ACM, 17, pp.3–14(1974)

    Article  MATH  Google Scholar 

  5. Fung, L.W. and Fu, K.S.: “Maximum-likelihood syntactic decoding”, IEEE Trans. Inf. Theory, IT-21, pp.423–430(1975).

    Article  MathSciNet  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 

  9. Graham, S.L., Harrison, M.A. and Ruzzo, W.L.:“An improved contextfree recognizer”, ACM Trans. Program. Lang. Syst., 2, pp.415–462(1980).

    Article  MATH  Google Scholar 

  10. Levenshtein, B.I.: “Binary codes with correction of deletion, insertion and substitution of symbols”, Dokl. Acak. Nauk. SSSR, l63, pp.845–848(1965).

    MathSciNet  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. Okuda, T., Tanaka, E. and Kasai, T.: “A method for the correction of garbled words based on Levenshtein metric”, Trans. Comput., C-25, 20, pp.172–178 (1976).

    Article  MathSciNet  Google Scholar 

  13. Tanaka, E.: “A context-dependent similarity measure for strings”, Trans. IECE, Jpn, J-67-A, 6, pp.612–613 (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Ins. of Sci. and Ind. Res., Osaka Univ., Ibaraki-Shi, 565, Japan

    M. Ikeda & O. Kasusho

  2. Fac. of Engineering, Utsunomiya Univ., Utsunomiya-Shi, 321, Japan

    E. Tanaka

Authors
  1. M. Ikeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. O. Kasusho
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto de Cibernética, Diagonal, 647, 2.a planta, E-08028, Barcelona, Spain

    Gabriel Ferraté

  2. Department of Electrical Engineering, SUNY, Stony Brook, NY, 11794, USA

    Theo Pavlidis

  3. Instituto de Cibernética, Diagonal, 647, 2.a planta, E-08028, Barcelona, Spain

    Alberto Sanfeliu

  4. Institut für Informatik und angewandte Mathematik, Universität Bern, Länggassstrasse 51, CH-3012, Bern, Switzerland

    Horst Bunke

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ikeda, M., Tanaka, E., Kasusho, O. (1988). An Error-Correcting Parser for a Context-Free Language Based on the Context-Dependent Similarity. In: Ferraté, G., Pavlidis, T., Sanfeliu, A., Bunke, H. (eds) Syntactic and Structural Pattern Recognition. NATO ASI Series, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83462-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83462-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83464-6

  • Online ISBN: 978-3-642-83462-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation