Databases
StackOverflow2013
Postsdbo
POEfficient Context-Free Grammar parser, preferably Python-friendly
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POEfficient Context-Free Grammar parser, preferably Python-friendly
    primarykey
    data
    text
    <p>I am in need of parsing a small subset of English for one of my project, described as a context-free grammar with (1-level) feature structures (<a href="http://code.google.com/p/nltk/source/browse/trunk/nltk/examples/grammars/book_grammars/feat0.fcfg?r=8260">example</a>) and I need to do it efficiently .</p> <p>Right now I'm using <a href="http://www.nltk.org/">NLTK</a>'s parser which produces the right output but is very slow. For my grammar of ~450 fairly ambiguous non-lexicon rules and half a million lexical entries, parsing simple sentences can take anywhere from 2 to 30 seconds, depending it seems on the number of resulting trees. Lexical entries have little to no effect on performance.</p> <p>Another problem is that loading the (25MB) grammar+lexicon at the beginning can take up to a minute.</p> <p>From what I can find in literature, the running time of the algorithm used to parse such a grammar (Earley or CKY) should be linear to the size of the grammar and cubic to the size of the input token list. My experience with NLTK indicates that ambiguity is what hurts the performance most, not the absolute size of the grammar.</p> <p>So now I'm looking for a CFG parser to replace NLTK. I've been considering <a href="http://www.dabeaz.com/ply/">PLY</a> but I can't tell whether it supports feature structures in CFGs, which are required in my case, and the examples I've seen seem to be doing a lot of procedural parsing rather than just specifying a grammar. Can anybody show me an example of PLY both supporting feature structs and using a declarative grammar?</p> <p>I'm also fine with any other parser that can do what I need efficiently. A Python interface is preferable but not absolutely necessary.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USMax Shawabkeh
    1. USMax Shawabkeh
    plurals
    1. PL
      singulars
      1. LTLinked
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POEfficient Context-Free Grammar parser, preferably Python-friendly
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POEfficient Context-Free Grammar parser, preferably Python-friendly
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POEfficient Context-Free Grammar parser, preferably Python-friendly
      1. USApalala
      1. VTFavorite
    1. COI'm just looking for the same thing but only for Java. Here is my related question: http://stackoverflow.com/questions/4584684/java-cfg-parser-that-supports-ambiguities . So which method did you decide? Apalala says that we can fix ANTLR to handle ambiguities. However I didn't understand the method he suggests.
      singulars
      1. POEfficient Context-Free Grammar parser, preferably Python-friendly
      1. UShrzafer
    2. COSo far I'm still using NLTK as none of the libraries or techniques in the answers worked for me. However, that is in part because I require a unification grammar (CFG + feature structs) and according to the NLTK developer in charge of the parser, my efficiency problems stem from that.
      singulars
      1. POEfficient Context-Free Grammar parser, preferably Python-friendly
      1. USMax Shawabkeh
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload