From: pc+usenet@asdf.org   
      
   Treesong  writes:   
   > On Monday, February 27, 2017 at 5:02:02 PM UTC-5, Phil Carmody wrote:   
   > > One way of perhaps fixing his weighting without having to invent and   
   > > calculate a whole new one from scratch is to simply subtract the size   
   > > of the longest common substring from his weight. adobe/abode goes from   
   > > 4 to 1 instantly under this metric.   
   >   
   > Looks to me like the longest common substring is 1   
      
   I misspoke, I meant longest common subsequence.   
   adobe   
   a o e   
   abode   
      
   > That aside, I think you have good arguments against his weighting function   
   as it stands. Have you written to him?   
      
   I plan too when I've got something a bit more coherent put together,   
   such as examples of "best" anagrams of various lengths using several   
   different weighting functions.   
      
   Phil   
   --   
   Humans will have advanced a long, long, way when the DSM has   
   a cozy little place next to the bible in the "Fiction" shelf   
   in the library.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)