Search Results for author:
Found 8 papers, 0 papers with code
Crisp-determinization of weighted tree automata over strong bimonoids
We also prove that both, the finiteness of ${\cal N}({\cal A})$ and the finite order property of ${\cal A}$ are undecidable.
Formal Languages and Automata Theory
Regular transductions with MCFG input syntax
We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars.
Weighted parsing for grammar-based language models
We show an algorithm which terminates and is correct for a large class of weighted grammar-based language models.
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures
We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures.
