An official website of the United States government
The linguistic notion of formality is one dimension of stylistic variation in human communication. A universal characteristic of language production, formality has surface-level realizations in written and spoken language. In this work, we explore ways of measuring the formality of such realizations in multilingual speech corpora across a wide range of domains. We compare measures of formality, contrasting textual and acoustic-prosodic metrics. We believe that a combination of these should correlate well with downstream applications. Our findings include: an indication that certain prosodic variables might play a stronger role than others; no correlation between prosodic and textual measures; limited evidence for anticipated inter-domain trends, but some evidence of consistency of measures between languages. We conclude that non-lexical indicators of formality in speech may be more subtle than our initial expectations, motivating further work on reliably encoding spoken formality.
more »
« less
Some remarks about deformation theory and formality conjecture
Abstract Using the algebraic criterion proved by Bandiera, Manetti and Meazzini, we show the formality conjecture for universally gluable objects with linearly reductive automorphism groups in the bounded derived category of a K3 surface. As an application, we prove the formality conjecture for polystable objects in the Kuznetsov components of Gushel–Mukai threefolds and quartic double solids.
more »
« less
- PAR ID:
- 10490816
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- ANNALI DELL'UNIVERSITA' DI FERRARA
- Volume:
- 70
- Issue:
- 3
- ISSN:
- 0430-3202
- Format(s):
- Medium: X Size: p. 761-779
- Size(s):
- p. 761-779
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Strong end-user security practices benefit both the user and hosting platform, but it is not well understood how companies communicate with their users to encourage these practices. This paper explores whether web companies and their platforms use different levels of language formality in these communications and tests the hypothesis that higher language formality leads to users’ increased intention to comply. We contribute a dataset and systematic analysis of 1,817 English language strings in web security and privacy interfaces across 13 web platforms, showing strong variations in language. An online study with 512 participants further demonstrated that people perceive differences in the language formality across platforms and that a higher language formality is associated with higher self-reported intention to comply. Our findings suggest that formality can be an important factor in designing effective security and privacy prompts. We discuss implications of these results, including how to balance formality with platform language style. In addition to being the first piece of work to analyze language formality in user security, these findings provide valuable insights into how platforms can best communicate with users about account security.more » « less
-
Abstract We study tight projective 2‐designs in three different settings. In the complex setting, Zauner's conjecture predicts the existence of a tight projective 2‐design in every dimension. Pandey, Paulsen, Prakash, and Rahaman recently proposed an approach to make quantitative progress on this conjecture in terms of the entanglement breaking rank of a certain quantum channel. We show that this quantity is equal to the size of the smallest weighted projective 2‐design. Next, in the finite field setting, we introduce a notion of projective 2‐designs, we characterize when such projective 2‐designs are tight, and we provide a construction of such objects. Finally, in the quaternionic setting, we show that every tight projective 2‐design for determines an equi‐isoclinic tight fusion frame of subspaces of of dimension 3.more » « less
-
Abstract A conjecture of Milena Mihail and Umesh Vazirani (Proc. 24th Annu. ACM Symp. Theory Comput., ACM, Victoria, BC, 1992, pp. 26–38.) states that the edge expansion of the graph of every polytope is at least one. Any lower bound on the edge expansion gives an upper bound for the mixing time of a random walk on the graph of the polytope. Such random walks are important because they can be used to generate an element from a set of combinatorial objects uniformly at random. A weaker form of the conjecture of Mihail and Vazirani says that the edge expansion of the graph of a polytope in is greater than one over some polynomial function of . This weaker version of the conjecture would suffice for all applications. Our main result is that the edge expansion of the graph of arandompolytope in is at least with high probability.more » « less
-
We formulate a version of the integral Hodge conjecture for categories, prove the conjecture for two-dimensional Calabi–Yau categories which are suitably deformation equivalent to the derived category of a K3 or abelian surface, and use this to deduce cases of the usual integral Hodge conjecture for varieties. Along the way, we prove a version of the variational integral Hodge conjecture for families of two-dimensional Calabi–Yau categories, as well as a general smoothness result for relative moduli spaces of objects in such families. Our machinery also has applications to the structure of intermediate Jacobians, such as a criterion in terms of derived categories for when they split as a sum of Jacobians of curves.more » « less
