In the paper [MTT] a conceptuel description of compactifications of moduli spaces of stable vector bundles on surfaces has been given, whose boundaries consist of vector bundles on trees of sufaces. In this article a typical basic case for the projective plane is described explicitly including the constrution of a relevant Kirwan blow up.

For several languages only potentially non-projective dependency parses are readily available. Projectivizing the parses and utilizing them in syntax-based translation systems often yields particularly bad translation results indicating that those translation models cannot properly utilize such information. We demonstrate that our system based on multi bottom-up tree transducers, which can nati...

this paper investigates learner-initiated responses to english language teachers’ referential questions and learner initiatives after teachers’ feedback moves in meaning-focused question-answer sequences to analyze how interactional practices of language teachers, their initiation and feedback moves, facilitate learner initiatives. classroom discourse research has largely neglected learner init...

........................................................................................................................................................ i Acknowledgements ....................................................................................................................................iii Contributions...............................................................................

With the rapid advancement of information and internet technologies, engineering software systems are now commercially available to aid engineering tasks, such as design, analysis, integrated manufacturing, and requirements modeling. Recent trend in computer aided engineering (CAE) includes the integration and smooth communication between existing CAE systems [1], management of knowledge for di...

This paper describes a treebanking project for Hindi/Urdu. We are annotating dependency syntax, lexical predicate-argument structure, and phrase structure syntax in a coordinated and partly automated manner. The paper focuses on choices in syntactic representation, and the stages we think are most appropriate for annotating differnt types of information.

A generative statistical model of dependency syntax is proposed based on Tesni ere's classical theory. It provides a stochastic formalization of the original model of syntactic structure and augments it with a model of the string realization process, the latter which is lacking in Tesni ere's original work. The resulting theory models crossing dependency links, discontinuous nuclei and string m...

We introduce a framework for lightweight dependency syntax annotation. Our formalism builds upon the typical representation for unlabeled dependencies, permitting a simple notation and annotation workflow. Moreover, the formalism encourages annotators to underspecify parts of the syntax if doing so would streamline the annotation process. We demonstrate the efficacy of this annotation on three ...