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: 117,932 of 183,477
Downloads: 5,254
Daily
Ranking: 63,432 of 183,470
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 |
---|---|---|
10 | 969,073,546 | rake |
69 | 473,435,718 | pry |
1,002 | 37,570,199 | minitest-reporters |
1,040 | 35,346,956 | shoulda-context |
1,057 | 34,111,346 | mechanize |
1,086 | 32,455,782 | shoulda |
2,670 | 5,230,085 | facets |
43,054 | 24,801 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |