Abstract not found

I describe a head-driven parser for a class of grammars that handle discontinuous constituency by a richer notion of string combination than ordinary concatenation. The parser is a generalization of the left-corner parser (Matsumoto et al., 1983) and can be used for grammars written in power

This paper discusses the consequences of allowing discontinuous constituents in syntactic representions and phrase-structure rules, and the resulting complications for a standard parser of phrase-structure grammar. It is argued, first, that discontinuous constituents seem inevitable in a phrase

We discuss a generalization of Earley's algorithm to grammars licensing discontinuous constituents of the kind proposed by the so-called linearization approaches in Head-Driven Phrase Structure Grammar. We show that one can replace the standard indexing on the string position by bitmasks

Abstract. We argue that an approach to discontinuous constituency via prosodic lambda binding initiated by

This paper is concerned with an evaluation of non-CFG parsing to handle word order variation and discontinuous constituency in Japanese. Although these phenomena constitute distinctive characteristics of the language, currently there is a dearth of computational grammars in which they can

show that an output quality can be achieved which is comparable to the output quality of PCFG-based systems. In most constituency treebanks, sentence annotation is restricted to having the shape of trees without crossing branches, and the non-local dependencies induced by the discontinuities

represent left-to-right order of constituents. True discontinuities in SG are viewed as differences between immediate dominance (ID) relations in c-structures and those in corresponding f-structures. Constructions which are treated in this way include clause union, right dislocation, and fronting. Separable

Abstract not found

This paper proposes a direct parsing of non-local dependencies in English. To this end,we useprobabilisticlinearcontext-free rewriting systems for data-driven parsing, following recent work on parsing German. Inordertodoso,wefirstperformatransformation of the Penn Treebank annotation of non-local dependencies into an annotation usingcrossingbranches. Theresultingtreebank can be used for PLCFRS-based parsing. Our evaluation shows that, compared to PCFG parsing with the same techniques, PLCFRS parsing yields slightly better results. Inparticularwhenevaluatingonlythe parsingresultsconcerninglong-distancedependencies,thePLCFRSapproachwithdiscontinuousconstituentsis able to recognize about88 % of the dependenciesof type *T* and *T*-PRN encoded in the Penn Treebank. Even the evaluation results concerning local dependencies, which can in principle be captured by a PCFG-based model, are better with our PLCFRS model. This demonstratesthatbydiscardinginformation onnon-localdependenciesthePCFGmodel losesimportantinformationonsyntacticdependenciesin general. 1