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,289 of 191,254
Downloads: 5,969
Daily
Ranking: 85,135 of 191,174
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,267,702,122 | rake |
| 72 | 587,299,465 | pry |
| 989 | 49,036,846 | minitest-reporters |
| 1,011 | 47,203,604 | shoulda-context |
| 1,086 | 42,826,236 | shoulda |
| 1,140 | 39,850,979 | mechanize |
| 2,872 | 5,973,436 | facets |
| 42,806 | 28,198 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |