Steps to Excellence: Simple Inference with Refined Scoring of Dependency Trees
Much of the recent work on dependency parsing has been focused on solving inherent combinatorial problems associated with rich scoring functions. In contrast, we demonstrate that highly expressive scoring functions can be used with substantially simpler inference procedures. Specifically, we introdu...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computational Linguistics
2015
|
| Online Access: | http://hdl.handle.net/1721.1/99746 https://orcid.org/0000-0003-3121-0185 https://orcid.org/0000-0002-2921-8201 https://orcid.org/0000-0002-2199-0379 https://orcid.org/0000-0003-4644-3088 |