Categories: None [Edit]
tagmemics
The English language is extremely complicated. We have words that can have multiple
parts of speech. Natural language processing is difficult because it is hard to
tell if a word is a noun when it could be a verb or an adjective, etc.
The purpose of this project is to develop an algorithm that, given a sentence string,
has a ranking system that detects the part of speech of each word.
Why is the useful? Because understanding the correct parts of speech in a sentence
is the first step to teaching a robot how to read.
Total
Ranking: 116,822 of 180,469
Downloads: 5,060
Daily
Ranking: 37,537 of 180,459
Downloads: 1
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
Rank | Downloads | Name |
---|
Depends on
Rank | Downloads | Name |
---|---|---|
16 | 854,040,010 | rake |
63 | 422,702,735 | pry |
976 | 33,350,364 | minitest-reporters |
1,021 | 30,806,672 | mechanize |
1,027 | 30,559,870 | shoulda-context |
1,075 | 28,066,458 | shoulda |
2,590 | 4,836,816 | facets |
42,079 | 24,121 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |