Báo cáo khoa học: "Describing Syntax with Star-Free Regular Expressions" ppt

... Papert, 1971). Sometimes star-freeness of a language can be shown by means of closure properties of star-free languages. To start with, finite regular languages are star-free (especially 0, 6, ... described with a star-free regular expression if it can be constructed from alphabet symbols by application of union (A U B), complementation (A) and finite concatena- tion (AB), tha...

Ngày tải lên: 08/03/2014, 21:20

... State-of-art tweet re- trieval methods include a linear regression model bi- ased towards text quality with a regularization factor inspired by the hypothesis that documents similar in content may have ... Section 3.4). Fix some damping factor µ and say that at each time step with probability (1-µ) we stick to random walking and with probability µ we do not make a usual random walk step...

Ngày tải lên: 07/03/2014, 18:20

... or a rhetorical relation between them, while tex- tual parataxis deals with any adjacent facts from text planning, with no rhetorical connection between. In step 3), both types of parataxis ... expressions, which addresses the referring part, while little has ad- dressed the generation issues with respect to the other part, except that in (Scott and de Souza, 1990), the relation...

Ngày tải lên: 31/03/2014, 04:20

... PR with the V32I mutation; PR I50V , PR with the I50V mutation; PR I54M , PR with the I54M mutation; PR I54V , PR with the I54V mutation; PR I84V , PR with the I84V mutation; PR L90M , PR with ... compared with PR WT –SQV. (B) PR I50V –APV compared with PR I50V –SQV. (C) PR I54M –APV compared with PR I54M –SQV. (D) PR I54V –APV compared with PR I54V –SQV. (E) PR I84V –APV...

Ngày tải lên: 18/02/2014, 04:20

... R3. The PCR product with a size of  1.6 kb was digested with BamHI to obtain a fragment between the two copper-binding site coding regions and ligated to pBlueScript pKSII(+) with T4 DNA ligase ... R3-1501 – than R3- 0337 – . This pattern agrees with the presence of two different enzymes with overlapping activities. Purification of two enzymes with different affinities for monophen...

Ngày tải lên: 19/02/2014, 07:20

... regular tree language. A regular tree grammar (RTG) closely resembles a context free grammar (CFG), and is a way of de- scribing a language of trees. Formally, define T Σ as the set of trees with ... a pattern with which to expand it and then filling out that pattern with words drawn from a unigram distribution. This kind of coupled generative process can be naturally formalized with...

Ngày tải lên: 19/02/2014, 19:20

... alignment model. We formulate a syn- onym pair generative model with a topic variable and use this model as a regularization term with a bilingual word alignment model. The topic vari- able in ... parameter set of our model. 3.2 Word Alignment with Synonym Regularization In this section, we extend the bilingual genera- tive model (HM-BiTAM) with our synonym pair model. Our expectation...

Ngày tải lên: 20/02/2014, 04:20

... infrastructure to sup- port the creation of, experimentation with, and evaluation of coreference resolvers. Reconcile was designed with the following seven desiderata in mind: • implement the ... present). The basic architecture of the system includes five major steps. Starting with a corpus of docu- ments together with a manually annotated corefer- ence resolution answer key 1 , Reconc...

Ngày tải lên: 20/02/2014, 04:20

Ngày tải lên: 20/02/2014, 04:20

... instance with the minimal τ(c i k ), 2) the bracketable instance with the maximal τ(c i k ), 3) the unbracketable instance with the minimal τ(c i k ), and 4) the unbracketable instance with the maximal ... the effects of syntax- driven features and differences of 1-best translation out- puts. 5.1 Effects of Syntax- Driven Features We conducted further experiments using individ- ual...

Ngày tải lên: 20/02/2014, 07:20