Related Topics
Experts

6

7

8

9

10
Publications (14)

1The Primordial Soup Algorithm A Systematic Approach to the Specification of Parallel Parsersalgorithm \[You\]. It requires the grammar to be in Chomsky Normal Form, i.e., productions have the form A*BC or Are...

2An Algorithm for Estimating the Parameters of Unrestricted Hidden Stochastic ContextFree Grammars1992  Julian Kupiecalgorithm which requires a grammar to be speefled in Chomsky normal form, the new algorithm can estimate an arbitrary SCFG...

3Classifying Chart Cells for Quadratic Complexity ContextFree Inference2008  Brian Roark,Kristy Hollingsheadexample, the CYK algorithm, which assumes a grammar in Chomsky Normal Form (hence exactly 2 nonterminal children for each constituent...

4Efficient Parsing of Highly Ambiguous ContextFree Grammars with Bit Vectors2004  Helmut SchmidSection 2 explains the transformation of the grammar to Chomsky normal form. The following sections describe the recogniser algorithm...

5Advanced Dynamic Programming in Semiring and Hypergraph Frameworks2008  Guang XiangThe CKY algorithm takes a contextfree grammar G in Chomsky Normal Form (CNF) and essentially intersects G with a DFA D re...

6A Method for Accelerating CFGParsing by Using Dependency Information2000  Hideo WatanabeFnrthcr, since a CFG rule is restricted to be in Chomsky normal form, hnaichi's algorithm is limited in terms of at)plicability...

7Forced Derivations for Hierarchical Machine Translationalgorithm is that it does not require the grammar to be in Chomsky Normal Form and we can use hierarchical translation rules directly...

8Word Identification For Mandarin Chinese Sentences1992  Kehjiann Chen,ShingHuan Liureasons, DM rules are compiled first to produce a Chomsky Normal Form like parsing table. The parsing table will then he...

9DataDriven Parsing with Probabilistic Linear ContextFree Rewriting Systems2010  Laura Kallmeyer,Wolfgang MaierThe binarization works like the transformation into Chomsky Normal Form for CFGs in the sense that for RHSs longer than 2,...

10Confidence Measures for Error Discrimination in an Interactive Predictive Parsing FrameworkIPP framework. This algorithm uses grammars in the Chomsky Normal Form (CNF) so we employed the open source Natural Language...