-
I've been playing around recently with feeding this ABI's mangled-name grammar to an [Earley parser](https://en.wikipedia.org/wiki/Earley_parser), with the aim of using it as a reference decoder for m…
-
I want to contribute a few ideas I have for new features. but after reading the source, I still can't understand how `parse` works.
in http://www.nltk.org/book/ch08-extras.html (2 Chart Parsing and …
-
Consider this code:
```haskell
{-# LANGUAGE Haskell2010 #-}
{-# LANGUAGE RecursiveDo #-}
import Text.Earley
import Control.Applicative
data L = A | B | C deriving (Eq, Show)
lang :: Gramm…
-
Maybe you could do a simple mathematical interpreter (expressions)? And move on from there by adding some features (variables, functions with a single expression that returns a computed value, jumps, …
-
Hello,
I am a computational linguist working on an exciting project regarding NLP and machine translation.
Custom logits processors and, thereby, constrained decoding are of high interest to me,…
-
It would be nice to be able to say `a otherwise b` such that only if `a` fails, `b` appears in the output.
Early seems to do an ad-hoc version of this for `(Just a) pure Nothing`, which returns `[J…
-
I made an Earley engine that is much faster in benchmarks than YAEP: [gearley](https://github.com/pczarn/gearley). Here are the results for 88248 tokens (10K lines of C).
```
gearley: bench_parse_c …
-
from Aycock & Horspool "Practical Earley Parsing", The Computer Journal, Vol. 45, No. 6, 2002
-
this implementation claimed to be fastest:
https://github.com/vnmakarov/yaep
it's readme file contain performance comparison with Marpa and yacc
-
While trying to parse a specific sentence from the Treebank corpus these two parsers behave strangely.
This is the sentence from treebank:
`['A', 'form', 'of', 'asbestos', 'once', 'used', '*', '*', …