Recently F. M. Dekking conjectured the form of subword complexity function for Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using free software Walnut.

Subword complexity is a function that describes how many different substrings of a given length are contained in a given string. In this paper, two estimators of block entropy are proposed, based on the profile of subword complexity. The first estimator works well only for IID processes with uniform probabilities. The second estimator provides a lower bound of block entropy for any strictly sta...

SUBWORD COMPLEXES (W,S) finite Coxeter system, Q = q1q2 · · · qm ∈ S∗, and ρ ∈W . Subword complex SC(Q, ρ) = simplicial complex with • vertices = [m] = positions in Q, • facets =F(Q, ρ) = complements of reduced expressions of ρ in Q. Exm. Q = τ2τ3τ1τ3τ2τ1τ2τ3τ1 in (S4, {(i i+ 1)}) ρ = [4, 1, 3, 2] = τ2τ3τ2τ1 = τ3τ2τ3τ1 = τ3τ2τ1τ3 F(Q, ρ) = {1, 2, 3, 5, 6}, {1, 2, 3, 6, 7}, {1, 2, 3, 7, 9}, {1, ...

In this paper, we attempt to validate the exible vocabulary approach for speaker independent isolated word and connected words recognition. We compare the performance of classical whole word HMMs against di erent sets of subword units. For this purpose, we model phonemes, diphones and words of the (Swiss) French language. The recognition rates obtained with phoneme models are monitored as we in...

This paper reports on the results of the Zero Resource Speech Challenge 2015, the first unified benchmark for zero resource speech technology, which aims at the unsupervised discovery of subword and word units from raw speech. This paper discusses the motivation for the challenge, its data sets, tasks and baseline systems. We outline the ideas behind the systems that were submitted for the two ...

We propose novel radical features from automatic translation for event extraction. Event detection is a complex language processing task for which it is expensive to collect training data, making generalisation challenging. We derive meaningful subword features from automatic translations into target language. Results suggest this method is particularly useful when using languages with writing ...

In this paper, we attempt to validate the exible vocabulary approach for speaker independent isolated word and connected words recognition. We compare the performance of classical whole word HMMs against di erent sets of subword units. For this purpose, we model phonemes, diphones and words of the (Swiss) French language. The recognition rates obtained with phoneme models are monitored as we in...

A recent development in the hybrid HMM/ANN speech recognition paradigm is the use of several subword classifiers, each of which provides different information about the speech signal. Although the combining methods have obtained promising results, the strategies so far proposed have been relatively simple. In most cases frame-level subword unit probabilities are combined using an unweighted pro...

The purpose of the current study was to develop and test a computerized matching-to-sample (MTS) protocol to facilitate recombinative generalization of subword units (onsets and rimes) and recognition of novel onset-rime and onset-rime-rime words. In addition, we sought to isolate the key training components necessary for recombinative generalization. Twenty-five literate adults participated. C...