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,554 of 198,547
Downloads: 6,254
Daily
Ranking: 112,004 of 198,526
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,465,258,777 | rake |
| 73 | 649,792,182 | pry |
| 949 | 56,503,719 | minitest-reporters |
| 981 | 54,399,420 | shoulda-context |
| 1,059 | 49,157,747 | shoulda |
| 1,172 | 42,706,472 | mechanize |
| 2,974 | 6,442,055 | facets |
| 43,549 | 29,746 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |