{'fraction_non_alphanumeric': 0.02106149957877001, 'fraction_numerical': 0.018534119629317607, 'mean_word_length': 5.319148936170213, '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}}
Research on the CRF-based Sequence Labeling Algorithm Used in Reference Resolution of Mathematical Word Problem Understanding

Resolving the reference phenomenon in application problems is a key step to realize the understanding of mathematical problems. Compared with the Chinese corpus in the general field, this study analyzed the characteristics of reference resolution in mathematical stratified sampling word problems, and explored key factors by combining the C4.5 decision tree algorithm. On this basis, the study proposed a CRF-based sequence labeling algorithm, which was exploited to identify the to-be-solved items of the stratified sampling problem and resolved them. The experimental data is the stratified sampling word problems collected from the math problems in the Chinese college entrance examination and the test problems in the textbook from 2012 to 2020. The results show that the F-values for the antecedents and anaphors of the mathematical stratified sampling word problems based on CRF sequence labeling can reach 81.29% and 90.69%, respectively, and the F-values for reference resolution can reach 84.84%, which is higher than the traditional Bayesian method.