Refine
Has Fulltext
- yes (5)
Is part of the Bibliography
- no (5)
Keywords
Institute
- Extern (3)
- Frankfurt Institute for Advanced Studies (FIAS) (1)
- Informatik (1)
- Physik (1)
The ALICE experiment at the LHC has studied J/psi production at mid-rapidity in pp collisions at sqrt{s}=7 TeV through its electron pair decay on a data sample corresponding to an integrated luminosity L_int = 5.6nb-1. The fraction of J/psi from the decay of long-lived beauty hadrons was determined for J/psi candidates with transverse momentum p_t>1.3 GeV/c and rapidity |y|<0.9. The cross section for prompt J/psi mesons, i.e. directly produced J/psi and prompt decays of heavier charmonium states such as the Psi(2S) and Csi_c resonances, is sigma_prompt-J/psi(pt > 1.3 GeV/c, |y| < 0.9) = 8.3 +- 0.8(stat.) +- 1.1(syst.) + 1.5 - 1.4(syst. pol.) micro barn. The cross section for the production of b-hadrons decaying to J/psi with p_t>1.3 GeV/c and |y|<0.9 is sigma_{J/psi<-h_B} = 1.46 +- 0.38(stat.) + 0.26 -0.32(syst.) micro barn. The results are compared to QCD model predictions. The shape of the p_t and y distributions of b-quarks predicted by perturbative QCD model calculations are used to extrapolate the measured cross section to derive the b-bbar pair total cross section and dsigma/dy at mid-rapidity.
In this paper, we present an open-source parsing environment (Tübingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German.
Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some languages can reveal themselves hard to describe because of specific characteristics, e.g. the free word order in German. In this context, we present (i) a framework allowing to describe tree-based grammars, and (ii) an actual fragment of a core multicomponent tree-adjoining grammar with tree tuples (TT-MCTAG) for German developed using this framework. This framework combines a metagrammar compiler and a parser based on range concatenation grammar (RCG) to respectively check the consistency and the correction of the grammar. The German grammar being developed within this framework already deals with a wide range of scrambling and extraction phenomena.
In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semantic representations.