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,102 of 188,779
Downloads: 5,894
Daily
Ranking: 88,817 of 188,757
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 |
|---|---|---|
| 10 | 1,202,684,222 | rake |
| 74 | 569,632,751 | pry |
| 998 | 46,729,729 | minitest-reporters |
| 1,024 | 44,850,423 | shoulda-context |
| 1,104 | 40,633,444 | shoulda |
| 1,135 | 38,999,582 | mechanize |
| 2,838 | 5,880,099 | facets |
| 42,707 | 27,817 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |