Search Sciweavers | Sciweavers

26

ACL
2011

178views Computational Linguistics» more ACL 2011»

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems

12 years 11 months ago

We study the problem of ﬁnding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a speciﬁed right...

Pierluigi Crescenzi, Daniel Gildea, Andrea Marino,...

claim paper

Read More »

23

click to vote

COLING
2010

137views Computational Linguistics» more COLING 2010»

Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems

13 years 2 months ago

Download www.aclweb.org

This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...

Laura Kallmeyer, Wolfgang Maier

claim paper

Read More »

27

click to vote

NAACL
2010

136views Computational Linguistics» more NAACL 2010»

Optimal Parsing Strategies for Linear Context-Free Rewriting Systems

13 years 5 months ago

Download www.cs.rochester.edu

Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...

Daniel Gildea

claim paper

Read More »

19

click to vote

CORR
2010
Springer

124views Education» more CORR 2010»

On Omega Context Free Languages which are Borel Sets of Infinite Rank

13 years 7 months ago

Download hal.archives-ouvertes.fr

This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...

Olivier Finkel

claim paper

Read More »

23

click to vote

LACL
2001
Springer

97views Automated Reasoning» more LACL 2001»

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

13 years 11 months ago