in Zeitschriften
Weighted two-way transducers Inf. Comput. bib |
http | Share-Link ]Weighted tree automata with constraints Theory Comput. Syst. bib | http ]Compositions of weighted extended tree transducers — The unambiguous case Int. J. Found. Comput. Sci. bib |
http ]Combinatory categorial grammars as
generators of weighted forests Inf. Comput. bib |
http ]Ambiguity hierarchies for weighted tree automata Int. J. Found. Comput. Sci. bib |
http ]Compositions with constant weighted extended tree transducers Int. J. Found. Comput. Sci. bib |
http ]The tree-generative capacity of combinatory categorial grammars J. Comput. Syst. Sci. bib |
http ]Strong equivalence of TAG and CCG Trans. ACL bib |
http ]Compositions of tree-to-tree statistical
machine translation models Int.
J. Found. Comput. Sci. bib |
http ]Pushing for weighted tree
automata Log.
Methods Comput. Sci. bib |
http |
arXiv ]Multiple context-free tree grammars
— Lexicalization and characterization Theor. Comput. Sci. bib |
http |
arXiv ]Synchronous forest substitution grammars Acta Cybernet. bib | http ]Composition closure of linear
extended top-down tree transducers Theory Comput. Syst. bib |
http |
free access ]Survey: Finite-state technology in natural language processing Theor. Comput. Sci. bib | http ]Linking theorems for tree transducers J. Comput. Syst. Sci. bib | http ]The power of weighted regularity-preserving multi bottom-up tree transducers Int. J. Found. Comput. Sci. bib | http ]Hyper-optimization for deterministic tree automata Theor. Comput. Sci. bib | http ]DIMwid — Decoder inspection for Moses (using widgets) The Prague Bulletin of Mathematical Linguistics bib | http ]Hyper-minimization for deterministic tree automata Int. J. Found. Comput. Sci. bib | http ]Unweighted and weighted hyper-minimization Int. J. Found. Comput. Sci. bib | http ]The category of simulations for weighted tree automata Int. J. Found. Comput. Sci. bib | http ]Optimal hyper-minimization Int. J. Found. Comput. Sci. bib | http | arXiv ]Survey: Weighted extended top-down tree transducersFundam. Inform. bib | http ]Part I: Basics and expressive power of Survey: Weighted extended top-down tree transducersActa Cybernet. bib | http ]Fundam. Inform. bib | http ]An alternative to synchronous tree substitution grammars Natural Language Engineering bib | http ]An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton Theor. Comput. Sci. bib | http ]MAT learners for tree series — An abstract data type and two realizationsActa Inf. bib | http | free access ]Properties of quasi-alphabetic tree bimorphisms Int. J. Found. Comput. Sci. bib | http | arXiv ]Extended multi bottom-up tree transducers — Composition and decompositionActa Inf. bib | http | free access ]Minimizing deterministic weighted tree automata Inf. Comput. bib | http ]Fundam. Inform. bib | http ]Backward and forward bisimulation minimization of tree automata Theor. Comput. Sci. bib | http ]The power of extended top-down tree transducers SIAM J. Comput. bib | http ]Compositions of extended top-down tree transducers Inf. Comput. bib | http ]A Kleene theorem for weighted tree automata over distributive multioperator monoids Theory Comput. Syst. bib | http | free access
]Pure and o-substitution Int. J. Found. Comput. Sci. bib | http ]Cut sets as recognizable tree languages Fuzzy Sets and Syst. bib | http ]Compositions of tree series transformations Theor. Comput. Sci. bib | http ]Incomparability results for classes of polynomial tree series transformations J. Autom. Lang. Combin. bib ]Relating tree series transducers and weighted tree automata Int. J. Found. Comput. Sci. bib | http ]Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations Theor. Comput. Sci. bib | http ]Bounds for tree automata with polynomial costs J. Autom. Lang. Combin. bib ]
in Tagungsbänden
Pumping lemmata for recognizable weighted languages over Artinian semirings Proc. 16th Int. Conf. Automata und Formal Languages 386 von EPTCS ,
Seiten 155–169, © 2023.
— [ bib |
http ]Weighted bottom-up and top-down tree transformations are incomparable Proc. 27th Int. Conf. Implementation and Application of Automata 14151 von LNCS ,
Seiten 218–229, © Springer-Verlag, 2023.
— [ bib |
http ]Weighted two-way transducers Proc. 9th Int. Conf. Developments in Language Theory 13706 von LNCS ,
Seiten 101–114, © Springer-Verlag, 2022.
— [ bib |
http ]Weighted tree automata with constraints Proc. 26th Int. Conf. Developments in Language Theory 13257 von LNCS ,
Seiten 226–238, © Springer-Verlag, 2022.
— [ bib |
http ]Compositions of constant weighted extended
tree transducers Proc. 25th Int. Conf. Developments in Language Theory 12811 von LNCS ,
Seiten 66–77, © Springer-Verlag, 2021.
— [ bib |
http ]Ambiguity hierarchies for
weighted tree automata Proc. 25th Int. Conf. Implementation and Application of
Automata 12803 von LNCS ,
Seiten 140–151, © Springer-Verlag, 2021.
— [ bib |
http ]On tree substitution grammars Proc. 24th Int. Conf. Developments in Language Theory 12086 von LNCS ,
Seiten 237–250, © Springer-Verlag, 2020.
— [ bib |
http ]The tree-generative capacity of
combinatory categorial grammars Proc. 39th Ann. Conf. Foundations of Software Technology
and Theoretical Computer Science 150 von LIPIcs ,
Artikel 44:1–14, © Schloss Dagstuhl, 2019.
— [ bib |
http ]Composition closure of linear weighted
extended top-down tree transducer Proc. 24th Int. Conf. Implementation and Application of
Automata 11601 von LNCS ,
Seiten 133–145, © Springer-Verlag, 2019.
— [ bib |
http |
Folien ]Recurrent neural networks as
weighted language recognizers Proc. 16th HLT Conf. North American Chapter of the Association
for Computational Linguistics bib |
http |
arXiv ]Multiple context-free tree grammars and multi-component tree adjoining grammars Proc. 21st Int. Symp. Fundamentals of Computation Theory 10472 von LNCS , Seiten 217–229, © Springer-Verlag, 2017.
— [ bib | http | Folien ]Compositions of tree-to-tree statistical machine translation models Proc. 20th Int. Conf. Developments in Language Theory 9840 von LNCS , Seiten 293–305, © Springer-Verlag, 2016.
— [ bib | http | Folien ]A systematic evaluation of MBOT in statistical machine translation Proc. 15th MT Summit bib | http ]Discontinuous statistical machine translation with target-side dependency syntax Proc. 10th Int. Workshop on Statistical Machine Translation bib | http ]String-to-tree multi bottom-up tree transducers Proc. 53rd Annual Meeting of the Association for Computational Linguistics bib | http ]Finite-state technology in natural language processing (eingeladener Vortrag)Proc. 20th Int. Conf. Implementation and Application of Automata 9223 von LNCS , Seiten XVII–XIX, © Springer-Verlag, 2015.
— [ bib | http | Folien ]Extended tree transducers in natural language processing (eingeladener Vortrag)Proc. 12th Int. Conf. Finite-State Methods and Natural Language Processing bib | http | Folien ]Linking theorems for tree transducers Proc. 3rd Int. Workshop Trends in Tree Automata and Tree Transducers , 2015.
— [ bib | http ]A tunable language model for statistical machine translation Proc. 11th Int. Conf. Association for Machine Translation in the Americas bib | http ]The power of regularity-preserving multi bottom-up tree transducers Proc. 19th Int. Conf. Implementation and Application of Automata 8587 von LNCS , Seiten 278–289, © Springer-Verlag, 2014.
— [ bib | http | Folien ]Hyper-minimization for deterministic weighted tree automata Proc. 14th Int. Conf. Automata and Formal Languages 151 von EPTCS , Seiten 314–326, 2014.
— [ bib | http | Folien ]Random generation of nondeterministic tree automata Proc. 2nd Int. Workshop Trends in Tree Automata and Tree Transducers 134 von EPTCS , Seiten 11–16, 2013.
— [ bib | http | Folien ]Synchronous forest substitution grammars Proc. 5th Int. Conf. Algebraic Informatics 8080 von LNCS , Seiten 235–246, © Springer-Verlag, 2013.
— [ bib | http | Folien ]Shallow local multi bottom-up tree transducers in statistical machine translation Proc. 51st Annual Meeting Association for Computational Linguistics bib | http ]Hyper-optimization for deterministic tree automata Proc. 18th Int. Conf. Implementation and Application of Automata 7982 von LNCS , Seiten 244–255, © Springer-Verlag, 2013.
— [ bib | http | Folien ]Composition closure of ε-free linear extended top-down tree transducers Proc. 17th Int. Conf. Developments in Language Theory 7907 von LNCS , Seiten 239–251, © Springer-Verlag, 2013.
— [ bib | http | Folien ]Unidirectional derivation semantics for synchronous tree-adjoining grammars Proc. 16th Int. Conf. Developments in Language Theory 7410 von LNCS , Seiten 368–379, © Springer-Verlag, 2012.
— [ bib | http | Folien ]Every sensible extended top-down tree transducer is a multi bottom-up tree transducer Proc. 12th HLT Conf. North American Chapter of the Association for Computational Linguistics bib | http | Poster ]Strong lexicalization of tree adjoining grammars Proc. 50th Annual Meeting Association for Computational Linguistics bib | http | Folien ]Preservation of recognizability for weighted linear extended top-down tree transducers Proc. 2nd Workshop Applications of Tree Automata in Natural Language Processing bib | http ]Composing extended top-down tree transducers Proc. 13th Int. Conf. European Chapter of the Association for Computational Linguistics bib | http ]Hyper-minimization for deterministic tree automata Proc. 17th Int. Conf. Implementation and Application of Automata 7381 von LNCS , Seiten 217–228, © Springer-Verlag, 2012.
— [ bib | http | Folien ]Part III: Composition of Survey: Weighted extended top-down tree transducers (eingeladener Vortrag)Proc. Workshop Algebraic Foundations in Computer Science 7020 von LNCS , Seiten 272–308, © Springer-Verlag, 2011.
— [ bib | http | Folien ]Tree transformations and dependencies (eingeladener Vortrag)Proc. 12th Meeting Mathematics of Language 6878 von LNAI , Seiten 1–20, © Springer-Verlag, 2011.
— [ bib | http | Folien ]Pushing for weighted tree automata Proc. 36th Int. Symp. Mathematical Foundations of Computer Science 6907 von LNCS , Seiten 460–471, © Springer-Verlag, 2011.
— [ bib | http ]Computing all l-cover automata fast Proc. 16th Int. Conf. Implementation and Application of Automata 6807 von LNCS , Seiten 203–214, © Springer-Verlag, 2011.
— [ bib | http ]Notes on hyper-minimization (eingeladener Vortrag)Proc. 13th Int. Conf. Automata and Formal Languages bib | Folien ]Hyper-minimisation of deterministic weighted finite automata over semifields Proc. 13th Int. Conf. Automata and Formal Languages bib | Folien ]How to train your multi bottom-up tree transducer Proc. 49th Annual Meeting Association for Computational Linguistics bib | http | Folien ]On minimising automata with errors Proc. 36th Int. Symp. Mathematical Foundations of Computer Science 6907 von LNCS , Seiten 327–338, © Springer-Verlag, 2011.
— [ bib | http | arXiv ]Survey : Tree transducers in machine translationProc. 2nd Workshop Non-Classical Models of Automata and Applications 263 von books@ocg.at , Seiten 11–32, © Österreichische Computer Gesellschaft, 2010.
— [ bib | Folien ]Input and output products for weighted extended top-down tree transducers Proc. 14th Int. Conf. Developments in Language Theory 6224 von LNCS , Seiten 316–327, © Springer-Verlag, 2010.
— [ bib | http | Folien ]Simulations of weighted tree automata Proc. 15th Int. Conf. Implementation and Application of Automata 6482 von LNCS , Seiten 321–330, © Springer-Verlag, 2011.
— [ bib | http | arXiv | Folien ]Better hyper-minimization — not as fast, but fewer errors Proc. 15th Int. Conf. Implementation and Application of Automata 6482 von LNCS , Seiten 201–210, © Springer-Verlag, 2011.
— [ bib | http | Folien ]Simulation vs. equivalence Proc. 6th Int. Conf. Foundations of Computer Science bib | arXiv ]Preservation of recognizability for synchronous tree substitution grammars Proc. 1st Workshop Applications of Tree Automata in Natural Language Processing bib | http ]Parsing and translation algorithms based on weighted extended tree transducers Proc. 1st Workshop Applications of Tree Automata in Natural Language Processing bib | http | Folien ]A tree transducer model for synchronous tree-adjoining grammars Proc. 48th Annual Meeting Association for Computational Linguistics bib | http | Folien ]Why synchronous tree substitution grammars? Proc. 11th HLT Conf. North American Chapter of the Association for Computational Linguistics bib | http | Folien ]Parsing algorithms based on tree automata Proc. 11th Int. Conf. Parsing Technologies bib | http | Folien ]An n log n algorithm for hyper-minimizing states in a (minimized) deterministic automaton Proc. 14th Int. Conf. Implementation and Application of Automata 5642 von LNCS , Seiten 4–13, © Springer-Verlag, 2009.
— [ bib | http ]Minimizing weighted tree grammars using simulation Proc. 8th Int. Workshop Finite-State Methods and Natural Language Processing 6062 von LNAI , Seiten 56–68, © Springer-Verlag, 2010.
— [ bib | http | Folien ]Compositions of top-down tree transducers with ε-rules Proc. 8th Int. Workshop Finite-State Methods and Natural Language Processing 6062 von LNAI , Seiten 69–80, © Springer-Verlag, 2010.
— [ bib | http | Folien ]Syntax-directed translations and quasi-alphabetic tree bimorphisms — revisited Proc. 3rd Int. Conf. Algebraic Informatics 5725 von LNCS , Seiten 305–317, © Springer-Verlag, 2009.
— [ bib | http ]A backward and a forward simulation for weighted tree automata Proc. 3rd Int. Conf. Algebraic Informatics 5725 von LNCS , Seiten 288–304, © Springer-Verlag, 2009.
— [ bib | http | Folien ]Tree-series-to-tree-series transformations Proc. 13th Int. Conf. Implementation and Application of Automata 5148 von LNCS , Seiten 132–140, © Springer-Verlag, 2008.
— [ bib | http | Folien ]Extended multi bottom-up tree transducers Proc. 12th Int. Conf. Developments in Language Theory 5257 von LNCS , Seiten 289–300, © Springer-Verlag, 2008.
— [ bib | http | Folien ]Minimizing deterministic weighted tree automata Proc. 2nd Int. Conf. Language and Automata Theory and Applications 5196 von LNCS , Seiten 357–372, © Springer-Verlag, 2008.
— [ bib | http | Folien ]Myhill-Nerode theorem for recognizable tree series — revisited Proc. 8th Int. Conf. Latin American Theoretical Informatics 4957 von LNCS , Seiten 106–120, © Springer-Verlag, 2008.
— [ bib | http | Folien ]Learning deterministically recognizable tree series revisited Proc. 2nd Int. Conf. Algebraic Informatics 4728 von LNCS , Seiten 218–235, © Springer-Verlag, 2007.
— [ bib | http | Folien ]Bisimulation minimisation for weighted tree automata Proc. 11th Int. Conf. Developments in Language Theory 4588 von LNCS , Seiten 229–241, © Springer-Verlag, 2007.
— [ bib | http ]Myhill-Nerode theorem for recognizable tree series revisited Proc. 1st Int. Conf. AutoMathA: From Mathematics to Applications bib | Folien ]Backward and forward bisimulation minimisation of tree automata Proc. 12th Int. Conf. Implementation and Application of Automata 4783 von LNCS , Seiten 109–121, © Springer-Verlag, 2007.
— [ bib | http ]Compositions of extended top-down tree transducers Proc. 1st Int. Conf. Language and Automata Theory and Applications bib | http | Folien ]Does o-substitution preserve recognizability? Proc. 11th Int. Conf. Implementation and Application of Automata 4094 von LNCS , Seiten 150–161, © Springer-Verlag, 2006.
— [ bib | http | Folien ]The substitution vanishes Proc. 11th Int. Conf. Algebraic Methodology and Software Technology 4019 von LNCS , Seiten 173–188, © Springer-Verlag, 2006.
— [ bib | http | Anhang ]Hierarchies of tree series transformations revisited Proc. 10th Int. Conf. Developments in Language Theory 4036 von LNCS , Seiten 215–225, © Springer-Verlag, 2006.
— [ bib | http | Folien ]The power of tree series transducers of type I and II Proc. 9th Int. Conf. Developments in Language Theory 3572 von LNCS , Seiten 338–349, © Springer-Verlag, 2005.
— [ bib | http | Folien ]Compositions of bottom-up tree series transformations Proc. 11th Int. Conf. Automata and Formal Languages bib | Folien ]Myhill-Nerode theorem for sequential transducers over unique GCD-monoids Proc. 9th Int. Conf. Implementation and Application of Automata 3317 von LNCS , Seiten 323–324, © Springer-Verlag, 2004.
— [ bib | http | Langversion | Poster ]Relating tree series transducers and weighted tree automata Proc. 8th Int. Conf. Developments in Language Theory 3340 von LNCS , Seiten 321–333, © Springer-Verlag, 2004.
— [ bib | http | Folien ]
Technische Berichte
MAT learners for tree series — An abstract data type and two realizationsbib | http ]An n log n algorithm for hyper-minimizing states in a (minimized) deterministic automaton bib | http ]Bisimulation minimisation of weighted automata on unranked tree bib | http ]Bisimulation minimisation of weighted tree automata bib | http ]Backward and forward bisimulation minimisation of tree automata bib | http ]Pure and o-substitution bib | http ]Compositions of tree series transformations bib | http ]Inclusion diagrams for classes of deterministic bottom-up tree-to-tree-series transformations bib | http ]Incomparability results for classes of polynomial tree series transformations bib | http ]