相关论文: Packing patterns into words

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…

This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration…

Prefix parsing asks whether an input prefix can be extended to a complete string generated by a given grammar. In the weighted setting, it also provides prefix probabilities, which are central to context-free language modeling,…

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…

We explain how certain tools from convex analysis and probability theory may be used in order to obtain counting results for the number of words with prescribed frequencies of letters in regular languages.

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…

We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…

A theoretical framework is proposed for the understanding of verbal perception -- the conversion of words into meaning, modeled as a compromise between lexical demands and contextual constraints -- and the theory is tested against…

The occurrence of unknown words in texts significantly hinders reading comprehension. To improve accessibility for specific target populations, computational modelling has been applied to identify complex words in texts and substitute them…

We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.

Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…

A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…

In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate…

Summarizing data samples by quantitative measures has a long history, with descriptive statistics being a case in point. However, as natural language processing methods flourish, there are still insufficient characteristic metrics to…

Recent approaches to cross-lingual word embedding have generally been based on linear transformations between the sets of embedding vectors in the two languages. In this paper, we propose an approach that instead expresses the two…

By representing words with probability densities rather than point vectors, probabilistic word embeddings can capture rich and interpretable semantic information and uncertainty. The uncertainty information can be particularly meaningful in…

Words can have multiple senses. Compositional distributional models of meaning have been argued to deal well with finer shades of meaning variation known as polysemy, but are not so well equipped to handle word senses that are…

A brief presentation of basic definitions and notation used in permutation patterns research.

Topic models are a useful analysis tool to uncover the underlying themes within document collections. The dominant approach is to use probabilistic topic models that posit a generative story, but in this paper we propose an alternative way…