Elkeen weet wat die gehalte van versorging wat die verpleegkundige aan haar pasiënte gee behoort te wees. Word hierdie behoort te wees egter so oorgedra na die werklike situasie? Dié vraag word objektief beskou aan die hand van navorsing oor pasiënt-tevredenheid, voorligting oor borsvoeding, die sterwende pasiënt en drukplekversorging. Die verpleegkundige moet haar pasiënt nie net met haar gevo...

This paper investigates yarowsky algorithm for Hindi word sense disambiguation. The evaluation has been developed o n a manually created sense tagged corpus consisting of Hindi words (nouns). The sense definition has been obtained from Hindi Word Net, which is developed at I I T B o m b a y . The maximum observed prec is ion o f 61.7 on 605 tes t ins tances corresponds to the case when both ste...

A semantic relatedness decision task was used to investigate whether phonological recording occurs automatically and whether it mediates lexical access in visual word recognition and reading. In this task, subjects read a pair of words and decided whether they were related or unrelated in meaning. In Experiment 1, unrelated word-homophone pairs (e.g., LION-BARE) and their visual controls (e.g.,...

Variations of word associations across different groups of people can provide insights into people’s psychologies and their world views. To capture these variations, we introduce the task of demographicaware word associations. We build a new gold standard dataset consisting of word association responses for approximately 300 stimulus words, collected from more than 800 respondents of different ...

Emotion detection was normally conducted from the viewpoint of prosody and articulation features. There is still an opening question on how to extract the emotion from the text input. To solve the problem, the paper generates an emotion estimation net (ESiN), which combines the content words and emotion functional words to estimate the final emotion output. In the paper, emotion functional word...

Though the time-delay neural net architecture has been recently used in a number of speech recognition applications, it has the problem that it can not use longer temporal contexts because this increases the number of connection weights in the network. This is a serious bottleneck because the use of larger temporal contexts can improve the recognition performance. In this paper, a time-derivari...

A pattern recognition algorithm is described that learns a transition net grammar from positive examples. Two sets of examples-one in English and one in Chinese-are presented. It is hoped that language learning will reduce the knowledge acquisition effort for expert systems and make the natural language interface to database systems more transportable. The algorithm presented makes a step in th...

In this paper we deal with the problem of estimating the marking of a labeled Petri net with nondeterministic transitions. In particular, we consider the case in which nondeterminism is due to the presence of transitions that share the same label and that can be simultaneously enabled. Under the assumption that: the structure of the net is known, the initial marking is known, the transition lab...

In this paper we deal with the problem of estimating the marking of a labeled Petri net with nondeterministic transitions. In particular, we consider the case in which nondeterminism is due to the presence of transitions that share the same label and that can be simultaneously enabled. Under the assumption that: the structure of the net is known, the initial marking is known, the transition lab...

In this paper, an approach to continuous speech recognition based on a two-layer lexical tree is proposed. The search network is maintained by the two-layer lexical tree, in which the first layer reflects the word net and the phone net while the second layer the dynamic programming (DP). Because the acoustic information is tied in the second layer, the memory cost is so small that it has the ab...