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,358 of 187,239
Downloads: 5,678
Daily
Ranking: 58,247 of 187,224
Downloads: 6
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,151,901,046 | rake |
73 | 551,545,498 | pry |
1,005 | 44,489,338 | minitest-reporters |
1,044 | 42,476,848 | shoulda-context |
1,107 | 38,495,795 | shoulda |
1,126 | 38,029,075 | mechanize |
2,804 | 5,769,861 | facets |
43,414 | 26,490 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |