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,798 of 183,107
Downloads: 5,229
Daily
Ranking: 86,038 of 183,092
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 | 953,844,246 | rake |
68 | 466,913,746 | pry |
995 | 37,044,699 | minitest-reporters |
1,037 | 34,691,835 | shoulda-context |
1,050 | 33,680,644 | mechanize |
1,084 | 31,864,462 | shoulda |
2,663 | 5,176,276 | facets |
42,974 | 24,706 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |