نتایج جستجو برای: cfg pile

تعداد نتایج: 7518  

2002
Manny Rayner

CFG-based language models have become popular over the last few years, especially for commercial applications, and there is growing interest in creating complex CFG-based models for mixed initiative systems. On general grounds, it is attractive to attempt to compile these models from domain-independent descriptions written in high-level formalisms such as unification grammar. Experience to date...

2013
Yuan Zhang Regina Barzilay Amir Globerson

In this paper, we consider the problem of cross-formalism transfer in parsing. We are interested in parsing constituencybased grammars such as HPSG and CCG using a small amount of data specific for the target formalism, and a large quantity of coarse CFG annotations from the Penn Treebank. While all of the target formalisms share a similar basic syntactic structure with Penn Treebank CFG, they ...

2013
Heiko Mantel Henning Sudbrock

Before proving Lemma 1 from [MS13] we prove several propositions that relate paths in the graph PDG(CFG c ) where c is of the form if (e) then c1 else c2 fi, while (e) do c1 od, or c1; c2 to paths in the graphs PDG(CFG I,O c1 ) and (if applicable) PDG(CFG c2 ). In the proofs, we write p + k for the path that is obtained from p by adding k to each node on p that is a natural number, and leaving ...

1998
Hiroki Imai Hozumi Tanaka

In this paper, we propose a method for constructing bigram LR tables by way of incorporating bigram constraints into an LR table. Using a bigram LR table, it is possible for a GLR parser to make use of both bigram and CFG constraints in natural language processing. Applying bigram LR tables to our GLR method has the following advantages: (1) Language models utilizing bigram LR tables have lower...

Journal: :Bioresource technology 2013
Amélie Talec Myrvline Philistin Frédérique Ferey Günther Walenta Jean-Olivier Irisson Olivier Bernard Antoine Sciandra

Experiments were performed at lab scale in order to test the possibility to grow microalgae with CO2 from gaseous effluent of cement industry. Four microalgal species (Dunaliella tertiolecta, Chlorella vulgaris, Thalassiosira weissflogii, and Isochrysis galbana), representing four different phyla were grown with CO2 enriched air or with a mixture of gasses mimicking the composition of a typical...

Journal: :Journal of the American Mosquito Control Association 2005
Ivoneide M Silva Alvaro E Eiras Daniel L Kline Ulrich R Bernier

A synthetic blend of chemicals comprising volatiles released by the human body has been shown to be an effective attractant for female Aedes aegypti in olfactometer bioassays with laboratory-reared mosquitoes. We report the laboratory evaluation of Ae. aegypti response to a synthetic blend tested with 4 types of mosquito traps (CDC model 512, CDC model 1012, CFG, and Fay-Prince traps). Aedes ae...

Journal: :Journal of the Korea Academia-Industrial cooperation Society 2009

2011
Alastair F. Donaldson Leopold Haller Daniel Kroening Philipp Rümmer

We present combined-case k-induction, a novel technique for verifying software programs. This technique draws on the strengths of the classical inductive-invariant method and a recent application of k-induction to program verification. In previous work, correctness of programs was established by separately proving a base case and inductive step. We present a new k-induction rule that takes an u...

2007
PHILLIP G. BRADFORD

Given σ units of data and a digraph G = (V,E) whose edges have delays, bandwidth constraints, and are labeled by terminals from a CFG (context-free grammar) G. A path p adheres to G’s path constraints iff the concatenation of all terminals along p forms a word of the language generated by G. The all-pairs quickest CFG labeled-path distance problem is: for all pairs of vertices, find the minimum...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید