Use iou algorithm to find most likely table

[k-agau]

Issue #, if available: N/A

Description of changes: Previously, prettyprinter looked to find whether table A and table B were within a threshold of .1. This found the first table within that threshold rather than finding the most likely table.

By submitting this pull request, I confirm that you can use, modify, copy, and redistribute this contribution, under the terms of your choice.