Fuzzy pair counting

According to this birmirig scheme, the two distance bins, whose centers are the closest ones to the distance Vy of a given combination of two features, are incremented proportionally leading to fuzzy counts of the binding property pairs. A simple formula for the calculation of the increments A for the main bin m, that is, the bin where the distance actually falls, and the adjacent bin a is... 

Figure 50 illustrates three fuzzy name keys, each with a pair of names for which the key is generated. The basic generation algorithm lists consonants in the name followed by their occurrence count the consonants are in alphabetical order. Thus, the two names for the first key have three C s, one (understood) D , two H s, etc. In this case, the key rectifies the name format and locant differences and allows two names to match each other. The second key rectifies differences in name format and the substituent ordering the final key rectifies differences in name format and stereq terms. 

---