From dfebe92df6e09b8950c93e08fadccd95763186f8 Mon Sep 17 00:00:00 2001
From: Kenneth Heafield <kheafiel@cluster01.lti.ece.cmu.local>
Date: Mon, 16 Jul 2012 10:50:56 -0400
Subject: Fix slow backoff lookup

---
 klm/lm/model.cc | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

(limited to 'klm')

diff --git a/klm/lm/model.cc b/klm/lm/model.cc
index c081788c..a2d31ce0 100644
--- a/klm/lm/model.cc
+++ b/klm/lm/model.cc
@@ -53,9 +53,6 @@ template <class Search, class VocabularyT> void GenericModel<Search, VocabularyT
   search_.LoadedBinary();
 }
 
-namespace {
-} // namespace
-
 template <class Search, class VocabularyT> void GenericModel<Search, VocabularyT>::InitializeFromARPA(const char *file, const Config &config) {
   // Backing file is the ARPA.  Steal it so we can make the backing file the mmap output if any.  
   util::FilePiece f(backing_.file.release(), file, config.messages);
@@ -126,7 +123,7 @@ template <class Search, class VocabularyT> FullScoreReturn GenericModel<Search,
     return ret;
   }
   // i is the order of the backoff we're looking for.
-  unsigned char order_minus_2 = 0;
+  unsigned char order_minus_2 = start - 2;
   for (const WordIndex *i = context_rbegin + start - 1; i < context_rend; ++i, ++order_minus_2) {
     typename Search::MiddlePointer p(search_.LookupMiddle(order_minus_2, *i, node, independent_left, extend_left));
     if (!p.Found()) break;
-- 
cgit v1.2.3