Skip to main content
SpringerLink
Log in

Probabilistic Conjunctive Grammar

  • Conference paper
  • First Online:
Theoretical Computer Science and Discrete Mathematics (ICTCSDM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10398))

Abstract

This paper extends conjunctive grammar to Probabilistic Conjunctive Grammar (PCG). This extension is motivated by the concept of probabilistic context free grammar which has many applications in the area of computational linguistics, computer science and bio-informatics. Our focus is to develop PCG for its application in linguistics and computer science. In bio-informatics stochastic conjunctive grammar has been defined to detect Pseudo knots in RNA.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Okhotin, A.: Conjunctive grammars. J. Automata Lang. Comb. 6(4), 519–535 (2001)

    MATH  MathSciNet  Google Scholar 

  2. Jelinek, F., Lafferty, J.D., Mercer, R.L.: Basic Methods of Probabilistic Context Free Grammars. Speech Recognition and Understanding. Springer, Heidelberg (1992)

    Book  Google Scholar 

  3. Lari, K., Young, S.J.: The estimation of stochastic context-free grammars using the inside-outside algorithm. Comput. Speech Lang. 4(1), 35–56 (1990)

    Article  Google Scholar 

  4. Eddy, S.R., Durbin, R.: RNA sequence analysis using covariance models. Nucleic Acids Res. 22(11), 2079–2088 (1994)

    Article  Google Scholar 

  5. Sakakibara, Y., Brown, M., Hughey, R., Mian, I.S., Sjölander, K., Underwood, R.C., Haussler, D.: Stochastic context-free grammers for tRNA modeling. Nucleic Acids Res. 22(23), 5112–5120 (1994)

    Article  Google Scholar 

  6. Sakakibara, Y., Brown, M., Hughey, R., Mian, I.S.: The application of Stochastic Context-free Grammars to Folding, Aligning and Modeling Homologous RNA Sequences, Report, UC Santa Cruz (1993)

    Google Scholar 

  7. Weir, M., Aggarwal, S., De Medeiros, B., Glodek, B.: Password cracking using probabilistic context-free grammars. In: 30th IEEE Symposium on Security and Privacy, pp. 391–405. IEEE (2009)

    Google Scholar 

  8. Ma, J., Yang, W., Luo, M., Li, N.: A study of probabilistic password models. In: IEEE Symposium on Security and Privacy, pp. 689–704. IEEE (2014)

    Google Scholar 

  9. Bahl, L.R., Jelinek, F., Mercer, R.L.: A maximum likelihood approach to continuous speech recognition. IEEE Trans. Pattern Anal. Mach. Intell. 2, 179–190 (1983)

    Article  Google Scholar 

  10. Lari, K., Young, S.J.: Applications of stochastic context-free grammars using the inside-outside algorithm. Comput. Speech Lang. 5(3), 237–257 (1991)

    Article  Google Scholar 

  11. Zier-Vogel, R., Domaratzki, M.: RNA pseudoknot prediction through stochastic conjunctive grammars. In: Informal Proceedings of the Computability in Europe 2013, pp. 80–89 (2013)

    Google Scholar 

  12. Booth, T.L., Thompson, R.A.: Applying probability measures to abstract languages. IEEE Trans. Comput. 100(5), 442–450 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  13. Baker, J.K.: Trainable grammars for speech recognition. J. Acoust. Soc. Am. 65(S1), S132 (1979)

    Article  MathSciNet  Google Scholar 

  14. Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley Publishing, Reading (1969)

    MATH  Google Scholar 

  15. Fuf, K.S.: Stochastic automata, stochastic languages and pattern recognition. J. Cybern. 1(3), 31–49 (1971)

    Article  Google Scholar 

Download references

Acknowledgements

The first author is thankful to the management of Kalasalingam University for providing fellowship.

Author information

Authors and Affiliations

  1. National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Krishnankoil, 626126, Tamil Nadu, India

    K. Kanchan Devi & S. Arumugam

Authors
  1. K. Kanchan Devi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Arumugam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Kanchan Devi .

Editor information

Editors and Affiliations

  1. Kalasalingam University, Krishnankoil, India

    S. Arumugam

  2. Ball State University, Muncie, Indiana, USA

    Jay Bagga

  3. Indiana University – Purdue University, Fort Wayne, Indiana, USA

    Lowell W. Beineke

  4. Indian Institute of Technology, New Delhi, India

    B.S. Panda

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kanchan Devi, K., Arumugam, S. (2017). Probabilistic Conjunctive Grammar. In: Arumugam, S., Bagga, J., Beineke, L., Panda, B. (eds) Theoretical Computer Science and Discrete Mathematics. ICTCSDM 2016. Lecture Notes in Computer Science(), vol 10398. Springer, Cham. https://doi.org/10.1007/978-3-319-64419-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64419-6_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64418-9

  • Online ISBN: 978-3-319-64419-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation