| 翻訳と辞書 |
N-gram
In the fields of computational linguistics and probability, an ''n''-gram is a contiguous sequence of ''n'' items from a given sequence of text or speech. The items can be phonemes, syllables, letters, words or base pairs according to the application. The ''n''-grams typically are collected from a text or speech corpus. When the items are words, -grams may also be called shingles.
An ''n''-gram of size 1 is referred to as a "unigram"; size 2 is a "bigram" (or, less commonly, a "digram"); size 3 is a "trigram". Larger sizes are sometimes referred to by the value of ''n'', e.g., "four-gram", "five-gram", and so on.
== Applications ==
An ''n''-gram model is a type of probabilistic language model for predicting the next item in such a sequence in the form of a (''n'' − 1)–order Markov model.〔https://class.coursera.org/nlp/lecture/17〕 ''n''-gram models are now widely used in probability, communication theory, computational linguistics (for instance, statistical natural language processing), computational biology (for instance, biological sequence analysis), and data compression. The two core advantages of ''n''-gram models (and algorithms that use them) are relative simplicity and the ability to scale up – by simply increasing ''n'' a model can be used to store more context with a well-understood space–time tradeoff, enabling small experiments to scale up very efficiently.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「N-gram」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|