English
Related papers

Related papers: An Observation About Passphrases: Syntax vs Entrop…

200 papers

Many types of distributional word embeddings (weakly) encode linguistic regularities as directions (the difference between "jump" and "jumped" will be in a similar direction to that of "walk" and "walked," and so on). Several attempts have…

Computation and Language · Computer Science 2021-02-24 Louis Fournier , Ewan Dunbar

Structured language models for speech recognition have been shown to remedy the weaknesses of n-gram models. All current structured language models are, however, limited in that they do not take into account dependencies between…

Computation and Language · Computer Science 2007-05-23 Rens Bod

Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of…

Logic in Computer Science · Computer Science 2018-11-16 Andrei Arusoaie , Dorel Lucanu

The logical connectivity of text is represented by the connectivity of words that form archipelagoes. Here, each archipelago is a sequence of islands of the occurrences of a certain word. An island here means the local sequence of sentences…

Computation and Language · Computer Science 2024-10-01 Yukio Ohsawa

There are different ways of measuring diversity in complex systems. In particular, in language, lexical diversity is characterized in terms of the type-token ratio and the word entropy. We here investigate both diversity metrics in six…

Computation and Language · Computer Science 2025-07-16 Pablo Rosillo-Rodes , Maxi San Miguel , David Sanchez

How hard is it guess a password? Massey showed that that the Shannon entropy of the distribution from which the password is selected is a lower bound on the expected number of guesses, but one which is not tight in general. In a series of…

Information Theory · Computer Science 2013-02-12 Mark M. Christiansen , Ken R. Duffy

We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot…

Cryptography and Security · Computer Science 2021-12-21 Boris Ryabko

Paraphrasing methods recognize, generate, or extract phrases, sentences, or longer natural language expressions that convey almost the same information. Textual entailment methods, on the other hand, recognize, generate, or extract pairs of…

Computation and Language · Computer Science 2010-06-01 Ion Androutsopoulos , Prodromos Malakasiotis

Even though passwords are the most convenient means of authentication, they bring along themselves the threat of dictionary attacks. Dictionary attacks may be of two kinds: online and offline. While offline dictionary attacks are possible…

Cryptography and Security · Computer Science 2011-11-17 Vipul Goyal , Virendra Kumar , Mayank Singh , Ajith Abraham , Sugata Sanyal

Several studies on sentence processing suggest that the mental lexicon keeps track of the mutual expectations between words. Current DSMs, however, represent context words as separate features, thereby loosing important information for word…

Computation and Language · Computer Science 2016-10-06 Emmanuele Chersoni , Enrico Santus , Alessandro Lenci , Philippe Blache , Chu-Ren Huang

Cloud services have become an essential infrastructure for enterprises and individuals. Access to these cloud services is typically governed by Identity and Access Management systems, where user authentication often relies on passwords.…

Cryptography and Security · Computer Science 2025-04-08 Darren Fürst , Andreas Aßmuth

Password managers are important tools that enable us to use stronger passwords, freeing us from the cognitive burden of remembering them. Despite this, there are still many users who do not fully trust password managers. In this paper, we…

Cryptography and Security · Computer Science 2021-06-22 Miguel Grilo , João F. Ferreira , José Bacelar Almeida

Passwords remain the primary authentication method, yet user-created passwords are often the weakest due to the security-usability trade-off. Although AI-based password generators are emerging, little is known about their effectiveness and…

Human-Computer Interaction · Computer Science 2026-04-28 Duru Paker , Suleyman Ozdel , Enkelejda Kasneci

We explore various methods for computing sentence representations from pre-trained word embeddings without any training, i.e., using nothing but random parameterizations. Our aim is to put sentence embeddings on more solid footing by 1)…

Computation and Language · Computer Science 2019-01-30 John Wieting , Douwe Kiela

The syntactic structure of a sentence can be represented as a graph, where vertices are words and edges indicate syntactic dependencies between them. In this setting, the distance between two linked words is defined as the difference…

Computation and Language · Computer Science 2025-08-12 Sonia Petrini , Ramon Ferrer-i-Cancho

Do word embeddings converge to learn similar things over different initializations? How repeatable are experiments with word embeddings? Are all word embedding techniques equally reliable? In this paper we propose evaluating methods for…

Computation and Language · Computer Science 2016-05-13 Yingtao Tian , Vivek Kulkarni , Bryan Perozzi , Steven Skiena

Environmental sound synthesis is a technique for generating a natural environmental sound. Conventional work on environmental sound synthesis using sound event labels cannot finely control synthesized sounds, for example, the pitch and…

Language modelling is regularly analysed at word, subword or character units, but syllables are seldom used. Syllables provide shorter sequences than characters, they can be extracted with rules, and their segmentation typically requires…

Computation and Language · Computer Science 2020-10-27 Arturo Oncevay , Kervy Rivas Rojas

The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…

Formal Languages and Automata Theory · Computer Science 2019-07-16 Paul Sauer

This paper is an attempt to bring together two approaches to language analysis. The possible use of probabilistic information in principle-based grammars and parsers is considered, including discussion on some theoretical and computational…

cmp-lg · Computer Science 2008-02-03 Andrew Fordham , Matthew Crocker