Despite the rapid progress of end-to-end (E2E) automatic speech recognition (ASR), it has been shown that incorporating external language models (LMs) into decoding can further improve performance E2E ASR systems. To align with modeling units adopted in systems, subword-level (e.g., characters, BPE) LMs are usually used to cooperate current However, use will ignore word-level information, which...

Let Σ be a finite ordered alphabet. We present polynomialtime algorithms for computing the k-th in the lexicographic order Lyndon word of a given length n over Σ and counting Lyndon words of length n that are smaller than a given word. We also use the connections between Lyndon words and minimal de Bruijn sequences (theorem of Fredricksen and Maiorana) to develop the first polynomial time algor...

Tetanus Neonatorum bring ’n hoé sterftesyfer mee. Voorsorg is beter as nasorg en dit is van lewensbelang om die publiek voor te lig. Verwagtende moeders word geleer om voorgeboorteklinieke te besoek, en waar om standighede dit toeiaat, behoort die bevalling in ’n hospitaal o f kliniek plaas te vind. Waar dit onmoontlik is en die bevalling tuis plaasvind behoort dit deur ’n geneesheer of distrik...

Met die hoë voorkoms van kanker is daar ’n wêreldwye gebrek aan mannekrag vir kankersorg en nogtans word die verpleegkundige onderbenut ten opsigte van haar moontlike rol in die bestriding en behandeling van kanker. Die UICC het besef dat ’n internasionale inset nodig was om gesondheidsowerhede, kankerverenigings, geneeshere en verpleegkundiges bewus te maak van die verpleegkundige se rol in ka...

The border correlation function attaches to every word w a binary word β(w) of the same length where the ith letter tells whether the ith conjugate w′ = vu of w = uv is bordered or not. Let [u] denote the set of conjugates of the word w. We show that for a 3-letter alphabet A, the set of β-images equals β(An) = B∗ \ ([ abn−1 ] ∪D ) where D = {an} if n ∈ {5, 7, 9, 10, 14, 17}, and otherwise D = ...

For every symmetric (“palindromic”) word S(A,B) in two positive definite letters and for each fixed n-by-n positive definite B and P , it is shown that the symmetric word equation S(A,B) = P has an n-by-n positive definite solution A. Moreover, if B and P are real, there is a real solution A. The notion of symmetric word is generalized to allow non-integer exponents, with certain limitations. I...

Randall A. Helzerman, Mary P. Harper, and Carla B. Zoltowski School of Electrical Engineering Purdue University West Lafayette, IN 47907 Abstract We have extended Maruyama's [4, 2, 3] constraint dependency grammar (CDG) to process a lattice of sentence hypotheses instead of separate text strings. A post-processor to a speech recognizer producing N-best hypotheses generates the word lattice repr...