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,577 of 186,954
Downloads: 5,575
Daily
Ranking: 54,072 of 186,947
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,139,617,007 | rake |
72 | 546,910,324 | pry |
1,007 | 43,856,480 | minitest-reporters |
1,046 | 41,909,881 | shoulda-context |
1,108 | 38,050,189 | shoulda |
1,118 | 37,780,333 | mechanize |
2,798 | 5,741,095 | facets |
43,509 | 26,099 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |