NLP : Context Free Grammars and Parse Trees for Disambiguiting Telugu Language Sentences

Authors

  • Jinka Sreedhar  Department of Computer Science and Engineering, Gokaraju Rangaraju Institute of Engineering and Technoloy, Hyderabad, India
  • Dr. Sk Althaf Hussain Basha  Professor and Vice Principal, Department of Computer Science and Engineering, A1GIET, Markapur, Andhra Pradesh, India
  • D. Praveen Kumar  Department of Computer Science and Engineering Indian Institute of Technology, Dhanbad, Jharkhand, India
  • A. Jagan  Department of Computer Science and Engineering, B.V.Raju Institute of Technology, Narsapur, Telangana, India
  • Baijnath Kaushik  Department of Computer Science and Engineering, Shri Mata Vaishno Devi University, Katra, Jammu and Kashmir, India

Keywords:

CFG, Parse Trees, Derivations, Telugu Corpus

Abstract

Several studies have explained the benefits of using Context Free Grammars(CFGs) of derivations and Parse Trees to reduce the ambiguity in Natural Language Sentences. However, these benefits are dependent on the CFG Rules and Derivation steps. This research paper explains the power of CFGs and Parse Trees for construction of a Telugu Language Sentences. Based on the CFG here we derived the derivations for the respective strings. Later we constructed the Parser Trees for the above said strings. Finally we analysed whether the string is ambiguous or unambiguous. Here we considered the Large Scale Open Source Telugu carpus for analysis.

References

  1. Aho, A.V., and Johnson, S. C. 1974]. "LR parsing," Computing Surveys 6:2, 99-124.
  2. Aho, A.V., and Johnson, S. C. , and Ullman, J. D. 1975]. "Deterministic parsing of ambiguous grammars," Comm. ACM 18:8, 441-452.
  3. Aho, A.V., and Peterson, T.G, 1972]. "A minimum distance error correcting parser for context-free languages," SIAM J. Computing 1:4, 305-312.
  4. Aho, A.V., and Ullman, J. D. 1972b]. The Theory of Parsing Translation and Compiling, Vol. I:Parsing, Prentice-Hall, Englewood Cliffs, N. J.
  5. Aho, A.V., and Ullman, J. D. 1972c]. "Optimization of LR(k) parsers," J. Computer and systems Sciences 6:6, 573-602.
  6. Aho, A.V., and Ullman, J. D. 1972a]. The Theory of Parsing, Translation and Compiling, Vol. II: Compiling, Prentice- Hall, Englewood Cliffs, N. J.
  7. Aho, A.V., and Ullman, J. D. 1972b]. " A technique for speeding up LR(k) parsers." SIAM J. Computing 2:2, 106-127.
  8. Anderson, J. P. 1964]. "A note on some compiling algorithms," comn. ACM 7:3, 149-153.
  9. Anderson, T., Eve, J., and Horning, J. J.1973]. " Efficient LR(1) paresers," Acta Informatica 2:1, 12-39.
  10. Backhouse, R.C. 1976]. "An alternative approach to the improvement of LR parsers," Acta Informatica 6:3, 277-296.
  11. Bar Hillel, Y., Perles, M., and Shamir, E. 1961]. "On formal properties of simple phrase structure grammers," Z. Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, pp. 143-172.
  12. Barnard, D. T. 1975]. "A survey of syntax error handling techniques," Computer Science Reaserch Group, Univ. of Toronto, Toronto, Ont., Canada.
  13. Birman, A., and Ullman, J.D. 1973]. "Parsing algorithms with backtrack," Information and Control 23:1, 1-34.
  14. Bochmann, G. V. 1976]. "Semantic evaluation from left to right," Comm. ACM 19:2, 55-62.
  15. Brzozowiski, J. A. 1964]. "Derivatives of regular expressions," J. ACM 11:4, 481-488.
  16. Cheatham, T. E. Jr., and Sattley, K. 1964]. "Syntax directed compiling," Proc. AFIPS 1964 Spring Joint Computer Conf. Spartan Books, Baltimore Md., 31-57.
  17. Chomsky, N. 1959]. "On Certain formal properties of grammers," Information and Control 2:2, 137-167.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-09-30

Issue

Volume 2, Issue 7, September-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Jinka Sreedhar, Dr. Sk Althaf Hussain Basha, D. Praveen Kumar, A. Jagan, Baijnath Kaushik, " NLP : Context Free Grammars and Parse Trees for Disambiguiting Telugu Language Sentences, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 7, pp.332-337, September-2017.