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,235 of 189,968
Downloads: 5,944
Daily
Ranking: 122,573 of 189,933
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,249,142,844 | rake |
| 73 | 581,389,495 | pry |
| 994 | 48,296,970 | minitest-reporters |
| 1,018 | 46,323,190 | shoulda-context |
| 1,093 | 41,984,731 | shoulda |
| 1,134 | 39,569,123 | mechanize |
| 2,863 | 5,941,062 | facets |
| 42,824 | 28,033 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |