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,248 of 188,368
Downloads: 5,844
Daily
Ranking: 83,225 of 188,354
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 |
|---|---|---|
| 10 | 1,192,998,841 | rake |
| 74 | 566,155,489 | pry |
| 1,000 | 46,234,831 | minitest-reporters |
| 1,027 | 44,316,073 | shoulda-context |
| 1,110 | 40,125,111 | shoulda |
| 1,132 | 38,803,714 | mechanize |
| 2,831 | 5,858,259 | facets |
| 42,716 | 27,634 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |