Akshar Bharati

Also published as: Akshar Bharathi


2015

pdf bib
Applying Sanskrit Concepts for Reordering in MT
Akshar Bharati | Sukhada | Prajna Jha | Soma Paul | Dipti M Sharma
Proceedings of the 12th International Conference on Natural Language Processing

2014

pdf bib
Translation of TO infinitives in Anusaaraka Platform: an English Hindi MT system
Akshar Bharati | Sukhada | Soma Paul
Proceedings of the 11th International Conference on Natural Language Processing

pdf bib
SSF: A Common Representation Scheme for Language Analysis for Language Technology Infrastructure Development
Akshar Bharati | Rajeev Sangal | Dipti Misra Sharma | Anil Kumar Singh
Proceedings of the Workshop on Open Infrastructures and Analysis Frameworks for HLT

2010

pdf bib
Grammar Extraction from Treebanks for Hindi and Telugu
Prasanth Kolachina | Sudheer Kolachina | Anil Kumar Singh | Samar Husain | Viswanath Naidu | Rajeev Sangal | Akshar Bharati
Proceedings of the Seventh International Conference on Language Resources and Evaluation (LREC'10)

Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has several limitations. With the availability of large scale syntactically annotated treebanks, it is now possible to automatically extract an approximate grammar of a language in any of the existing formalisms from a corresponding treebank. In this paper, we present a basic approach to extract grammars from dependency treebanks of two Indian languages, Hindi and Telugu. The process of grammar extraction requires a generalization mechanism. Towards this end, we explore an approach which relies on generalization of argument structure over the verbs based on their syntactic similarity. Such a generalization counters the effect of data sparseness in the treebanks. A grammar extracted using this system can not only expand already existing knowledge bases for NLP tasks such as parsing, but also aid in the creation of grammars for languages where none exist. Further, we show that the grammar extraction process can help in identifying annotation errors and thus aid in the task of the treebank validation.

2009

pdf bib
Simple Parser for Indian Languages in a Dependency Framework
Akshar Bharati | Mridul Gupta | Vineet Yadav | Karthik Gali | Dipti Misra Sharma
Proceedings of the Third Linguistic Annotation Workshop (LAW III)

pdf bib
Two stage constraint based hybrid approach to free word order language dependency parsing
Akshar Bharati | Samar Husain | Dipti Misra | Rajeev Sangal
Proceedings of the 11th International Conference on Parsing Technologies (IWPT’09)

pdf bib
Insights into Non-projectivity in Hindi
Prashanth Mannem | Himani Chaudhry | Akshar Bharati
Proceedings of the ACL-IJCNLP 2009 Student Research Workshop

pdf bib
Constraint Based Hybrid Approach to Parsing Indian Languages
Akshar Bharati | Samar Husain | Meher Vijay | Kalyan Deepak | Dipti Misra Sharma | Rajeev Sangal
Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation, Volume 2

2005

pdf bib
Inferring Semantic Roles Using Sub-Categorization Frames and Maximum Entropy Model
Akshar Bharati | Sriram Venkatapathy | Prashanth Reddy
Proceedings of the Ninth Conference on Computational Natural Language Learning (CoNLL-2005)

pdf bib
A Hybrid Approach to Single and Multiple PP Attachment Using WordNet
Akshar Bharathi | U. Rohini | P. Vishnu | S.M. Bendre | Rajeev Sangal
Second International Joint Conference on Natural Language Processing: Full Papers

2002

pdf bib
AnnCorra: Building Tree-banks in Indian Languages
Akshar Bharati | Rajeev Sangal | Vineet Chaitanya | Amba Kulkarni | Dipti Misra Sharma | K.V. Ramakrishnamacharyulu
COLING-02: The 3rd Workshop on Asian Language Resources and International Standardization

2000

pdf bib
Panel: Computational Linguistics in India: An Overview
Akshar Bharati | Vineet Chaitanya | Rajeev Sangal
Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics

1993

pdf bib
Parsing Free Word Order Languages in the Paninian Framework
Akshar Bharati | Rajeev Sangal
31st Annual Meeting of the Association for Computational Linguistics

1990

pdf bib
A Karaka Based Approach to Parsing of Indian Languages
Akshar Bharati | Rajeev Sangal
COLING 1990 Volume 3: Papers presented to the 13th International Conference on Computational Linguistics