Regarding the CBOW and Skip-Gram algorithms, is the following statement incorrect?
A . Both CBOW and Skip-Gram can train vectors, but skip-Gram is faster than CBOW
B . CBOW calculates the occurrence probability of a word based on n consecutive words in front of a word or n consecutive words before and after a word
C . Both the CBOW model and the skip-gram model can be based on the Huffman tree
D . Skip-Gram is to calculate the probability of several words before and after it according to a certain word
Answer: A