Website privacy policies are too long to read and difficult to understand. The over-sophisticated language makes privacy notices to be less effective than they should be. People become even less willing to share their personal information when they perceive the privacy policy as vague. This paper focuses on decoding vagueness from a natural language processing perspective. While thoroughly identifying the vague terms and their linguistic scope remains an elusive challenge, in this work we seek to learn vector representations of words in privacy policies using deep neural networks. The vector representations are fed to an interactive visualization tool (LSTMVis) to test on their ability to discover syntactically and semantically related vague terms. The approach holds promise for modeling and understanding language vagueness.
Comprehensive studies have been missing for understanding vagueness in the natural language processing community. focus on the detection of uncertainty cues and their linguistic scope in natural language texts. The motivation behind this task is to distinguish factual and uncertain information in text, which is of essential importance to information extraction. Much of the techniques involve sentence-level classifications using SVM, CRF, and maximum entropy. However, it remains to be seen if a word- or sentence-level classification formulation is well suited for this task. @cite_4 , vagueness is considered to be a linguistic phenomenon. It arises with a lack of clear boundaries and conditions. These boundaries usually do not allow concrete distinction. Classifying text as vague or not vague can be subjective, making it important to look at agreement between interpretations and annotations. Using a naive Bayes classifier, the study shows that vague and not vague senses can be separated.
@cite_4
1250241298 1986099962 2790415926 2108498102
Uncertainty is an important linguistic phenomenon that is relevant in many fields of language processing. In its most general sense, it can be interpreted as lack of information: the hearer or the reader cannot be certain about some pieces of information. Thus, uncertain propositions are those whose truth value or reliability cannot be determined due to lack of information. Distinguishing between factual (i.e. true or false) and uncertain propositions is of primary importance both in linguistics and natural language processing applications. For instance, in information extraction an uncertain piece of information might be of some interest for an end-user as well, but such information must not be confused with factual textual evidence (reliable information) and the two should be kept separated. The main objective of this thesis is to detect uncertainty in English and Hungarian natural language texts. As opposed to earlier studies that focused on specific domains and were English-oriented, we will offer here a comprehensive approach to uncertainty detection, which can be easily adapted to the specific needs of many domains and languages. In our investigations, we will pay attention to create linguistically plausible models of uncertainty that will be exploited in creating manually annotated corpora that will serve as the base for the implementation of our uncertainty detectors for several domains, with the help of supervised machine learning techniques. Furthermore, we will also demonstrate that uncertainty detection can be fruitfully applied in a real-world application, namely, information extraction from clinical discharge summaries. Vague information is common in many database applications due to intensive data dissemination arising from different pervasive computing sources, such as the high volume data obtained from sensor networks and mobile communications. In this paper, we utilize functional dependencies (FDs) and inclusion dependencies (INDs), which are the most fundamental integrity constraints that arise in practice in relational databases, to maintain the consistency of a vague database. First, we tackle the problem, given a vague relation r and a set of FDs F, of how to obtain the ''best'' approximation of r with respect to F when taking into account the median membership (m) and the imprecision membership (i) thresholds. Using these two thresholds of a vague set, we define the notion of mi-overlap between vague sets and a merge operation on r. Second, we consider, given a vague database d and a set of INDs N, how to obtain the minimal possible change in value-precision for d. Satisfaction of an FD in r is defined in terms of values being mi-overlapping while satisfaction of an IND in d is defined in terms of value-precision. We show that Lien's and Atzeni's axiom system is sound and complete for FDs being satisfied in vague relations and that 's axiom system is sound and complete for INDs being satisfied in vague databases. Finally, we study the chase procedure VChase(d,[email protected]?N) as a means to maintain consistency of d with respect to F and N. Our main result is that the output of the procedure is the most object-precise approximation of r with respect to F and the minimum value-precision change of d with respect to N. The complexity of VChase(r,F) is polynomial time in the sizes of r and F whereas the complexity of VChase(d,[email protected]?N) is exponential. Large-scale datasets for natural language inference are created by presenting crowd workers with a sentence (premise), and asking them to generate three new sentences (hypotheses) that it entails, contradicts, or is logically neutral with respect to. We show that, in a significant portion of such data, this protocol leaves clues that make it possible to identify the label by looking only at the hypothesis, without observing the premise. Specifically, we show that a simple text categorization model can correctly classify the hypothesis alone in about 67 of SNLI (Bowman et. al, 2015) and 53 of MultiNLI (Williams et. al, 2017). Our analysis reveals that specific linguistic phenomena such as negation and vagueness are highly correlated with certain inference classes. Our findings suggest that the success of natural language inference models to date has been overestimated, and that the task remains a hard open problem. Information-hiding in natural language text has mainly consisted of carrying out approximately meaning-preserving modifications on the given cover text until it encodes the intended mark. A major technique for doing so has been synonym-substitution. In these previous schemes, synonym substitutions were done until the text "confessed", i.e., carried the intended mark message. We propose here a better way to use synonym substitution, one that is no longer entirely guided by the mark-insertion process: It is also guided by a resilience requirement, subject to a maximum allowed distortion constraint. Previous schemes for information hiding in natural language text did not use numeric quantification of the distortions introduced by transformations, they mainly used heuristic measures of quality based on conformity to a language model (and not in reference to the original cover text). When there are many alternatives to carry out a substitution on a word, we prioritize these alternatives according to a quantitative resilience criterion and use them in that order. In a nutshell, we favor the more ambiguous alternatives. In fact not only do we attempt to achieve the maximum ambiguity, but we want to simultaneously be as close as possible to the above-mentioned distortion limit, as that prevents the adversary from doing further transformations without exceeding the damage threshold; that is, we continue to modify the document even after the text has "confessed" to the mark, for the dual purpose of maximizing ambiguity while deliberately getting as close as possible to the distortion limit. The quantification we use makes possible an application of the existing information-theoretic framework, to the natural language domain, which has unique challenges not present in the image or audio domains. The resilience stems from both (i) the fact that the adversary does not know where the changes were made, and (ii) the fact that automated disambiguation is a major difficulty faced by any natural language processing system (what is bad news for the natural language processing area, is good news for our scheme's resilience). In addition to the above mentioned design and analysis, another contribution of this paper is the description of the implementation of the scheme and of the experimental data obtained.