Abstract
This paper proposes a formal model for semantic analysis of a fragment of the Hindi language. This paper uses referential noun phrases, transitive and intransitive verb phrases and logical constants to compute the meaning of its sentences generated from the Hindi part-of-speech-tagged corpus features. The paper presents cases of conjunction and negation enriched with idempotent laws that provide semantic computation of simple and complex well-formed formulas. Our system works for any model, with one such model described in our glossary. It deals with the set-theoretic study of essential syntactic categories of Hindi, suggesting the suitability of our rule-based syntactic arrangement and model-based semantic computation by implementing them through an in-house software tool.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
