{'fraction_non_alphanumeric': 0.020588235294117647, 'fraction_numerical': 0.0, 'mean_word_length': 5.080357142857143, '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}}
A Predictive Left-Corner Parser for Tree Adjoining Grammars

Tree Adjoining Grammar (TAG) is a formalism that has become very popular for the description of natural languages. However, the parsers for TAG that have been defined on the basis of the Earley’s algorithm entail important computational costs. In this article, we propose to extend the left corner relation from Context Free Grammar (CFG) to TAG in order to define an efficient left corner parser for TAG that improves the performance of the Earley-like parsers guaranteeing the valid prefix property, due to a remarkable reduction in the number of predictions operations with respect to Earley-like parsing algorithms.