The Power of Extended Top-Down Tree Transducers

DOI10.1137/070699160zbMATH Open1200.68257OpenAlexW1988267965MaRDI QIDQ3558008FDOQ3558008

Authors:

Publication date: 29 April 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/68cba7b8473d4318ea12cf89a110135d7d0df25b

Recommendations

• Compositions of extended top-down tree transducers
• scientific article; zbMATH DE number 4119634
• Extended multi bottom-up tree transducers
• Extended Multi Bottom-Up Tree Transducers
• Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
• The translation power of top-down tree-to-graph transducers
• The power of regularity-preserving multi bottom-up tree transducers
• Survey: Weighted extended top-down tree transducers. III. Composition
• Superlinear deterministic top-down tree transducers
• Publication:4934332

zbMATH Keywords

hierarchynatural language processingtree transducercomposition closure

Mathematics Subject Classification ID

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

Cited In (39)

• Compositions of extended top-down tree transducers
• Equational weighted tree transformations with discounting
• Title not available (Why is that?)
• Compositions of constant weighted extended tree transducers
• Composition closure of \(\varepsilon \)-free linear extended top-down tree transducers
• The power of regularity-preserving multi bottom-up tree transducers
• Look-ahead removal for total deterministic top-down tree transducers
• Shape preserving top-down tree transducers.
• Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
• High level tree transducers and iterated pushdown tree transducers
• Extended Multi Bottom-Up Tree Transducers
• Equational tree transformations
• Tree-to-graph transductions with scope
• Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
• Survey: Weighted extended top-down tree transducers. III. Composition
• Extended symbolic finite automata and transducers
• The power of weighted regularity-preserving multi bottom-up tree transducers
• Compositions of tree-to-tree statistical machine translation models
• Title not available (Why is that?)
• Determinacy and rewriting of functional top-down and MSO tree transformations
• Decision problems of tree transducers with origin
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Linking theorems for tree transducers
• Applications of weighted automata in natural language processing
• Extended multi bottom-up tree transducers
• Properties of quasi-relabeling tree bimorphisms
• Earliest normal form and minimization for bottom-up tree transducers
• Compositions with Constant Weighted Extended Tree Transducers
• Compositions of Tree-to-Tree Statistical Machine Translation Models
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• A Pushdown Transducer Extension for the OpenFst Library
• Input strictly local tree transducers
• Linear context-free tree languages and inverse homomorphisms
• Decision problems of tree transducers with origin
• Superlinear deterministic top-down tree transducers
• Tree transformations and dependencies
• Composition closure of linear extended top-down tree transducers

This page was built for publication: The Power of Extended Top-Down Tree Transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558008)