Abstract
Semantic Dependency Parsing (SDP) is a deep semantic analysis task. A well-formed dependency scheme is the foundation of SDP. In this paper, we refine the HIT dependency scheme using stronger linguistic theories, yielding a dependency scheme with more clear hierarchy. To cover Chinese semantics more comprehensively, we make a break away from the constraints of dependency trees, and extend to graphs. Moreover, we utilize SVM to parse semantic dependency graphs on the basis of parsing of dependency trees.
| Original language | English |
|---|---|
| Pages (from-to) | 58-69 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science |
| Volume | 8801 |
| DOIs | |
| State | Published - 2014 |
Keywords
- Auto parsing of dependency graph
- Semantic analysis
- Semantic dependency graph
Fingerprint
Dive into the research topics of 'Dependency graph based Chinese semantic parsing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver