Bottom-up unranked tree-to-graph transducers for translation into semantic graphs

DOI10.1016/j.tcs.2020.12.012zbMath1504.68095OpenAlexW3111263700MaRDI QIDQ2029483

Giorgio Satta, Shay B. Cohen, Johanna Björklund, Frank Drewes

Publication date: 3 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.012

zbMATH Keywords

weighted automatonsemantic graphsemantic parsingtree-to-graph transduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of typechecking top-down XML transformations
• Hyperedge replacement: grammars and languages
• Frontiers of tractability for typechecking simple XML transformations
• On the minimization of XML schemas and tree automata for unranked trees
• Typechecking top-down XML transformations: Fixed input or output schemas
• LR-parsing of extended context free grammars
• A generalization of Dijkstra's algorithm
• The equivalence of bottom-up and top-down tree-to-graph transducers
• The translation power of top-down tree-to-graph transducers
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• A comparison of compatible, finite, and inductive graph properties
• Z-automata for compact and direct representation of unranked tree languages
• Weighted logics for unranked tree automata
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
• Head-Driven Statistical Models for Natural Language Parsing
• The Power of Extended Top-Down Tree Transducers
• Graph expressions and graph rewritings
• An improved isomorphism test for bounded-tree-width graphs
• Logics for Unranked Trees: An Overview
• Algebraic automata and context-free sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Rewriting Techniques and Applications

This page was built for publication: Bottom-up unranked tree-to-graph transducers for translation into semantic graphs