negator
A RoBERTa-Based Functional Syntax Annotation Model for Chinese Texts
Xiaohui, Han, Yunlong, Zhang, Yuxi, Guo
Systemic Functional Grammar and its branch, Cardiff Grammar, have been widely applied to discourse analysis, semantic function research, and other tasks across various languages and texts. However, an automatic annotation system based on this theory for Chinese texts has not yet been developed, which significantly constrains the application and promotion of relevant theories. To fill this gap, this research introduces a functional syntax annotation model for Chinese based on RoBERTa (Robustly Optimized BERT Pretraining Approach). The study randomly selected 4,100 sentences from the People's Daily 2014 corpus and annotated them according to functional syntax theory to establish a dataset for training. The study then fine-tuned the RoBERTa-Chinese wwm-ext model based on the dataset to implement the named entity recognition task, achieving an F1 score of 0.852 on the test set that significantly outperforms other comparative models. The model demonstrated excellent performance in identifying core syntactic elements such as Subject (S), Main Verb (M), and Complement (C). Nevertheless, there remains room for improvement in recognizing entities with imbalanced label samples. As the first integration of functional syntax with attention-based NLP models, this research provides a new method for automated Chinese functional syntax analysis and lays a solid foundation for subsequent studies.
This is not correct! Negation-aware Evaluation of Language Generation Systems
Anschütz, Miriam, Lozano, Diego Miguel, Groh, Georg
Large language models underestimate the impact of negations on how much they change the meaning of a sentence. Therefore, learned evaluation metrics based on these models are insensitive to negations. In this paper, we propose NegBLEURT, a negation-aware version of the BLEURT evaluation metric. For that, we designed a rule-based sentence negation tool and used it to create the CANNOT negation evaluation dataset. Based on this dataset, we fine-tuned a sentence transformer and an evaluation metric to improve their negation sensitivity. Evaluating these models on existing benchmarks shows that our fine-tuned models outperform existing metrics on the negated sentences by far while preserving their base models' performances on other perturbations.
Contracting and Involutive Negations of Probability Distributions
A dozen papers have considered the concept of negation of probability distributions (pd) introduced by Yager. Usually, such negations are generated point-by-point by functions defined on a set of probability values and called here negators. Recently it was shown that Yager's negator plays a crucial role in the definition of pd-independent linear negators: any linear negator is a function of Yager's negator. Here, we prove that the sequence of multiple negations of pd generated by a linear negator converges to the uniform distribution with maximal entropy. We show that any pd-independent negator is non-involutive, and any nontrivial linear negator is strictly contracting. Finally, we introduce an involutive negator in the class of pddependent negators that generates an involutive negation of probability distributions. Keywords: Probability distribution, contracting negation, involutive negation 1. Introduction The concept of the negation of a probability distribution (pd) was introduced by Yager [1].
Generating Negations of Probability Distributions
Batyrshin, Ildar, Villa-Vargas, Luis Alfonso, Ramirez-Salinas, Marco Antonio, Salinas-Rosales, Moises, Kubysheva, Nailya
Recently it was introduced a negation of a probability distribution. The need for such negation arises when a knowledge-based system can use the terms like NOT HIGH, where HIGH is represented by a probability distribution (pd). For example, HIGH PROFIT or HIGH PRICE can be considered. The application of this negation in Dempster-Shafer theory was considered in many works. Although several negations of probability distributions have been proposed, it was not clear how to construct other negation. In this paper, we consider negations of probability distributions as point-by-point transformations of pd using decreasing functions defined on [0,1] called negators. We propose the general method of generation of negators and corresponding negations of pd, and study their properties. We give a characterization of linear negators as a convex combination of Yager's and uniform negators. Keywords: Probability distribution, Negation, Dempster-Shafer theory 1. Introduction The concept of negation of probability distribution (pd) was recently introduced by Yager [18].