Name
Abstract | ||
|---|---|---|
Accurately segmenting a citation string into fields for authors, titles, etc. is a challenging task because the output typically obeys various global constraints. Previous work has shown that modeling soft constraints, where the model is encouraged, but not require to obey the constraints, can substantially improve segmentation performance. On the other hand, for imposing hard constraints, dual decomposition is a popular technique for efficient prediction given existing algorithms for unconstrained inference. We extend dual decomposition to perform prediction subject to soft constraints. Moreover, with a technique for performing inference given soft constraints, it is easy to automatically generate large families of constraints and learn their costs with a simple convex optimization problem during training. This allows us to obtain substantial gains in accuracy on a new, challenging citation extraction dataset. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3115/v1/P14-1056 | PROCEEDINGS OF THE 52ND ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1 |
DocType | Volume | Citations |
Journal | abs/1403.1349 | 6 |
PageRank | References | Authors |
0.42 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sam Anzaroot | 1 | 26 | 2.61 |
| Passos, Alexandre | 2 | 4083 | 167.18 |
| David Belanger | 3 | 192 | 8.82 |
| Andrew Kachites McCallumzy | 4 | 19203 | 1588.22 |