Abstract Subword complexes were defined by Knutson and Miller in 2004 to describe Gröbner degenerations of matrix Schubert varieties. a certain type are called pipe dream complexes. The facets such complex indexed dreams, or, equivalently, monomials the corresponding polynomial. In 2017 Assaf Searles basis slide polynomials, generalizing Stanley symmetric functions, described combinatorial rule...

There has been much discussion recently regarding spoken term detection (STD) in speech processing communities. Query-by-Example (QbE) has also been an important topic in spoken-term detection (STD), where a query is issued using a speech signal. This paper proposes a rescoring method using a posteriorgram, which is a sequence of posterior probabilities obtained by a deep neural network (DNN) t...

State-of-the-art automatic speech recognition and text-to-speech systems are based on subword units, typically phonemes. This necessitates a lexicon that maps each word to a sequence of subword units. Development of a phonetic lexicon for a language requires linguistic knowledge as well as human effort, which may not be always readily available, particularly for under-resourced languages. In su...

We describe how complementary search spaces, addressed by two different methods used in Spoken Term Detection (STD), can be merged for German subword STD. We propose fuzzysearch techniques on lattices to narrow the gap between subword and word retrieval. The first technique is based on an edit-distance, where no a priori knowledge about confusions is employed. Additionally, we propose a weighti...

Let (W,S) be a Coxeter system. An element in W and an ordered list of elements in S give us a subword complex, as defined by Knutson and Miller. We define the “fish product” between an involution in W and a generator in S, which is also discussed by Hultman. This “fish product” always produces an involution. The structure of the involution subword complex ∆̂(Q,w) behaves very similarly to the re...

This paper describes the application of subword units in an effort of improving open-vocabulary spoken document retrieval performance in the case of highly corrupted recognition output. This paper presents the developed open-vocabulary spoken document retrieval system including the newly proposed subphonetic segment unit and combining multilayer subword units. Our experiments on Japanese spoken...

By taking out letters from a word we get a subword. Both continuous sub-words (also called factors or simply subwords) and scattered subwords were extensively studied. In [4] the authors introduced Parikh matrices, structures that contain more information about the words than Parikh vectors, which tell us only the number of di $ffere\tau 1T$ letters building the word. $I_{l1}[5]$ the notion of ...

This paper explores approaches to the problem of spoken document retrieval (SDR), which is the task of automatically indexing and then retrieving relevant items from a large collection of recorded speech messages in response to a user specified natural language text query. We investigate the use of subword unit representations for SDR as an alternative to words generated by either keyword spott...

We examine words w satisfying the following property: if x is a subword of w and |x| is at least k for some fixed k, then the reversal of x is not a subword of w.