This New Year, the ®rst of the New Millennium, sees an important landmark in the development of Comparative and Functional Genomics (CFG). CFG is no longer a specialised section of Yeast, but is now a journal in its own right (or is that write?). Yeast subscribers should not fear, they will continue to receive complimentary copies of CFG throughout 2001. What it does mean is that CFG will recei...

LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar. In this paper, we present the first LRstyle parsing algorithm for Linear ContextFree Rewriting Systems (LCFRS), a mildly context-sensitive extension of CFG which has received considerable attention in the last years.

The process includes in hand tagged corpus, tree annotation on paper for large corpus, NU-FAST Treebank in form of brackets, extraction of CFG through NU-FAST Treebank, evaluation of PCFG from CFG and then PDCG from PCFG for inspection/testing through PROLOG parser.

Background: In Canada, pregnant women are typically referred to Canada’s Food Guide (CFG), a set of national dietary recommendations designed to promote adequate nutrient intake. Pregnant women are also advised to gain weight within the Institute of Medicine guidelines, which differ by prepregnancy body mass index (BMI). However, CFG recommendations do not account for prepregnancy BMI and provi...

This paper describes an algorithm for accelerating the CFG-parsing process by using dependency (or modiier-modiiee relationship) information given by, for instance, dependency estimation programs such as stochastic parsers, user's indication in an interactive application, and linguistic annotations added in a source text. This is a method for enhancing existing grammar-based CFG-parsing system ...

Multiple context-free grammar (mcfg) [10] is a natural extension of context free grammar (cfg) and inherits many good properties of cfg. For example, the class of languages generated by mcfg (called multiple context-free languages or mcfl) is a substitution closed full AFL and the membership problem for mcfl L is solvable in O(n) time where n is the length of an input string and e is a constant...

We apply Context-free Grammars (CFG) to measure the structural information content of a symbolic music string. CFGs are appropriate this domain because they highlight hierarchical patterns, and their dictionary rules can be used for compression. adapt approach estimate conditional Kolmogorov complexity string with concise CFG another Thus, related may compressed production first then define an ...

We conducted three trials near Cairns, Australia, to compare the numbers of mosquitoes collected with the standard Encephalitis Vector Surveillance (EVS) and Centers for Disease Control (CDC) light traps with the new MosquitoMagnet (MM) and counterflow geometry (CFG) traps with the use of a 4 x 4 latin square experimental design. The MM was generally equal to the performance of the CDC and CFG ...

An efficient parsing technique for HPSG is presented. Recent research has shown that supertagging is a key technology to improve both the speed and accuracy of lexicalized grammar parsing. We show that further speed-up is possible by eliminating non-parsable lexical entry sequences from the output of the supertagger. The parsability of the lexical entry sequences is tested by a technique called...

In their recogniser forms, the Earley and RIGLR algorithms for testing whether a string can be derived from a grammar are worst-case cubic on general context free grammars (CFG). Earley gave an outline of a method for turning his recognisers into parsers, but it turns out that this method is incorrect. Tomita’s GLR parser returns a shared packed parse forest (SPPF) representation of all derivat...