File model approach to optimize the performance of Tree Adjoining Grammar based Machine Translation

The growing pace of information technology demands fast operation for communication and other related applications. After having a successful Machine Translation System [MTS], it has been felt to optimize the performance of Machine Translation for its real-time uses. The considered MTS is Tree Adjoining Grammar [TAG] based system. An approach has been experimented to use File model instead of Database model for fast streaming of grammar into memory and operation. This model provides an efficient and a systematic way of encapsulating language resource with engineering solution to develop the speedy MTS. The computational experiments demonstrate that substantial performance in terms of time and memory has been obtained by using this approach.

[1]  Virendrakumar C. Bhavsar,et al.  High performance natural language processing services on the GARUDA grid , 2013, 2013 National Conference on Parallel Computing Technologies (PARCOMPTECH).

[2]  Virendrakumar C. Bhavsar,et al.  Translation Memory for a Machine Translation System Using the Hadoop Framework , 2014, 2014 Fourth International Conference on Advances in Computing and Communications.

[3]  Aravind K. Joshi,et al.  Mathematical and computational aspects of lexicalized grammars , 1990 .

[4]  Virendrakumar C. Bhavsar,et al.  Parallel implementation of machine translation using MPJ Express , 2013, 2013 National Conference on Parallel Computing Technologies (PARCOMPTECH).

[5]  Jimmy J. Lin,et al.  Exploring Large-Data Issues in the Curriculum: A Case Study with MapReduce , 2008 .

[6]  Robert L. Mercer,et al.  The Mathematics of Statistical Machine Translation: Parameter Estimation , 1993, CL.

[7]  K. Vijay-Shanker,et al.  Deterministic Left to Right Parsing of Tree Adjoining Languages , 1990, ACL.

[8]  K. Vijay-Shanker,et al.  Using Descriptions of Trees in a Tree Adjoining Grammar , 1992, Comput. Linguistics.

[9]  Chung-Hsing Yeh,et al.  Discovering Parallel Text from the World Wide Web , 2004, ACSW.

[10]  Hermann Ney,et al.  Discriminative Training and Maximum Entropy Models for Statistical Machine Translation , 2002, ACL.

[11]  M. N. Faruqui,et al.  Dynamic load balancing algorithm in a distributed system , 1991 .

[12]  Luiz André Barroso,et al.  Web Search for a Planet: The Google Cluster Architecture , 2003, IEEE Micro.

[13]  Aravind K. Joshi,et al.  Lr parsing for tree adjoining grammars and its application to corpus-based natural language parsing , 2003 .

[14]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[15]  Jimmy J. Lin,et al.  Fast, Easy, and Cheap: Construction of Statistical Machine Translation Models with MapReduce , 2008, WMT@ACL.

[16]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[17]  Andreas Zollmann,et al.  Grammar based statistical MT on Hadoop: An end-to-end toolkit for large scale PSCFG based MT , 2009, Prague Bull. Math. Linguistics.