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: 120,055 of 197,108
Downloads: 6,224
Daily
Ranking: 84,238 of 197,085
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,429,009,039 | rake |
| 72 | 637,712,186 | pry |
| 949 | 55,314,931 | minitest-reporters |
| 988 | 53,026,683 | shoulda-context |
| 1,063 | 47,978,560 | shoulda |
| 1,166 | 42,114,575 | mechanize |
| 2,958 | 6,358,117 | facets |
| 43,498 | 29,423 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |