Is the performance of $lookup still 130 times worse than Postgres?

Hello, I have a scenario where $lookup would be preferential to embedding and came across this article in researching its efficacy. Comparison of JOINS: MongoDB vs. PostgreSQL It states that because postgres is build with iterative substitution. as well as merge join and hash join that it is 130 times faster at joining with damning timespans for queries to run. My question is simple, is this still the case given it being 2 years old? I am aware of some recent improvements with $lookup including the ability to have either collection sharded now so I suppose I am hoping the performance of the stage itself has been improved.

EDIT: Set Slot-Based Query Execution seems to promise some performance improvement for $lookup but does it make a dent in the 130 times?