Bigram

A bigram is an n-gram that is a 2-tuple.

• AKA: 3-gram.
• Context:
  • It can be a member of a Bigram Model.
  • …
• Example(s):
  • Bigram((apple fell), “This apple fell from that tree.”) ⇒ True.
  • Bigram(?, “This apple fell from that tree.”) ⇒ {(This apple),(apple fell),(fell from),....,(that tree)}.
  • …
• Counter-Example(s):
  • a Unigram Relation, such as: R( (apple), “This apple fell from that tree.”) ⇒ True.
  • a Trigram Relation, such as: R( (apple fell from), “This apple fell from that tree.”) ⇒ True.
• See: Vector, Bigram Counting.

---

---

References

• http://thaps.blogspot.com/2006/01/perl-bigram-count.html

2011

• http://en.wikipedia.org/wiki/N-gram
  • 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"; size 4 is a "four-gram" and size 5 or more is simply called an "n-gram". Some language models built from n-grams are "(n − 1)-order Markov models".

---