{'fraction_non_alphanumeric': 0.02414113277623027, 'fraction_numerical': 0.002785515320334262, 'mean_word_length': 5.455089820359281, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Resolving issues in parsing technique in machine translation from hindi language to english language

This paper describes the development of parser algorithm which is used for Hindi-English machine translation (MT). Machine translation requires analysis, transfer and generation steps to produce target language output from a source language input. Structural representation of Hindi sentences codes the information of Hindi sentences and a transfer module can be designed to generate English sentences using Context Free Grammar (CFG). Context Free Grammar Parsing technique is a tool in which (CKY) Coke-Kasami-Younger algorithms are used to analyze the structure of the sentence when user input the Hindi text in Unicode format it verifies the Hindi text according to the correct grammar. Coke-Kasami-Younger algorithms produce better result 91.4% by enhancing the grammatical rule in databases and resolving issues in parsing the sentence according to the grammatical structure like root form of the word, category, masculine/feminine/neuter, oblique, direct case, suffix.