Toggle navigation
Add Resource
About
FAQ
Sign In / Register
Please sign in to interact with this page. There is no need to register for an account, simply enter your name to stay signed in for 24 hours and you will be able to make a maximum of 10 likes and 5 comments during your time signed in.
First Name:
Last Name:
Stanford Dependency Path Matcher
Submitted by
on Sep 30 2014
0
Tweet
}
Suggest Revision
By:
Tom Kwiatkowski
Project:
https://github.com/tomkwiat/dependency-g...
From:
Allen Institute for Artificial Intelligence Foundation
Paper:
Summary
Comments (
0
)
Resource Type:
Code
License:
Apache 2.0
Language:
Scala
Data Format:
Description
Framework for building composite dependency graphs for a pair of Stanford dependency parses. Match paths and allow for path deletion and insertion.
Categorized in:
Natural Language
|
Natural Language Understanding
|
Question Answering
Sign in to Comment
Post comment
Cancel