{'fraction_non_alphanumeric': 0.012084592145015106, 'fraction_numerical': 0.0, 'mean_word_length': 5.454545454545454, '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}}
Natural language parsing: Using finite state automata

Language is a trademark for exchange of information and interface for communication between two entities namely sender and receiver. We need some processing technique to make machines interpret the meaning of input sentences. The formal process of making intelligent machine interpret the meaning and generate their answer is called Natural Language Processing. It is important to pay attention to the processing of the sentences called parsing. Parsing in natural language is defined as to analyze the input sentence in terms of grammatical constituents, identifying the parts of speech, syntactic relations and generate the possible parse trees to interpret its meaning. Automaton (plural automata) means a machine which performs the range of functions according to a predetermined set of coded instructions. This paper presents a technique of parsing sentences in English language with the application of Modular Finite State Automata.