The problem with probabilistic DAG automata for semantic graphs

Ieva Vasiljeva; Sorcha Gilroy; Adam Lopez

The problem with probabilistic DAG automata for semantic graphs

Ieva Vasiljeva, Sorcha Gilroy, Adam Lopez

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Semantic representations in the form of directed acyclic graphs (DAGs) have been introduced in recent years, and to model them, we need probabilistic models of DAGs. One model that has attracted some attention is the DAG automaton, but it has not been studied as a probabilistic model. We show that some DAG automata cannot be made into useful probabilistic models by the nearly universal strategy of assigning weights to transitions. The problem affects single-rooted, multi-rooted, and unbounded-degree variants of DAG automata, and appears to be pervasive. It does not affect planar variants, but these are problematic for other reasons.

Original language	English
Title of host publication	Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics
Place of Publication	Minneapolis, Minnesota
Publisher	Association for Computational Linguistics
Pages	902–911
Number of pages	9
Volume	1
Publication status	Published - 7 Jun 2019
Event	2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics - Minneapolis, United States Duration: 2 Jun 2019 → 7 Jun 2019 https://naacl2019.org/

Conference

Conference	2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Abbreviated title	NAACL-HLT 2019
Country/Territory	United States
City	Minneapolis
Period	2/06/19 → 7/06/19
Internet address	https://naacl2019.org/

Access to Document

The problem with probabilistic_VASILJEVA_DoA220219_AFVAccepted author manuscript, 256 KB

Cite this

@inproceedings{2ca4635e4fe942078ff9fe3640235e77,

title = "The problem with probabilistic DAG automata for semantic graphs",

abstract = "Semantic representations in the form of directed acyclic graphs (DAGs) have been introduced in recent years, and to model them, we need probabilistic models of DAGs. One model that has attracted some attention is the DAG automaton, but it has not been studied as a probabilistic model. We show that some DAG automata cannot be made into useful probabilistic models by the nearly universal strategy of assigning weights to transitions. The problem affects single-rooted, multi-rooted, and unbounded-degree variants of DAG automata, and appears to be pervasive. It does not affect planar variants, but these are problematic for other reasons.",

author = "Ieva Vasiljeva and Sorcha Gilroy and Adam Lopez",

year = "2019",

month = jun,

day = "7",

language = "English",

volume = "1",

pages = "902–911",

booktitle = "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics",

publisher = "Association for Computational Linguistics",

note = "2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics, NAACL-HLT 2019 ; Conference date: 02-06-2019 Through 07-06-2019",

url = "https://naacl2019.org/",

}

Vasiljeva, I, Gilroy, S & Lopez, A 2019, The problem with probabilistic DAG automata for semantic graphs. in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. vol. 1, Association for Computational Linguistics, Minneapolis, Minnesota, pp. 902–911, 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Minneapolis, Minnesota, United States, 2/06/19. <https://www.aclweb.org/anthology/N19-1096>

The problem with probabilistic DAG automata for semantic graphs. / Vasiljeva, Ieva; Gilroy, Sorcha ; Lopez, Adam.

Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. Vol. 1 Minneapolis, Minnesota : Association for Computational Linguistics, 2019. p. 902–911.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - The problem with probabilistic DAG automata for semantic graphs

AU - Vasiljeva, Ieva

AU - Gilroy, Sorcha

AU - Lopez, Adam

PY - 2019/6/7

Y1 - 2019/6/7

N2 - Semantic representations in the form of directed acyclic graphs (DAGs) have been introduced in recent years, and to model them, we need probabilistic models of DAGs. One model that has attracted some attention is the DAG automaton, but it has not been studied as a probabilistic model. We show that some DAG automata cannot be made into useful probabilistic models by the nearly universal strategy of assigning weights to transitions. The problem affects single-rooted, multi-rooted, and unbounded-degree variants of DAG automata, and appears to be pervasive. It does not affect planar variants, but these are problematic for other reasons.

AB - Semantic representations in the form of directed acyclic graphs (DAGs) have been introduced in recent years, and to model them, we need probabilistic models of DAGs. One model that has attracted some attention is the DAG automaton, but it has not been studied as a probabilistic model. We show that some DAG automata cannot be made into useful probabilistic models by the nearly universal strategy of assigning weights to transitions. The problem affects single-rooted, multi-rooted, and unbounded-degree variants of DAG automata, and appears to be pervasive. It does not affect planar variants, but these are problematic for other reasons.

M3 - Conference contribution

VL - 1

SP - 902

EP - 911

BT - Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics

PB - Association for Computational Linguistics

CY - Minneapolis, Minnesota

T2 - 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics

Y2 - 2 June 2019 through 7 June 2019

ER -

The problem with probabilistic DAG automata for semantic graphs

Abstract

Conference

Access to Document

Fingerprint

Cite this