OPSOMMING Geregistreerde vroedvroue in Suid-Afrika word deur die Wet verplig om borsvoeding te bevorder. 'n Uiteensetting word gegee van die fisiologie van borsvoeding, voorgeboorte voorligting aan moeders, borsvoeding na ’n normale bevailing, voeding van die premature baba en die hantering van probleme van die borste. Die nadele verbonde aan byvoedings, medies-geregtelike aspekte, die bevorder...

As to traditional n-gram model, smaller n value is an inherent defect for estimating language probabilities in speech recognition, simply because that estimation could not be executed over farther word association but by means of short sequential word correlated information. This has an strong effect on the performance of speech recognition. This paper introduces an integrated language modeling...

Our proposed method is to use a Hidden Markov Model-based word segmenter and a Support Vector Machine-based chunker for Chinese word segmentation. Firstly, input sentences are analyzed by the Hidden Markov Model-based word segmenter. The word seg-menter produces n-best word candidates together with some class information and confidence measures. Secondly, the extracted words are broken into cha...

In this paper, we present a two-pass continuous digit string decoder using two sets of whole-word HMM models. One set contains context-independent (CI) models used in the first-pass search. The first-pass search results in N-best hypotheses from which a N-best word lattice can be derived. The other set contains context-dependent (CD) HMM models used to search along the N-best word lattice for t...

Techniques from linear algebra are used to study the synchronization problem in automata theory. Let A = (Q, X) be a finite automaton. Each word m in X∗ defines a map from Q to Q ; the rank of m in A is the integer Card{qm | q ∈ Q}. A word of rank 1 maps all states onto a unique state. Such a word is called a synchronizing word (if such a word exists the automaton itself is called a synchronizi...

A primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to some lexicographic order. A word w is bordered if there is a nonempty word u such that w = uvu for some word v. A right extension of a word w of length n is a word wu where all factors longer than n are bordered. A right extension wu of w is called trivial if there exists a positive integer k such that ...

This paper proposes an Approximate n-gram Markov Model for bag generation. Directed word association pairs with distances are used to approximate (n-1)-gram and n-gram training tables. This model has parameters of word association model, and merits of both word association model and Markov Model. The training knowledge for bag generation can be also applied to lexical selection in machine trans...

Let k,N ∈ N. We view members of {0, 1, . . . , k − 1} as words of length N on the alphabet {0, 1, . . . , k − 1}. A variable word is a word w1w2 · · ·wN on the alphabet {0, 1, . . . , k−1, x} in which the letter x (the variable) occurs. Indices i for which wi = x will be called wildcards, and {i : wi = x} will be called the wildcard set. We denote variable words by w(x), e.g. w(x) = 02x1x3210x ...

A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length n. A number of associated problems have also been investigated. In this paper we consider a ne...