Yli-Jyrä , A M & Gómez-Rodríguez , C 2017 , Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing . in R Barzilay & M-Y Kan (eds) , The Annual Meeting of the Association for Computational Linguistics . vol. 55 , The Association for Computational Linguistics , Stroudsburg , pp. 1745-1755 , Annual Meeting of the Association for Computational Linguistics , Vancouver , Canada , 30/07/2017 . https://doi.org/10.18653/v1/P17-1160
Title: | Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing |
Author: | Yli-Jyrä, Anssi Mikael; Gómez-Rodríguez, Carlos |
Editor: | Barzilay, Regina; Kan, Min-Yen |
Contributor: | University of Helsinki, Department of Modern Languages 2010-2017 |
Publisher: | The Association for Computational Linguistics |
Date: | 2017 |
Number of pages: | 11 |
Belongs to series: | The Annual Meeting of the Association for Computational Linguistics |
ISBN: | 978-1-945626-75-3 |
URI: | http://hdl.handle.net/10138/307772 |
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. |
Subject: |
6121 Languages
dependency graphs semantic graphs ambiguity 113 Computer and information sciences homomorphic representations of languages context-free parsing constrained inference dependency graphs acyclicity connectivity ambiguity monadic second-order logic Courcelle's theorem 111 Mathematics integer sequences OEIS enumerative graph theory |
Rights: |
Total number of downloads: Loading...
Files | Size | Format | View |
---|---|---|---|
P17_1160.pdf | 242.4Kb |
View/ |