@pervognsen (BTW, has CFG parsing's asymptotic worst case been proven yet? Or do we still not know how fast the fastest parser would be?)
-
-
@cmuratori It's been proven to be equivalent to matrix multiplication! There are hugely impractical theoretical algorithms based on that. -
@cmuratori CYK is basically a Boolean matrix multiplication if you squint a bit.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.