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,716 of 193,756
Downloads: 6,114
Daily
Ranking: 52,349 of 193,649
Downloads: 2
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,345,947,699 | rake |
| 71 | 610,500,117 | pry |
| 959 | 52,335,812 | minitest-reporters |
| 1,002 | 49,803,787 | shoulda-context |
| 1,072 | 45,198,387 | shoulda |
| 1,154 | 40,886,876 | mechanize |
| 2,911 | 6,117,452 | facets |
| 43,174 | 28,730 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |