假设:一个文档的分词 w 1 w_1 w1, w 2 w_2 w2, w 3 w_3 w3,…, w n w_n wn.
unigram(一元元组):
句子中每个分词都是独立的.将每个分词的概率直接相乘即可.
p
(
w
)
=
p
(
w
1
)
∗
p
(
w
2
)
∗
p
(
w
3
)
.
.
.
∗
p
(
w
n
)
p\left( w \right) =p\left( w_1 \right) *p\left( w_2 \right) *p\left( w_3 \right) ...*p\left( w_n \right)
p(w)=p(w1)∗p(w2)∗p(w3)...∗p(wn)
= ∏ i = 1 n p ( w i ) \ \ \ \ \ =\prod_{i=1}^n{p\left( w_i \right)} =i=1∏np(wi)
bigram(二元元组):
基于 markov assumption ,考虑句子中前一个分词出现情况下的概率.
p
(
w
)
=
p
(
w
1
)
∗
p
(
w
2
∣
w
1
)
∗
p
(
w
3
∣
w
2
)
.
.
.
∗
p
(
w
n
∣
w
n
−
1
)
p\left( w \right) =p\left( w_1 \right) *p\left( w_2|w_1 \right) *p\left( w_3|w_2 \right) ...*p\left( w_n|w_{n-1} \right)
p(w)=p(w1)∗p(w2∣w1)∗p(w3∣w2)...∗p(wn∣wn−1)
= p ( w 1 ) ∗ ∏ i = 2 n p ( w i ∣ w i − 1 ) \ \ \ \ \ =p\left( w_1 \right) *\prod_{i=2}^n{p\left( w_i|w_{i-1} \right)} =p(w1)∗i=2∏np(wi∣wi−1)
trigram(三元元组):
基于 markov assumption ,考虑句子中前两个分词出现情况下的概率.
p
(
w
)
=
p
(
w
1
)
∗
p
(
w
2
∣
w
1
)
∗
p
(
w
3
∣
w
2
w
1
)
.
.
.
∗
p
(
w
n
∣
w
n
−
1
w
n
−
2
)
p\left( w \right) =p\left( w_1 \right) *p\left( w_2|w_1 \right) *p\left( w_3|w_2w_1 \right) ...*p\left( w_n|w_{n-1}w_{n-2} \right)
p(w)=p(w1)∗p(w2∣w1)∗p(w3∣w2w1)...∗p(wn∣wn−1wn−2)
= p ( w 1 ) ∗ p ( w 2 ∣ w 1 ) ∗ ∏ i = 3 n p ( w i ∣ w i − 1 w i − 2 ) \ \ \ \ \ =p\left( w_1 \right) *p\left( w_2|w_1 \right) *\prod_{i=3}^n{p\left( w_i|w_{i-1}w_{i-2} \right)} =p(w1)∗p(w2∣w1)∗i=3∏np(wi∣wi−1wi−2)
个人整理笔记,方便复习,若侵权,请联系。
附贪心学院课程链接: https://www.greedyai.com/courseinfor/105