In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a ...

In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a ...

In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a ...

Parallel Multiple Context-Free Grammar. (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial ...

Parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars.

A family of distributional learning algorithms for context-free grammars are extended to the class of Parallel Multiple Context-Free Grammars (pmcfgs) ...

Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial time.

In this paper we extend distributional learning to the class of parallel multiple context-free grammars, a class which as far as is known includes all attested ...

A Polynomial Time Extension of Parallel Multiple Context-Free Grammar · Peter Ljunglöf. Computer Science, Mathematics. LACL. 2005. TLDR. By adding the single ...

In this paper we will consider a parallel extension of the context-free grammars ... given ET0L grammar we could effectively (in polynomial time) construct an ...