the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf

1 files changed, 2 insertions, 2 deletions

diff --git a/src/runtime/haskell/PGF/Binary.hs b/src/runtime/haskell/PGF/Binary.hs
index 202939f04..2debcf12d 100644
--- a/src/runtime/haskell/PGF/Binary.hs
+++ b/src/runtime/haskell/PGF/Binary.hs
@@ -40,13 +40,13 @@ instance Binary CId where
 instance Binary Abstr where

   put abs = put (aflags abs, 

                  fmap (\(w,x,y,z,_) -> (w,x,y,z)) (funs abs),

-                 fmap (\(x,y,_) -> (x,y)) (cats abs))

+                 fmap (\(x,y,z,_) -> (x,y,z)) (cats abs))

   get = do aflags <- get

            funs <- get

            cats <- get

            return (Abstr{ aflags=aflags

                         , funs=fmap (\(w,x,y,z) -> (w,x,y,z,0)) funs

-                        , cats=fmap (\(x,y) -> (x,y,0)) cats

+                        , cats=fmap (\(x,y,z) -> (x,y,z,0)) cats

                         , code=BS.empty                        

                         })