This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for data-driven parsing. To speed up parsing, we use different context-summary estimates of parse items, some of them allowing for A* parsing. We evaluate our parser with grammars extracted from the German NeGra treebank. Our experiments show that data-driven LCFRS parsing is feasible and yields output of competitive quality.

This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs) is too limited to deal with certain syntactic phenomena, in particular, with scrambling in free-word-order languages. The TAG variants proposed so far in order to account for scrambling are not entirely satisfying. Therefore, the article introduces an alternative extension of TAG that is based on the notion of node sharing, so-called (restricted) tree-local multicomponent TAG with shared nodes (RSN-MCTAG). The analysis of some German scrambling data is sketched in order to show that this TAG extension can deal with scrambling. Then it is shown that for RSN-MCTAGs of a specific type, equivalent simple range concatenation grammars can be constructed. As a consequence, these RSN-MCTAGs are mildly context-sensitive and in particular polynomially parsable. These specific RSN-MCTAGs probably can deal not with all scrambling phenomena, but with an arbitrarily large subset.