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: 118,345 of 187,967
Downloads: 5,785
Daily
Ranking: 121,583 of 187,960
Downloads: 3
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 |
|---|---|---|
| 10 | 1,178,214,454 | rake |
| 74 | 560,774,668 | pry |
| 1,002 | 45,657,020 | minitest-reporters |
| 1,035 | 43,631,134 | shoulda-context |
| 1,108 | 39,495,830 | shoulda |
| 1,130 | 38,525,160 | mechanize |
| 2,827 | 5,824,969 | facets |
| 42,847 | 27,309 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |