Back to Results
First PageMeta Content
Mathematics / Context-free grammar / LL parser / Formal grammar / Parsing / Earley parser / Filter / Support / Controlled grammar / Formal languages / Software engineering / Grammar


Are Very Large Context-Free Grammars Tractable? Pierre Boullier & Benoˆıt Sagot INRIA-Rocquencourt Domaine de Voluceau, Rocquencourt BP[removed]Le Chesnay Cedex, France {Pierre.Boullier,Benoit.Sagot}@inria.fr
Add to Reading List

Document Date: 2008-03-11 13:21:02

Open Document

File Size: 242,03 KB

Share Result on Facebook

City

Le Chesnay Cedex / /

Company

AMD / S XPipe / Let us / /

Country

France / /

/

IndustryTerm

real-word natural language processing / make-areduced-grammar algorithm / make-a-reduced-grammar algorithm / make-a-reducedgrammar algorithm / presyntactic processing chain / /

OperatingSystem

Xp / Linux / /

Organization

FSA / /

Person

Pierre Boullier / Gcf / Gb / /

Position

author / /

Technology

make-a-reducedgrammar algorithm / make-a-reduced-grammar Algorithm An algorithm / RAM / make-areduced-grammar algorithm / natural language processing / make-a-reduced-grammar algorithm / Linux / /

SocialTag