Results 211 to 220 of about 2,834,541 (247)
Some of the next articles are maybe not open access.

Tight Lower Bounds on the Length of Word Chains

Information Processing Letters, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ingo Althöfer
exaly   +3 more sources

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
exaly   +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
Sophie Schbath
exaly   +5 more sources

A Subtle Effect of Inducing Positive Words by Playing Web-Based Word Chain Game

Proceedings of the 9th International Conference on Human-Agent Interaction, 2021
A variety of chatbots were developed to elicit people’s emotional responses and manage the emotions of people. These chatbots often use text-based emotional sentences. However, there are few studies that chatbots use extremely simplified communications to induce some emotional responses.
Naoki Osaka   +3 more
openaire   +2 more sources

CHAIN CODE PROCESSING FOR HANDWRITTEN WORD RECOGNITION

SSRN Electronic Journal, 2021
Contour representations are well suited for representing handwritten word images. The storage is lossless and the processing time required is a relatively small. While chain code encoding of contours has been favored by researchers in the area of handwriting recognition the representation does have some drawbacks.
SHAKUNTHALA B S, C S PILLAI
openaire   +1 more source

Dynamic Impact of Online Word-of-Mouth and Advertising on Supply Chain Performance [PDF]

open access: yesInternational Journal of Environmental Research and Public Health, 2018
Cooperative (co-op) advertising investments benefit brand goodwill and further improve supply chain performance. Meanwhile, online word-of-mouth (OWOM) can also play an important role in supply chain performance. On the basis of co-op advertising, this paper considers a single supply chain structure led by a manufacturer and examines a fundamental ...
Jian Feng, Bin Liu
exaly   +3 more sources

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

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

Research on Improved Algorithm for Chinese Word Segmentation Based on Markov Chain

2009 Fifth International Conference on Information Assurance and Security, 2009
Chinese words segmentation is an important technique for Chinese web data mining. After the research made on some Chinese word segmentation nowadays, an improved algorithm is proposed in this paper. The algorithm updates dictionary by using Two-way Markov Chain, and does word segmentation by applying an improved Forward Maximum Matching Method based on
Haoshan Shi
exaly   +2 more sources

Home - About - Disclaimer - Privacy