code: private int determineSize(List<Match> t) {
          Match firstMatch = t.get(0);
          if (!(firstMatch.token instanceof SimpleToken)) {
              return t.size();
          }
          int charLength = 0;
          for (Match m : t) {
              SimpleToken token = (SimpleToken) m.token;
              charLength += token.getNormalized().length();
          }
          return charLength;
      }
docs: /*
  in case of an a, b / b, a transposition we have to determine whether a or b
  stays put. the phrase with the most character stays still if the tokens are
  not simple tokens the phrase with the most tokens stays put