Back to Results
First PageMeta Content
Markov models / Computational linguistics / Brown Corpus / Brown University / Natural language processing / Part-of-speech tagging / N-rule / PRNP / Word-sense disambiguation


POS Tagging Problem •  Given a sentence W1…Wn and a tagset of lexical categories, find the most likely tag T1..Tn for each word in the sentence •  Example Secretariat/NNP is/VBZ expected/VBN to/TO race/VB tomor
Add to Reading List

Document Date: 2016-02-17 11:43:10


Open Document

File Size: 460,12 KB

Share Result on Facebook