Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483): Difference between revisions

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

Latest revision as of 22:11, 25 July 2024

scientific article
Language Label Description Also known as
English
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
scientific article

    Statements

    Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 June 2021
    0 references
    semantic parsing
    0 references
    semantic graph
    0 references
    tree-to-graph transduction
    0 references
    weighted automaton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers