Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing
By: Researcher
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
Please contact us in case of a broken link from here
| Authors | Carlos Gómez-Rodríguez, Anssi Yli-Jyrä |
| Journal/Conference Name | ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers) |
| Paper Category | Artificial Intelligence |
| Paper Abstract | We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms one algorithm works for all when the search space can be controlled in parser input. |
| Date of publication | 2017 |
| Code Programming Language | Python |
| Comment |
Copyright Researcher 2022