<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta content="text/html;charset=UTF-8" http-equiv="Content-Type"></head><body ><div style="font-family: Verdana, Arial, Helvetica, sans-serif; font-size: 10pt;"><div>That's interesting and I will read up on it as I get time.<br></div><div><br></div><div>It is an interesting problem isn't it?<br></div><div><br></div><div>What I might try is having each LatinRoot object visit each other one and by some heuristic, have them determine if they are "close" to each other.<br></div><div><br></div><div>For giggles, I can randomly assign an integer weight to each one, and if the absolute value of their difference is within X, then they are close.<br></div><div><br></div><div>That in itself is an interesting problem in itself. How to efficiently (or not) have 800 objects visit the other 799 objects.<br></div><div>How to store the set of "other close objects" in an object.</div><div><br></div><div>Then, as other heuristics of "close" are developed, I can re-use that </div><div><br></div><div><br></div><div>Thanks for your reply!</div><br><div data-zbluepencil-ignore="true" style="" class="zmail_extra"><br><div id="Zm-_Id_-Sgn1">---- On Fri, 03 Apr 2020 17:12:31 -0400 <b>Stéphane Rollandin <lecteur@zogotounga.net></b> wrote ----<br></div><br><blockquote style="border-left: 1px solid rgb(204, 204, 204); padding-left: 6px; margin: 0px 0px 0px 5px;"><div>Just a wild guess: self-organizing maps?<br><br><a target="_blank" href="https://en.wikipedia.org/wiki/Self-organizing_map">https://en.wikipedia.org/wiki/Self-organizing_map</a><br><br>Stef<br><br><br></div></blockquote></div><div><br></div></div><br></body></html>