International Journal of Computer Theory and Engineering

Editor-In-Chief: Prof. Mehmet Sahinoglu
Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
E-mail:editor@ijcte.org
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

Home > Articles > Archive > 2009 > Volume 1, Number 3 (Aug. 2009) >
IJIET 2009 Vol.1(3): 288-292
doi: 10.7763/IJCTE.2009.V1.47

Solving the Noun Phrase and Verb Phrase Agreement in Kannada Sentences

B. M. Sagar1 , Shobha G , Ramakanth Kumar P.1

  • 1Department, R.V. College of Engineering, Mysore Road, Bangalore - 560059.

Abstract

This paper proposes a way of producing context free grammar for solving Noun and Verb agreement in Kannada Sentences. In most of the Indian languages including Kannada a verb ends with a token which indicates the gender of the person (Noun/ Pronoun). This paper shows the implementation of this agreement using Context Free Grammar. It uses Recursive Descent Parser to parse the CFG. Around 200 sample sentences have taken to test the agreement.

Keywords

  • Context Free Grammar
  • Noun Phrase
  • Verb Phrase
  • Recursive Descent Parser
047

How to Cite

Copied

B. M. Sagar, Shobha G, and Ramakanth Kumar P., "Solving the Noun Phrase and Verb Phrase Agreement in Kannada Sentences," International Journal of Computer Theory and Engineering, vol. 1, no. 3, pp. 288-292, 2009. https://doi.org/10.7763/IJCTE.2009.V1.47

Copyright & License

Copyright © 2009 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

PREVIOUS PAPER: A New Generation Cryptographic Technique NEXT PAPER: Evaluating the Effects of Cryptography Algorithms on Power Consumption for Wireless Devices
Menu