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,135 of 189,432
Downloads: 5,925
Daily
Ranking: 96,800 of 189,408
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 |
|---|---|---|
| 9 | 1,232,715,961 | rake |
| 74 | 576,320,575 | pry |
| 993 | 47,618,053 | minitest-reporters |
| 1,021 | 45,623,058 | shoulda-context |
| 1,103 | 41,333,901 | shoulda |
| 1,134 | 39,337,783 | mechanize |
| 2,854 | 5,914,480 | facets |
| 42,793 | 27,915 | wordnet-defaultdb |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | binarymason |