A Parsing Algorithm for Weighted Grammars and Substring Recognition

  • F. Casacuberta
  • E. Vidal
Conference paper
Part of the NATO ASI Series book series (volume 45)


In Syntactic Pattern Recognition, the weighted grammars are very useful in the representation of the inexact nature of many problems. Basically, such grammars are defined as a conventional grammar and a function from the set of rules into some weighting space. Some algorithms are used for particular grammars and particular spaces. In this paper, a general parsing algorithm for weighted context-free grammars is presented. This algorithm parses a given string and supplies the corresponding weight. An extension of this algorithm whose main goal is to achieve, in parallel with the parsing, a segmentation of the input string into substrings which are recognized by the weighted grammars used is also presented.


Weighting Space Automatic Speech Recognition Substring Recognition Terminal Symbol Parsing Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (AHO,72a).
    A.V. Aho and J.D. Ullman: “The Theory of Parsing, Translation and Compiling”. Vol.1. Prentice-Hall. Englewood Cliffs.Google Scholar
  2. (AHO,72b).
    A.V. Aho and T.G. Peterson: “A Minimum Distance Error-Correcting Parse for Context-Free Languages”. SIAM J.Comput. Vol.1 No.4.Google Scholar
  3. (CASACUBERTA, 86a).
    F.Casacuberta, E.Vidal, J.M.Benedí: “Interpretation of Fuzzy Data by means of Fuzzy Rules with Applications to Speech Recognition”. To be published in International J. on FUZZY Sets and Systems.Google Scholar
  4. (CASACUBERTA, 86b).
    F.Casacuberta, E.Vidal: “Reconocimiento Automático del Habla”. In press. Marcombo. Barcelona.Google Scholar
  5. (CASACUBERTA, 86c).
    F.Casacuberta: “Some Preliminary Notes about Languages, Grammars and Automata of Fuzzy Symbols”, Internal Report.Google Scholar
  6. (CHIANG, 84).
    Y.T. Chiang and K.S. Fu: “Parallel Parsing Algorithm and VLSI Implementations for Syntactic Patterns Recognition”: IEEE Trans. Pattern. Anal, and Mach. Intell. Vol. PAMI-6, No.3 pp. 302–312.Google Scholar
  7. (DON, 85).
    H.D. Don and K.S. Fu: “A Syntactic Method for Image Segmentation and Object Recognition”. Pattern Recognition. Vol.18, No.1 pp. 73–87.Google Scholar
  8. (FILIPSKI, 80).
    A.J. Filipski: “A least Mean-Squared Error Approach to Syntactic Classification”. IEEE Trans. Pattern Anal, and Machine Intel., Vol. PAMI-2, No. 3, pp. 252–255.Google Scholar
  9. (FU, 82).
    K.S. Fu: “Syntactic Pattern Recognition and Applications”: Prentice-Hall, Englewood Cliffs.Google Scholar
  10. (GIORDANA, 85).
    A. Giordana and L. Saitta: “A non-left-to-right, non-directional Parser for Ambiguous Lattices”. Pattern Recognition Letters Vol.3, No.2 pp.105–111.Google Scholar
  11. (GRAHAM,80).
    S.L. Graham, M.A. Harrison and W.L. Ruzzo: “An Improved Context-Free Recognizer”: ACM Trans, on Program. Lang, and Systems. Vol. 2, No.3, PP 415–462.Google Scholar
  12. (KIM, 75).
    H.H. Kim, M. Mizumoto, J. Toyoda and K. Tanaka: “L-Fuzzy Grammars”. Information Sciences. Vol. 8, pp. 123–140.Google Scholar
  13. (MIZUMOTO, 75).
    M. Mizumoto, J. Toyoda, K. Tanaka: “Various kinds of Automata with Weights”. J. of Comp. and Syst. Sci. Vol. 10, pp. 219–236.Google Scholar
  14. (TANAKA, 78).
    E. Tanaka and K.S. Fu: “Error-Correcting Parsers for Formal Languages”: IEEE Trans, on Comp. Vol.C-27, No.7, pp 605–616.Google Scholar
  15. (VALIANT, 75).
    L.G. Valiant: “General Context-Free Recognition in Less than Cubic Time”: J. of Comp. and Sys. Sci. Vol.10, pp 308–315.Google Scholar
  16. (VIDAL, 85).
    E. Vidal, F. Casacuberta, E. Sanchís, J.M. Benedí: “A General Fuzzy-Parsing Scheme for Speech Recognition”. In “New Systems and Architectures for Automatic Speech Recognition and Synthesis”. Eds.: R. deMori and C.Y. Suen. Springer-Verlag.Google Scholar
  17. (WETHERELL, 80).
    G.S. Wetherell: “Probabilistic Languages: A Review and Some Open Questions”. Comp. Surveys. Vol. 12, No. 4, pp. 361–379.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • F. Casacuberta
    • 1
  • E. Vidal
    • 1
  1. 1.Dept. Sistemas Informaticos y ComputacionUniv. Politecnica de ValenciaValenciaSpain

Personalised recommendations