I agree. As an example, if it is using traditional natural language parsing techniques, then it should know whether there are less than ten syntax trees or less than one thousand syntax trees by ring-in time. In this case, the former can be determined with a much higher degree of confidence. Even short phrases can have a multitude of possibilities, the canonical example being, 'Time flies like an arrow.' Of course, I have no idea how they're actually approaching this problem, but the point is, heuristics can be used in the process of question-answering to indicate enough of a confidence level for ring-in.