Results 271 to 280 of about 2,463,782 (306)

A note on word chains and regular languages

Information Processing Letters, 1989
Word chains have recently obtained some attention. We present a result that connects word chains to regular languages. Namely, we derive the inequality: \(\ell (L_{\leq n})/| L_{\leq n}| \leq 2+O(1/n),\) where \(L_{\leq n}\) denotes all words of length at most n that are members of an infinite regular language L, and \(\ell (L_{\leq n})\) is the length
openaire   +1 more source

Improving word sense disambiguation in lexical chaining

2003
Previous algorithms to compute lexical chains suffer either from a lack of accuracy in word sense disambiguation (WSD) or from computational inefficiency. In this paper, we present a new linear-time algorithm for lexical chaining that adopts the assumption of one sense per discourse.
Michel Galley, Kathleen R. McKeown
openaire   +2 more sources

An Overview on the Distribution of Word Counts in Markov Chains

Journal of Computational Biology, 2000
In this paper, we give an overview about the different results existing on the statistical distribution of word counts in a Markovian sequence of letters. Results concerning the number of overlapping occurrences, the number of renewals and the number of clumps will be presented. Counts of single words and also multiple words are considered. Most of the
openaire   +4 more sources

Word Chains: A Simulation of Proof

The Mathematics Teacher, 1977
Here's a word game to be played before you introduce your students to proofs, and it just might help them avoid the usual first proof frustrations.
openaire   +1 more source

Isolated word recognition using Markov chain models

IEEE Transactions on Speech and Audio Processing, 1995
The paper describes how Markov chains may be applied to speech recognition. In this application, a spectral vector is modeled by a state of the Markov chain, and an utterance is represented by a sequence of states. The Markov chain model (MCM) offers a substantial reduction in computation, but at the expense of a significant increase in memory ...
openaire   +2 more sources

Compound Poisson and Poisson Process Approximations for Occurrences of Multiple Words in Markov Chains

Journal of Computational Biology, 1998
We derive a Poisson process approximation for the occurrences of clumps of multiple words and a compound Poisson process approximation for the number of occurrences of multiple words in a sequence of letters generated by a stationary Markov chain. Using the Chen-Stein method, we provide a bound on the error in the approximations.
Gesine Reinert, Sophie Schbath
openaire   +4 more sources

On chains of word equations and test sets

Bull. EATCS, 1999
Summary: Ehrenfeucht's conjecture is equivalent with the ascending chain condition for word equations. A related conjecture concerns the descending chain condition for word equations. We show that if this conjecture holds then an arbitrary infinite language \(L\) possesses a finite subset \(F\) such that the language \(L-F\) is a disjoint union of its ...
openaire   +2 more sources

Circular Tonal Chain Shifts in Jiaoxian Compound Words

Language and Linguistics, 2015
This study examines the tonal chain shifts in pre-neutral toned syllables of Jiaoxian compound words, using the framework of Optimality Theory. The tonal chain shifts are motivated by reducing articulatory effort according to the tonal markedness scale.
openaire   +1 more source

Increasing Students’ Vocabulary Using Word Chain Game

JOLIES : Journal of Linguistic and English Studies
This study aimed to determine whether the use of the Word Chain Game could improve students’ vocabulary at the second grade of MTs Muhammadiyah 02 Aimas. The research applied a Classroom Action Research (CAR) design conducted in two cycles, each consisting of planning, acting, observing, and reflecting stages.
Habib Nuruddin, Diva Sayyidina Saral, Hasanudin Hasanudin   +2 more
openaire   +1 more source

Norms for Chains of Word Associations

Psychological Reports, 1965
S H, OSIPOW, R R, GROOMS
openaire   +2 more sources