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: 119,269 of 196,218
Downloads: 6,211
Daily
Ranking: 59,748 of 196,179
Downloads: 0
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 |
|---|---|---|
| 8 | 1,397,047,795 | rake |
| 72 | 627,709,826 | pry |
| 950 | 54,332,049 | minitest-reporters |
| 991 | 51,842,482 | shoulda-context |
| 1,064 | 46,990,954 | shoulda |
| 1,162 | 41,660,999 | mechanize |
| 2,936 | 6,270,806 | facets |
| 43,443 | 29,183 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |