overture2112 Wrote:v1.5 implements a feature to find a maximum cardinality bipartite matching between morphemes in a DB to facts whose Expression field contains said morphemes.
I had been considering making a plugin to do what yours does, since I had actually lost track of where I heard of a plugin that can tract n+1. But obviously I found it again
. Anyway, one of the rough points I hit in just pondering how to build the app was dealing with the issue of "how do you programmatically build a deck such that its like Core2k and all sentences build on each other in an n+1 or n+2 fashion?" Is that basically what the Maximum cardinality matching algorithm does?
