Weighted DAG Automata for Semantic Graphs
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the frameworks of finite automata for strings and fi...
Main Authors: | David Chiang, Frank Drewes, Daniel Gildea, Adam Lopez, Giorgio Satta |
---|---|
Format: | Article |
Language: | English |
Published: |
The MIT Press
2017-12-01
|
Series: | Computational Linguistics |
Online Access: | http://dx.doi.org/10.1162/coli_a_00309 |
Similar Items
Ordered Tree Decomposition for HRG Rule Extraction
by: Daniel Gildea, et al.
Published: (2019-06-01)
by: Daniel Gildea, et al.
Published: (2019-06-01)
Similar Items
-
Weighted DAG Automata for Semantic Graphs
by: David Chiang, et al.
Published: (2018-03-01) -
Cache Transition Systems for Graph Parsing
by: Daniel Gildea, et al.
Published: (2017-12-01) -
Cache Transition Systems for Graph Parsing
by: Daniel Gildea, et al.
Published: (2018-03-01) -
The DAG−Width of Directed Graphs
by: Berwanger, D, et al.
Published: (2012) -
Characterizing DAG-depth of Directed Graphs
by: Matúš Bezek
Published: (2016-12-01)