Báo cáo khoa học: "Probabilistic CFG with latent annotations" docx

... parse trees that we call PCFG with latent annotations (PCFG-LA). This model is an extension of PCFG models in which non-terminal symbols are anno- tated with latent variables. The latent variables work just ... model of parse trees, which we call PCFG-LA. This model is an extension of PCFG in which non-terminal symbols are augmented with latent variables. Fine- grained CFG rul...

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

... in linear-chain structure. It could be ex- tended to other latent conditional models with tree structure (e.g., syntactic parsing with latent vari- ables), as long as it allows efficient combination of ... inclusion of latent vari- ables. In this paper, we propose a new inference al- gorithm, latent dynamic inference (LDI), by sys- tematically combining an efficient search strategy...

Ngày tải lên: 17/03/2014, 22:20

... text. To begin with, we preprocess each document. A training text is preprocessed by ran- domly replacing 10% of its common nouns with the label UNSEEN. If an NP, NP k , is replaced with UN- SEEN, ... of whether the NP appears in the key or the response. Note that CEAF can compare partitions with twin- less NPs without any modification, since it operates by finding the best alignment bet...

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

... domains with large numbers of facts and rhetorical relations, there can be more than one pos- sible tree representing the intended content. These different trees will be realized as texts with different sentence ... (4) would assign lower and lower probabilities to sentences with large numbers of features. Since we need to compare sentence pairs with varied numbers of features, we wil...

Ngày tải lên: 23/03/2014, 19: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

... population(PLACE). Intuitively, an RTG is a CFG where the yield of every parse is itself a tree. In fact, for any CFG G, it 1 See Liang et al. (2011) for work in representing lambda calculus expressions with trees. is straightforward ... 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 pr...

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

... meanings of synonyms. We extend HM-BiTAM, which is a HMM-based word align- ment model with a latent topic, with a novel syn- onym pair generative model. We applied the pro- posed method to an ... alignment models. To con- firm the effect of the synonym pair model with latent topics, we also tested GIZA++ and HM- BiTAM with what we call Synonym Replacement Heuristics (SRH), where al...

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