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,546 of 192,034
Downloads: 6,006
Daily
Ranking: 75,490 of 191,980
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 |
|---|---|---|
| 8 | 1,288,231,282 | rake |
| 73 | 593,812,604 | pry |
| 974 | 50,062,814 | minitest-reporters |
| 1,012 | 47,879,868 | shoulda-context |
| 1,079 | 43,435,544 | shoulda |
| 1,140 | 40,125,196 | mechanize |
| 2,879 | 6,017,555 | facets |
| 43,010 | 28,350 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |