Gary Illyes from Google clarified on Twitter that the production parser, which Google recently opened sourced for all to see, it different from the parser Google uses in Search Console. So the results might come out differently. What is different, Gary said on Twitter the Search Console parser uses a Java port that is disconnected from production.
Here is what Gary wrote:
If you don't believe that the os version is indeed the production parser, you can get hired and I'll be more than happy to walk you through the production code, and then diff it against the OS one. Applies on any part of search I've worked on (modulo high intellectual property)
— Gary "鯨理／경리" Illyes (@methode) November 5, 2019
Oh, the modulo operation finds the remainder after division of one number by another. Given two positive numbers, a and n, a modulo n is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor. In number theory, with respect to or using a modulus of a specified number. Two numbers are congruent modulo a given number if they give the same remainder when divided by that number.
Forum discussion at Twitter.
