We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new finger-print based data structure which enables efficient, linear time implementation.