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,688 of 193,214
Downloads: 6,088
Daily
Ranking: 61,331 of 193,188
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,330,047,653 | rake |
| 72 | 605,239,366 | pry |
| 964 | 51,617,125 | minitest-reporters |
| 1,005 | 49,190,328 | shoulda-context |
| 1,075 | 44,627,740 | shoulda |
| 1,149 | 40,640,606 | mechanize |
| 2,896 | 6,082,814 | facets |
| 43,113 | 28,648 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |