From 4a331030632d9a818f1853a5afed20b9f14e354a Mon Sep 17 00:00:00 2001 From: Paul Baltescu Date: Wed, 6 Mar 2013 17:18:13 +0000 Subject: Removed obsolete TODOs. --- extractor/precomputation.cc | 2 -- extractor/rule_extractor_helper.cc | 2 -- 2 files changed, 4 deletions(-) (limited to 'extractor') diff --git a/extractor/precomputation.cc b/extractor/precomputation.cc index e29018c2..0fadc95c 100644 --- a/extractor/precomputation.cc +++ b/extractor/precomputation.cc @@ -69,8 +69,6 @@ vector > Precomputation::FindMostFrequentPatterns( for (size_t i = 1; i < lcp.size(); ++i) { for (int len = lcp[i]; len < max_frequent_phrase_len; ++len) { int frequency = i - run_start[len]; - // TODO(pauldb): Only add patterns that don't span across multiple - // sentences. if (frequency >= min_frequency) { heap.push(make_pair(frequency, make_pair(suffix_array->GetSuffix(run_start[len]), len + 1))); diff --git a/extractor/rule_extractor_helper.cc b/extractor/rule_extractor_helper.cc index 553b56d4..d9ed6a7e 100644 --- a/extractor/rule_extractor_helper.cc +++ b/extractor/rule_extractor_helper.cc @@ -35,8 +35,6 @@ void RuleExtractorHelper::GetLinksSpans( source_low = vector(source_sent_len, -1); source_high = vector(source_sent_len, -1); - // TODO(pauldb): Adam Lopez claims this part is really inefficient. See if we - // can speed it up. target_low = vector(target_sent_len, -1); target_high = vector(target_sent_len, -1); vector > links = alignment->GetLinks(sentence_id); -- cgit v1.2.3