Views
Graph
Explorer
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 levels
Load all levels
All
Dagre
Focus
Down
Load 1 level
Load 2 levels
Load 3 levels
Load 4 level
Load all levels
All
Tree
SpaceTree
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Radial
Focus
Expanding
Load 1 level
Load 2 levels
Load 3 levels
Down
All
Down
Box
Focus
Expanding
Down
Up
All
Down
Page ✓
Article
Outline
Document
Down
All
Canvas
Time
Timeline
Calendar
Request email digest
Past 24 hours
Past 2 days
Past 3 days
Past week
Add
Add page
Add comment
Add citation
Edit
Edit page
Delete page
Share
Link
Bookmark
Embed
Social media
Login
Member login
Register now for a free account
🔎
Verbocean:Mining the web for fine-grained semantic verb relations
Position
1
#258537
Demo of VerbOcean at
http://demo.patrickpantel.com/demos/verbocean/
Full list of 3,477 unique verbs in VerbOcean at
http://www.patrickpantel.com/download/data/verbocean/verbocean-verbs.2004-05-20.txt
Unrefined VerbOcean, 22,306 relations (line-based gzipped text file, self-explanatory format) at
http://www.patrickpantel.com/cgi-bin/web/tools/getfile.pl?type=data&id=verbocean/verbocean.unrefined.2004-05-20.txt.gz
CONTEXT
(Help)
-
OpenSherlock Project »
OpenSherlock Project
OpenSherlock Project☜Fabricating possibly many open source variants along the lines of IBMs Watson. The projects name has changed from SolrDrWatson to SolrSherlock, with thanks to Tom Munnecke. Migrating to OpenSherlock concept where we generalize beyond Solr as the platform core.☜F1CEB7
▲
References »
References
References☜Links to resources related to the SolrDrWatson project☜59C6EF
▲
Conference Papers »
Conference Papers
Conference Papers☜☜FFB597
■
Verbocean:Mining the web for fine-grained semantic verb relations
Verbocean:Mining the web for fine-grained semantic verb relations☜☜59C6EF
Heading
Summary
Click the button to enter task scheduling information
Open
Details
Enter task details
Message text
Select assignee(s)
Due date (click calendar)
RadDatePicker
RadDatePicker
Open the calendar popup.
Calendar
Title and navigation
Title and navigation
<<
<
November 2024
>
<<
November 2024
S
M
T
W
T
F
S
44
27
28
29
30
31
1
2
45
3
4
5
6
7
8
9
46
10
11
12
13
14
15
16
47
17
18
19
20
21
22
23
48
24
25
26
27
28
29
30
49
1
2
3
4
5
6
7
Reminder
No reminder
1 day before due
2 days before due
3 days before due
1 week before due
Ready to post
Copy to text
Enter
Cancel
Task assignment(s) have been emailed and cannot now be altered
Lock
Cancel
Save
Comment graphing options
Choose comments:
Comment only
Whole thread
All comments
Choose location:
To a new map
To this map
New map options
Select map ontology
Options
Standard (default) ontology
College debate ontology
Hypothesis ontology
Influence diagram ontology
Story ontology
Graph to private map
Cancel
Proceed
+Comments (
0
)
- Comments
Add a comment
Newest first
Oldest first
Show threads
+Citations (
2
)
- Citations
Add new citation
List by:
Citerank
Map
Link
[1]
Verbocean:Mining the web for fine-grained semantic verb relations
Author:
Timothy Chklovski, Patrick Pantel
Publication info:
2004
Cited by:
Jack Park
8:47 PM 6 March 2013 GMT
URL:
http://malt.ml.cmu.edu/mw/index.php/Chklovski_and_Pantel_(2004)_Verbocean:Mining_the_web_for_fine-grained_semantic_verb_relations
Excerpt / Summary
Broad-coverage repositories of semantic relations between verbs could benefit many NLP tasks. We present a semi-automatic method for extracting fine-grained semantic relations between verbs. We detect similarity, strength, antonymy, enablement, and temporal happens-before relations between pairs of strongly associated verbs using lexicosyntactic patterns over the Web. On a set of 29,165 strongly associated verb pairs, our extraction algorithm yielded 65.5% accuracy. Analysis of error types shows that on the relation strength we achieved 75% accuracy.
Link
[2]
A Critique of “VerbOcean: Mining the Web for Fine- Grained Semantic Verb Relations
Author:
Kino Coursey
Cited by:
Jack Park
8:52 PM 6 March 2013 GMT
URL:
http://www.daxtron.com/csce6330/Critique%20of%20VerbOcean.pdf
Excerpt / Summary
The key to the entire process is finding good patterns. Given that for both symmetric and asymmetric relationship you want the pattern that maximizes the Sp(V1,V2) formula, one can hunt for patterns using Google wildcards. For instance “bought * * sold” and find out what terms fill the wildcards. One can then rank the patterns by the Sp(V1,V2) formula. The primary difference would be using Google directly instead of DIRT.
+About
- About
Entered by:-
Jack Park
NodeID:
#258537
Node type:
Position
Entry date (GMT):
3/6/2013 8:46:00 PM
Last edit date (GMT):
3/6/2013 9:00:00 PM
Show other editors
Incoming cross-relations:
0
Outgoing cross-relations:
0
Average rating:
0
by
0
users
x
Select file to upload