// Copyright 2013, University of Freiburg,
// Chair of Algorithms and Data Structures.
// Author: Hannah Bast <bast@cs.uni-freiburg.de>.

// The main function should satifsy the following:
// 1. Call from the command line with exactly one argument = the name of the file
// containing the input strings; see method readStringsFromFile.
// 2. When called, read these string and build a 3-gram index from it and output
// the time needed for the index building.
// 3. In an infinite loop, read queries from the console, and for each query,
// output the top-10 results from findMatches, and ouput the total number of
// elements in the union, the number of candidates checked by checkPrefixEditDistance
// the total number of matches, and the total time spent in findMatches().