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: 119,539 of 196,480
Downloads: 6,214
Daily
Ranking: 68,498 of 196,444
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,412,729,553 | rake |
| 72 | 632,579,294 | pry |
| 950 | 54,796,192 | minitest-reporters |
| 987 | 52,423,553 | shoulda-context |
| 1,063 | 47,479,534 | shoulda |
| 1,164 | 41,882,027 | mechanize |
| 2,951 | 6,307,517 | facets |
| 43,418 | 29,293 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |