نتایج جستجو برای: N-word
تعداد نتایج: 1070826 فیلتر نتایج به سال:
The N-word is the ultimate insult that has tormented generations of African-Americans. Yet over time, N-word derivatives have become popular terms of endearment by the descendants of the very people who once had to endure the N-word. Therein lies the root of an ongoing argument in society today: Who has the ‘right’ to use the N-word and N-word derivatives? A quota sample (N=347) of undergradua...
We describe a visualization tool that can be used to view the change in meaning of words over time. The tool makes use of existing (static) word embedding datasets together with a timestamped n-gram corpus to create temporal word embeddings.
abstract compound is a word-formation process that are made two free morpheme (independent) and forms a new word with a new meaning that consists of meaning of both two component of compound. avestan language is one of the ancient iranian languages that is one of the indo-iranian languages. indo-iranian languages is one branch of indo-european languages. structure of compound noun and adjectiv...
testing plays a vital role in any language teaching program. it allows teachers and stakeholders, including program administrators, parents, admissions officers and prospective employers to be assured that the learners are progressing according to an accepted standard (douglas, 2010). the problems currently facing language testers have both practical and theoretical implications but the first i...
We compare four similarity-based estimation methods against back-off and maximum-likelihood estimation methods on a pseudo-word sense disambiguation task in which we controlled for both unigram and bigram frequency. The similarity-based methods perform up to 40% better on this particular task. We also conclude that events that occur only once in the training set have major impact on similarity-...
We describe, analyze, and experimentally evaluate a new probabilistic model for wordsequence prediction in natural languages, based on prediction suffi~v trees (PSTs). By using efficient data structures, we extend the notion of PST to unbounded vocabularies. We also show how to use a Bayesian approach based on recursive priors over all possible PSTs to efficiently maintain tree mixtures. These ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید