From 7d58efb6600d164101c439cf8954de637ea35c34 Mon Sep 17 00:00:00 2001 From: krasimir Date: Tue, 14 Dec 2010 08:46:22 +0000 Subject: optimization in the parser for large lexicons. Now, the parser is slightly slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary --- src/runtime/haskell/PGF/Binary.hs | 1 + 1 file changed, 1 insertion(+) (limited to 'src/runtime/haskell/PGF/Binary.hs') diff --git a/src/runtime/haskell/PGF/Binary.hs b/src/runtime/haskell/PGF/Binary.hs index 26f994797..32b751159 100644 --- a/src/runtime/haskell/PGF/Binary.hs +++ b/src/runtime/haskell/PGF/Binary.hs @@ -68,6 +68,7 @@ instance Binary Concr where , productions=productions , pproductions = IntMap.empty , lproductions = Map.empty + , lexicon = IntMap.empty , cnccats=cnccats, totalCats=totalCats }) -- cgit v1.2.3