Linear contextfree rewriting systems
Related Topics
Experts

1

2

3

4

5

6

7

8

9

10
Publications (7)

1Efficient parsing with Linear ContextFree Rewriting Systems2012  Andreas van CranenburghComputational Linguistics Efficient Parsing with Linear ContextFree Rewriting Systems Andreas van Cranenburgh Huygens ING & ILLC...

2Incremental Parsing with Parallel Multiple ContextFree Grammars2009  Krasimir Angelovshown that MCFG is equivalent to stringbased Linear ContextFree Rewriting Systems and FiniteCopying Tree Transducers and it...

3Treebank Grammar Techniques for NonProjective Dependency Parsing2009  Marco Kuhlmann,Giorgio Sattanonprojective dependency parsing to parsing with Linear ContextFree Rewriting Systems (LCFRS), by presenting a technique for extracting...

4Parsing Mildly NonProjective Dependency Structuresformalisms. Specifically, he shows that: linear contextfree rewriting systems (LCFRS) with fanout k (VijayShanker et al...

5LongDistance Scrambling and Tree Adjoining Grammarsshown that MCTAGs are equivalent to the Linear Context Free Rewriting Systems (LCFRS), which are the best known chara...

6A Tractable Extension of Linear Indexed Grammars1995  Bill Keller,David Weirincluded in those languages generated by Linear ContextFree Rewriting Systems (VijayShanker et al., 1987) since the construction...

7New Frontiers Beyond ContextFreeness: DiGrammars And DiAutomata.1993  Peter StaudacherGrammars: Generative power and relationship to linear contextfree rewriting systems. 26th Meeting Assoc.Comput. Ling., 278285...