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,345 of 187,591
Downloads: 5,736
Daily
Ranking: 130,231 of 187,571
Downloads: 5
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,165,649,814 | rake |
| 73 | 556,238,958 | pry |
| 1,004 | 45,094,035 | minitest-reporters |
| 1,036 | 43,074,584 | shoulda-context |
| 1,109 | 38,995,678 | shoulda |
| 1,126 | 38,281,378 | mechanize |
| 2,818 | 5,795,935 | facets |
| 42,960 | 27,032 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |