In this paper, a language tagging template named POC-NLW (position of a character within an n-length word) is presented. Based on this template, a twostage statistical model for Chinese word segmentation is constructed. In this method, the basic word segmentation is based on n-gram language model, and a Hidden Markov tagger based on the POC-NLW template is used to implement the out-of-vocabular...

In this paper, we consider the normalized lengths of factors some factorizations random words. First, for Lyndon factorization finite words with n independent letters drawn from a or infinite totally ordered alphabet according to general probability distribution, prove that limit law smallest is variant stickbreaking process. Convergence distribution longest Poisson–Dirichlet follows. Second, s...

Tuberkulosebeheer skep ’n uitdaging vir die verpleegadministrateur se bestuursvermoë. Weens haar deeglike kennis van die gemeenskap is sy ’n ideale lid van die tuberkulosebeheerspan. Eerstens moet streeksomstandighede soos demografiese, maatskaplike en omgewingsfaktore wat die verspreiding van tuberkulose in 'n spesifieke streek bevorder, bepaal word. Die beskikbaarheid van personeel, voorrade,...

In die Suid-Afrikaanse situasie is die verpleegkundige 'n kernfiguur in die lewering van primêre gesondheidsorgdienste. In die voorsiening van ’n veilige omgewing het sy ’n sekondêre rol in behoefteidentifisering en voorligting en dieselfde geld vir die aspek van toereikende voeding. Haar rol in basiese voorkomende gesondheidsorg en die sorg van bejaardes, gestremdes en chroniese siekes word re...

Černý’s conjecture asserts the existence of a synchronizing word of length at most (n− 1) for any synchronized n-state deterministic automaton. We prove a quadratic upper bound on the length of a synchronizing word for any synchronized n-state deterministic automaton satisfying the following additional property: there is a letter a such that for any pair of states p, q, one has p·a = q ·a for s...

Given a positive integer n and a finite alphabet Σ, a word w over Σ is said to guarantee minimum image if, for every homomorphism φ from the free monoid Σ∗ over Σ into the monoid of all transformations of an n-element set, the range of the transformation wφ has the minimum cardinality among the ranges of all transformations of the form vφ where v runs over Σ∗ . Although the existence of words g...

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n + 1 distinct integers are used. This is best possible and proves a conjecture of Chung, Diaconis and Graham.

Let πw denote the failure function of the Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A[1. . n], is there a word w over arbitrary alphabet Σ such that A[i] = πw[i] for all i? Moreover, what is the minimum cardinal-ity of Σ required? We give a real time linear algorithm for this problem in the unit-cost RAM model with Θ(log n) bits wo...

A lot of researchers are concerned of orthographic neighborhood (N) effect (Andrews, 1989, 1992; Carreiras et al., 1997; Laxon et al., 1988; Peereman & Content, 1995; Sears et al., 2006), which can reflect how the potential word candidates with similar orthography affect the word naming task. In alphabetic writing systems, orthographic neighborhood refers to a word pool, which is consisted by c...