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: 116,892 of 180,643
Downloads: 5,076
Daily
Ranking: 79,870 of 180,629
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 |
---|---|---|
16 | 860,399,527 | rake |
63 | 425,530,742 | pry |
981 | 33,605,020 | minitest-reporters |
1,024 | 30,997,881 | mechanize |
1,028 | 30,846,045 | shoulda-context |
1,073 | 28,334,692 | shoulda |
2,594 | 4,860,723 | facets |
42,190 | 24,145 | wordnet-defaultdb |
Owners
# | Gravatar | Handle |
---|---|---|
1 | binarymason |