On Sun Feb 13 2011 Ted Zlatanov wrote: > I would approach this as a scoring problem. Let BBDB have a score for > each address (so multiples can be in a record), defaulting to 0. [snip] > And so on, but the important thing is to have scoring rules and base > scores. The user should be able to customize both. Then just order the > candidates by score. > > RW> (2) The algorithm needs to recognize which lexicographically > RW> unrelated mail addresses belong to one record so that cycling > RW> can be based on these entries only: > > IMO the cycling should only be based on scores. That would, I think, > accomplish all your items and produce less "DWIM but that's not it."
In principle, this sounds like a good idea. (It kind of reminds me of how TeX is doing its line breaks. But there are probably zillions of other applications that do similar things.) Maybe Stefan can comment here: Do you have any thoughts / plans on implementing something like that for the generic completion code? Again, it appears to me that an important question would be: How can one communicate such scores to the generic algorithm? Roland ------------------------------------------------------------------------------ The ultimate all-in-one performance toolkit: Intel(R) Parallel Studio XE: Pinpoint memory and threading errors before they happen. Find and fix more than 250 security defects in the development cycle. Locate bottlenecks in serial and parallel code that limit performance. http://p.sf.net/sfu/intel-dev2devfeb _______________________________________________ bbdb-info@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bbdb-info BBDB Home Page: http://bbdb.sourceforge.net/
