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,743 of 186,698
Downloads: 5,478
Daily
Ranking: 104,290 of 186,685
Downloads: 2
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,125,994,016 | rake |
71 | 541,923,162 | pry |
1,017 | 43,220,572 | minitest-reporters |
1,051 | 41,252,642 | shoulda-context |
1,113 | 37,515,927 | shoulda |
1,115 | 37,507,057 | mechanize |
2,785 | 5,709,006 | facets |
43,816 | 25,559 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |