We present BPEmb, a collection of pre-trained subword unit embeddings in 275 languages, based on Byte-Pair Encoding (BPE). In an evaluation using fine-grained entity typing as testbed, BPEmb performs competitively, and for some languages better than alternative subword approaches, while requiring vastly fewer resources and no tokenization. BPEmb is available at https://github.com/bheinzerling/b...

We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.

We determine the Möbius function of a poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse theory. This composition poset turns out to be intimately connected with subword order, whose Möbius function was determined by Björner. We show that using a generalization of subword order, we can obtain both Björner’s r...

The paper challenges the prevalent paradigm that differentiates between the management of a core competence and commodity processes. A case study is conducted to examine the strategic planning and management of a call center to illustrate that a commodity process, such as handling customers’ complaints and enquiries, can be transformed into a core competence, if a clear strategic intent is arti...

A quasiperiod of a finite or infinite string/word is a word whose occurrences cover every part of the string. A word or an infinite string is referred to as quasiperiodic if it has a quasiperiod. It is obvious that a quasiperiodic infinite string cannot have every word as a subword (factor). Therefore, the question arises how large the set of subwords of a quasiperiodic infinite string can be [...

A repetition in a word is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in , that is those for which any extended subword of has a bigger period. The set of such repetitions represents in a compact way all repetitions in . We first prove a combinatorial result asserting that the sum of exponents of all maximal repetitions of a word of le...

The state-of-the-art automatic speech recognition (ASR) systems typically use phonemes as subword units. In this work, we present a novel grapheme-based ASR system that jointly models phoneme and grapheme information using Kullback-Leibler divergence-based HMM system (KL-HMM). More specifically, the underlying subword unit models are grapheme units and the phonetic information is captured throu...

The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called extremal if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. ...

Let P be a poset and let P ∗ be the set of all finite length words over P . Generalized subword order is the partial order on P ∗ obtained by letting u ≤ w if and only if there is a subword u′ of w having the same length as u such that each element of u is less than or equal to the corresponding element of u′ in the partial order on P . Classical subword order arises when P is an antichain, whi...