If they match, no replacement is performed.
the second stage applies Charniak's probabilistic parser (http://bllip.cs.brown.edu/ resources.shtml#software) to syntactically analyze the texts in order of their probability, yielding at most 50 different parse trees per text.