diff options
| author | Paul Baltescu <pauldb89@gmail.com> | 2013-02-22 11:59:17 +0000 | 
|---|---|---|
| committer | Paul Baltescu <pauldb89@gmail.com> | 2013-02-22 11:59:17 +0000 | 
| commit | d69c289e172562039bcbe987657280332ab6315e (patch) | |
| tree | cc67d97bf802101d981cfacadb1cea80472aa107 /extractor/run_extractor.cc | |
| parent | a21835881984ba90f303c7b1681d295678cb7131 (diff) | |
Remove original version of the intersector.
Diffstat (limited to 'extractor/run_extractor.cc')
| -rw-r--r-- | extractor/run_extractor.cc | 8 | 
1 files changed, 1 insertions, 7 deletions
| diff --git a/extractor/run_extractor.cc b/extractor/run_extractor.cc index 38f10a5f..d73f77cd 100644 --- a/extractor/run_extractor.cc +++ b/extractor/run_extractor.cc @@ -58,13 +58,9 @@ int main(int argc, char** argv) {          "Minimum number of occurences for a pharse to be considered frequent")      ("max_samples", po::value<int>()->default_value(300),          "Maximum number of samples") -    ("fast_intersect", po::value<bool>()->default_value(false), -        "Enable fast intersect")      // TODO(pauldb): Check if this works when set to false.      ("tight_phrases", po::value<bool>()->default_value(true), -        "False if phrases may be loose (better, but slower)") -    ("baeza_yates", po::value<bool>()->default_value(true), -        "Use double binary search"); +        "False if phrases may be loose (better, but slower)");    po::variables_map vm;    po::store(po::parse_command_line(argc, argv, desc), vm); @@ -170,8 +166,6 @@ int main(int argc, char** argv) {        vm["max_nonterminals"].as<int>(),        vm["max_rule_symbols"].as<int>(),        vm["max_samples"].as<int>(), -      vm["fast_intersect"].as<bool>(), -      vm["baeza_yates"].as<bool>(),        vm["tight_phrases"].as<bool>());    int grammar_id = 0; | 
