Find the best solutions to your problems with the help of IDNLearn.com. Get accurate and timely answers to your queries from our extensive network of experienced professionals.
The following sentence is partially tagged with POS Tags, where "bear" can be either a VB (verb) or a NN (noun): Your/Which formulas can calculate the most probable tag sequence for "bear"? 1) P(bear|NN)* P(NN|VB)*P(VB|NN) 2) P(bear|VB)*P(VB|MD)*P(NN|VB) 3) P(will|MD)*P(bear|VB)* P(fruit|NN) 4) P(NN|NN)* P(NN|MD)*P(bear|NN) 5) P(bear|VB)*P(VB|NN)*P(VB|MD) A. 2, 4 B. 1,5 C. 3, 5 D. 1,2 E. 4,5
Sagot :
We appreciate your contributions to this forum. Don't forget to check back for the latest answers. Keep asking, answering, and sharing useful information. Discover the answers you need at IDNLearn.com. Thank you for visiting, and we hope to see you again for more solutions.
