# Patent

## Title
Methods and systems for measuring semantics in communications

## Abstract

A content is divided into tokens. Tokens can represent sounds, symbols, letters, words, sentences, paragraphs, or documents, among other possibilities. Probable measures of meaning (PMMs) are determined for each token. Given a target token, a proximity function for other tokens can be calculated, which in turn can be used to modify the PMMs for the other tokens. These modified PMMs for the other tokens can then be used in conjunction with the PMM for the target token to generate a relative measure of meaning (RMM) for the target token.

## Background
RELATED APPLICATION DATA
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/568,062, titled “METHODS AND SYSTEMS FOR MEASURING SEMANTICS IN COMMUNICATIONS”, filed Dec. 7, 2011, which is herein incorporated by reference for all purposes.


FIELD
This invention pertains to information, and more particularly to determining the meaning of information.
BACKGROUND
Effective communication among humans is vital for the progress of civilization. Whether written, verbal, prepared, extemporaneous, or in any other form, the meaning, or semantics, of the communication, and how it is expressed, determines the clarity or ambiguity of the communication. Conventionally, communications can be misunderstood for many reasons, including lack of precision in the language, unclear relevance, confusion, and the like.
While current efforts to analyze communications claim to find meaning and assign a value to meaning, they are merely determining “similarity” instead of “meaning” within different contexts, and are therefore incomplete in their analysis. There is a tendency to assume that meaning as an absolute exists in isolation within data or a package of information.
A need remains for a way to address these and other problems associated with the prior art.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 shows a system that can be used to determine the meaning of information, according to an embodiment of the invention.
FIG. 2 shows an alternative embodiment to the system of FIG. 1 for use in determining the meaning of information.
FIG. 3 shows a report being generated and sent to a recipient using the system of FIGS. 1 and 2.
FIG. 4 shows a flowchart of a procedure for determining the meaning of information using the systems of FIGS. 1 and 2, according to an embodiment of the invention.
FIGS. 5A and 5B show alternative ways to determine tokens in the flowchart of FIG. 4.



DETAILED DESCRIPTION
As human beings, when we read (or view, or otherwise process) content, we can instinctively determine the semantics of the communication. The communication semantics process (CSP) is a process that enables an observer, reviewer, or participant (e.g., human or computer) in any communication to assign a value to meaning in any part of the communication. The CSP enables relative comparison of meaning between and among different parts of any embodiment of communication, whether it is written, spoken, prepared, extemporaneous, or in any other form.
The data that makes up any particular piece of content can be either structured or unstructured. Structured data—that is, data that takes a recognizable form—can be processed based in part on the structure of the data. In analyzing structured data, data pertaining to certain meaning within a context is stored in pre-determined abstract categories. Then, a schema of translation is applied to convert the abstract categories into categories relevant to a specific context. For example, when a person visits a doctor's office, they are often asked to fill out a form requesting various data: the person's name, age, gender, insurance information, and so on. And as the form is structured the same for each person, a system that processes the forms knows where to look on the form for particular pieces of data, and how to expect that data to be formatted. Continuing the example, the person is expected to put his or her age in a particular location on the form, and to use only numbers in the field. This makes it easier to process the form, as the types of symbols expected in a particular field can be reduced.
Another example of structured data is a database. The data in a database takes a particular form, based on its location, which helps to control its interpretation.
Structured data is typically quantifiable data. But non-quantifiable data can be converted into a quantifiable measure by assigning scores and weights, and then analyzed for relevant meaning.
Unstructured data, in contrast to structured data, can take any form. Examples of unstructured data can be text documents, scripts, and so on. While it is likely that a particular content has a grammar and syntax that applies in interpreting the content, there are no external clues guiding the interpretation of the data, as there usually are in structured data.
Unstructured data is typically non-quantifiable data. Analyzing unstructured data often relies on two main theories:

    
    
        A) Statistics are used to extrapolate a measure of proximity among words. For example, if a set of words repeatedly appear within a set distance from each other in numerous documents, then it can be said that those documents are about the same topic or context expressed by the words in question.
    
    


B) What defines the importance of concepts within a context is what appears less frequently. For example, the outliers define the difference and relative importance of members within a group or among groups.
Communication Semantics is based on the concept that meaning is relative and can be measured in relation to what comes before any data point and what comes after. In addition, the data point in consideration can be as small or as large as needed without any absolute limit. For example, Communication Semantics can be applied to tokens as small a sound, symbol, letter, or word that can be bound and identified within a context, or as large a group of sounds, symbols, letters, or words that can be bound and identified within a context. Thus, the tokens used in Communication Semantics can be as small as individual letters, or as large as sentences, paragraphs, or even entire documents (when comparing multiple documents). The only requirement for Communication Semantics is that there be other tokens before and after the token being analyzed, as needed.
Consider the phrase:
















Base
Today I saw the man with the telescope.










The base sentence is ambiguous in that its relevance and meaning is not clear, and it is not clear who has the telescope (do “I” have the telescope, or does “the man” have the telescope?).
Now consider the same phrase in one context:













Context A
I've been looking to add some telescopes to our inventory.



Today I saw the man with the telescope.



He seems dependable.









Given this context, there is higher probability that the “man” had the telescope.
Now consider the same phrase in another context:













Context B
I've been looking at the warehouse with my telescope every



day to see if the guy returns. Today I saw the man with



the telescope. He seemed to be in a rush.









Given this context, there is higher probability that “I” had the telescope.
Now consider the same phrase in a modification of Context A:













Context C
I learned to gauge peoples' dependability by observing how



confidant they are when they walk. I've been looking to add



some telescopes to our inventory. Today I saw the man with



the telescope. He seems dependable. It's fun to watch people



through the telescope especially as they approach our office.









Given this context, there is higher probability that “I” had the telescope. Relatively speaking, Context C implies a higher probability that “I” had the telescope than Context A, but not as high a probability as Context B.
These examples illustrate that it is better to determine the relative measure of meaning of a phrase in relation to what comes before and after the phrase, than in isolation.
More generally, consider a sequence of symbols . . . αθτχφ . . . Symbolically speaking, the relative measure of meaning of any symbol in a group can be determined in relation to what comes before and after the phrase. As discussed above, these symbols, or tokens, can represent any desired element in the content: a sound, individual symbol, word, sentence, paragraph, or document. In addition, because Communication Semantics can be applied using any desired type of token, Communication Semantics is not limited to content that uses languages that use an alphabet, such as English: it is equally applicable to logographic languages, such as Chinese.
FIG. 1 shows a system that can be used to determine the meaning of information, according to an embodiment of the invention. In FIG. 1, server 105 is shown as including input port 110, token determination unit 115, Relative Measure of Meaning (RMM) calculation unit 120, output port 125, Probable Measure of Meaning (PMM) database 130, and proximity function (PF) database 135. Input port 110 is used to receive content to be analyzed. The content to be analyzed can be, for example, a document, an e-mail, or it can be streamed content (where the tokens in the content are received over time and not all immediately identifiable). Token determination unit 115 can identify tokens in the content. As discussed above, the meaning of the term “token” can be interpreted to represent any desired token, be it a sound, symbol, letter, word, sentence, paragraph, or document, among other possibilities. RMM calculation unit 120 can calculate the relative measure of meaning (RMM) for a token, as will be discussed below. Output port 125 can output information regarding the content, including, for example, the RMM for any number of tokens in the content.
Before explaining how the RMM of a token is calculated, it is important to understand that a given token has a probable measure of meaning (PMM). The PMM for a token represents the different possible meanings a token can have. For example, the word “bad” can have a negative meaning, as in “That was a bad thing to do”, or a positive meaning, as in “I really like Tom: he's bad!”. For example, the word “bad” can be said to have a negative meaning 90% of the time, and a positive meaning 10% of the time. Without context, it is not possible to know whether a particular use of this word is intended to be positive or negative; thus, the word “bad” only has a PMM.
The PMMs for tokens can be stored in PMM database 130. PMMs for a given token can be stored in advance, or can be generated when needed (for example, by analysis of use of the token in question in various documents. The PMM for a token in PMM database can also be updated as more information is learned about the token: this concept is discussed below.
In addition, the distance between two tokens can affect the meaning of a token. For example, in the sentence “I really like Tom: he's bad!”, it is the use of the word “like” that suggests that the word “bad” has a positive meaning. For example, in the sentence “I really hate Tom: he's bad!”, the only change is a substitution of “hate” for “like”; but that one change completely alters the significance of the sentence as a whole, and the implied meaning of the word “bad” in particular. But an important consideration is that the words “like” and “bad” are relatively close: they occur in the same sentence, and only 3 words apart. If the words “like” and “bad” happen to occur in a document, but are separated by hundreds of words and pages of content, the likelihood that the word “like” is meant to imply a positive meaning to the word “bad” is greatly reduced.
To represent the fact that the distance between tokens can affect the meaning, proximity function database 135 can be used. Proximity function database 135 can use the token being analyzed, another token in the content, and the relative distance between the two tokens in calculating a factor to be used in weighting the impact of the other token in interpreting the current token. Thus, for example, in determining the impact of the word “like” on the meaning of the word “bad”, proximity function database can factor in the words themselves (“like” and “bad”) and the distance between these words (3 words apart). The result of this calculation can then be used to adjust the significance of the secondary token towards the relative meaning of the target token. In effect, proximity function database 130 can be used to modify the PMM for a secondary token.
As with PMM database 130, proximity function database 135 can be created in advance and accessed as needed, or the proximity function for a secondary token (given the target token) can be calculated on-the-fly.
Now that PMM database 130 and proximity function database 135 are understood, RMM calculation unit 120 can be further analyzed. RMM calculation unit starts with the PMM for a target token. Then, this PMM is modified using the PMMs and proximity functions for various tokens near the target token. While any formula can be used to calculate the RMM for a target token, one formula that can be used is:




  
    R
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    
      M
      ⁡
      
        (
        
          token
          n
        
        )
      
    
  
  =
  
    P
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    
      
        (
        
          token
          n
        
        )
      
      ⨯
      
        
          
            Mean
            d
          
          
            i
            =
            
              -
              d
            
          
        
        ⁡
        
          (
          
            P
            ⁢
            
              
            
            ⁢
            M
            ⁢
            
              
            
            ⁢
            
              M
              ⁡
              
                (
                
                  token
                  
                    n
                    -
                    i
                  
                
                )
              
            
            *
            P
            ⁢
            
              
            
            ⁢
            
              F
              ⁡
              
                (
                
                  
                    token
                    n
                  
                  ,
                  
                    token
                    
                      n
                      -
                      i
                    
                  
                  ,
                  i
                
                )
              
            
          
          )
        
      
    
  




That is, the RMM for a token (tokenn) is the PMM for that token, multiplied by the arithmetic mean (average) of the product of the PMMs of each token and the proximity function (PF) for each token, within a certain distance (d) of the target token. For example, if the chosen distance is 5 tokens, then the PMM and the proximity function of each token that is within 5 tokens (before or after) the target token are determined and multiplied together, then averaged, which is then multiplied by the PMM of the target token to produce the RMM of the target token.
While the above formula is one embodiment that can be used, it should not be considered as providing any limits on how the RMM for a token can be calculated. For example, any distance can be used, up to Go (that is, all tokens in the content can be considered). Or, only tokens on one side of the target token (either before or after) can be considered, with the tokens on the other side ignored. Further, embodiments of the invention are intended to cover all possible formulations to represent the relationship or relationships between RMM, PMM, and the proximity function, using any desired means for calculating RMM, PMM, and the proximity function.
While FIG. 1 shows server 105 as including all of the components used to calculate the RMM for a token, a person skill in the art will recognize that other embodiments are possible. For example, FIG. 2 shows an alternative embodiment to the system of FIG. 1 for use in determining the meaning of information. In FIG. 2, server 105 is in communication with server 205 over network 210 (which can be any type of network), which includes PMM database 130 and proximity function database 135. Thus, when server 105 needs information about the PMM of a token or the proximity function for a token, server 105 communicates with server 205 over network 210 to retrieve the desired information. A person of ordinary skill in the art will also recognize that PMM database 130 and proximity function database 135 do not need to reside on the same server: they can reside on different servers, as needed.
FIG. 3 shows a report being generated and sent to a recipient using the system of FIGS. 1 and 2. In FIG. 3, output port 125 generates report 305, which is sent to client 310. Client 310 can represent one or more data consumers, each of which can include one or more computers or one or more individual persons. The information in report 305 can include one or more statements or reports regarding the analysis described above. Report 305 can correspond to, for example, a physical paper or electronic report.
It will be understood that the report 305 can include an electronic statement or report that is storable in a storage medium such as a hard disk drive, memory, or other suitable storage device. Alternatively, report 305 can include a physical statement or report such as a paper printout, which may be derived from the electronic statement or report.
FIG. 4 shows a flowchart of a procedure for determining the meaning of information using the systems of FIGS. 1 and 2, according to an embodiment of the invention. In FIG. 4, at block 405, the system identifies tokens in content. At block 410, the system determines the probable measures of meaning (PMMs) of the various tokens. At block 415, the system modifies one of the PMMs. As discussed above, this modification can be done using a proximity function relative to another token. At block 420, the system generates a relative measure of meaning (RMM) for a token, using (among other things) the modified PMMs for the other token. This information can then be output as appropriate.
As discussed above, the RMM for a token can in turn be used to modify the PMM for the token. For example, consider again the word “bad”, and assume that the PMM for that token only suggested negative meanings for the word. But after analyzing the sentence “I really like Tom: he's bad!”, the system has encountered a positive meaning for the word “bad”. Accordingly, the PMM for the word “bad” can be updated to reflect the fact that this word can occasionally have a positive meaning.
As shown in FIG. 4, at block 425, the RMM for the token can be used to modify the PMM for that token, for use in later operations. But this modification of the PMM is optional; as shown by dashed line 430, block 425 can be omitted with no loss of functionality.
As discussed above, the scope of a “token” can vary. FIGS. 5A and 5B show alternative ways to determine tokens in the flowchart of FIG. 4. In FIG. 5A, at block 505, identifying tokens operates by identifying sentences. In FIG. 5B, at block 510, identifying tokens operates to identify tokens (whatever their scope) both before and after a target token. A person of ordinary skill in the art will recognize other ways in which token identification can be modified. The following discussion is intended to provide a brief, general description of a suitable machine in which certain aspects of the invention may be implemented. Typically, the machine includes a system bus to which is attached processors, memory, e.g., random access memory (RAM), read-only memory (ROM), or other state preserving medium, storage devices, a video interface, and input/output interface ports. The machine may be controlled, at least in part, by input from conventional input devices, such as keyboards, mice, etc., as well as by directives received from another machine, interaction with a virtual reality (VR) environment, biometric feedback, or other input signal. As used herein, the term “machine” is intended to broadly encompass a single machine, or a system of communicatively coupled machines or devices operating together. Exemplary machines include computing devices such as personal computers, workstations, servers, portable computers, handheld devices, telephones, tablets, etc., as well as transportation devices, such as private or public transportation, e.g., automobiles, trains, cabs, etc.
The machine may include embedded controllers, such as programmable or non-programmable logic devices or arrays, Application Specific Integrated Circuits, embedded computers, smart cards, and the like. The machine may utilize one or more connections to one or more remote machines, such as through a network interface, modem, or other communicative coupling. Machines may be interconnected by way of a physical and/or logical network, such as an intranet, the Internet, local area networks, wide area networks, etc. One skilled in the art will appreciated that network communication may utilize various wired and/or wireless short range or long range carriers and protocols, including radio frequency (RF), satellite, microwave, Institute of Electrical and Electronics Engineers (IEEE) 810.11, Bluetooth, optical, infrared, cable, laser, etc.
The invention may be described by reference to or in conjunction with associated data including functions, procedures, data structures, application programs, etc. which when accessed by a machine results in the machine performing tasks or defining abstract data types or low-level hardware contexts. Associated data may be stored in, for example, the volatile and/or non-volatile memory, e.g., RAM, ROM, etc., or in other non-transitory storage devices and their associated storage media, including hard-drives, floppy-disks, optical storage, tapes, flash memory, memory sticks, digital video disks, biological storage, etc. Associated data may be delivered over transmission environments, including the physical and/or logical network, in the form of packets, serial data, parallel data, propagated signals, etc., and may be used in a compressed or encrypted format. Associated data may be used in a distributed environment, and stored locally and/or remotely for machine access.
Having described and illustrated the principles of the invention with reference to illustrated embodiments, it will be recognized that the illustrated embodiments may be modified in arrangement and detail without departing from such principles. And, though the foregoing discussion has focused on particular embodiments, other configurations are contemplated. In particular, even though expressions such as “in one embodiment” or the like are used herein, these phrases are meant to generally reference embodiment possibilities, and are not intended to limit the invention to particular embodiment configurations. As used herein, these terms may reference the same or different embodiments that are combinable into other embodiments.
Consequently, in view of the wide variety of permutations to the embodiments described herein, this detailed description and accompanying material is intended to be illustrative only, and should not be taken as limiting the scope of the invention. What is claimed as the invention, therefore, is all such modifications as may come within the scope and spirit of the following claims and equivalents thereto.

## Claims

1. A system, comprising:
a server;
a probable measure of meaning (PMM) database stored on the server, the PMM database storing PMMs for a plurality of tokens;
an input port to receive a content;
a token determination unit on the server operative to determine a token in said content;
a relative measure of meaning (RMM) calculation unit on the server operative to calculate a RMM for said token, factoring in a first probable measure of meaning (PMM) from the PMM database for said token and a plurality of second PMMs from the PMM database for a plurality of second tokens in said content using a proximity function (PF) according to





  
    
      R
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        M
        ⁡
        
          (
          
            token
            n
          
          )
        
      
    
    =
    
      P
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      M
      ⁢
      
        
      
      ⁢
      
        
          (
          
            token
            n
          
          )
        
        ⨯
        
          
            
              Mean
              d
            
            
              i
              =
              
                -
                d
              
            
          
          ⁡
          
            (
            
              P
              ⁢
              
                
              
              ⁢
              M
              ⁢
              
                
              
              ⁢
              
                M
                ⁡
                
                  (
                  
                    token
                    
                      n
                      -
                      i
                    
                  
                  )
                
              
              *
              P
              ⁢
              
                
              
              ⁢
              
                F
                ⁡
                
                  (
                  
                    
                      token
                      n
                    
                    ,
                    
                      token
                      
                        n
                        -
                        i
                      
                    
                    ,
                    i
                  
                  )
                
              
            
            )
          
        
      
    
  
  ;




and
an output port to output a report including the RMM of said token.

2. A system according to claim 1, wherein the PMM database is stored on a second server, said second server and the server connected via a network.

3. A system according to claim 1, further comprising a proximity function database.

4. A system according to claim 3, wherein the proximity function database is stored on the server.

5. A system according to claim 3, wherein the proximity function database is stored on a second server, said second server and the server connected via a network.

6. A method, comprising:
receiving a content at a server over a network;
identifying a first token in the content using the server;
determining a first probable measure of meaning (PMM) for the first token from a PMM database stored on the server;
identifying at least two second tokens;
determining a second PMM for each of the at least two second tokens from the PMM database stored on the server;
using a proximity function (PF) to modify each of the second PMMs for each of the at least two second tokens, the proximity function factoring in the first token and a distance between the first token and each of the at least two second tokens; and
generating a relative measure of meaning (RMM) for the first token, the RMM factoring in the first PMM for the first token and each of the modified PMMs for each of the at least two second tokens, according to





  
    R
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    
      M
      ⁡
      
        (
        
          token
          n
        
        )
      
    
  
  =
  
    P
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    
      
        
          (
          
            token
            n
          
          )
        
        ⨯
        
          
            
              Mean
              d
            
            
              i
              =
              
                -
                d
              
            
          
          ⁡
          
            (
            
              P
              ⁢
              
                
              
              ⁢
              M
              ⁢
              
                
              
              ⁢
              
                M
                ⁡
                
                  (
                  
                    token
                    
                      n
                      -
                      i
                    
                  
                  )
                
              
              *
              P
              ⁢
              
                
              
              ⁢
              
                F
                ⁡
                
                  (
                  
                    
                      token
                      n
                    
                    ,
                    
                      token
                      
                        n
                        -
                        i
                      
                    
                    ,
                    i
                  
                  )
                
              
            
            )
          
        
      
      .

7. A method according to claim 6, wherein:
identifying a first token in the content using the server includes identifying a first sentence in content using the server; and
identifying a second token includes identifying a second sentence.

8. A method according to claim 6, wherein:
identifying at least two second tokens includes identifying a second token preceding the first token and a third token following the first token;
determining a second PMM for each of the at least two second tokens from the PMM database includes determining the second PMM for the second token from the PMM database and determining a third PMM for the third token from the PMM database;
using a proximity function to modify each of the second PMMs for each of the at least two second tokens includes using the proximity function to modify the second PMM for the second token and to modify the third PMM for the third token, the proximity function factoring in the first token and the distance between the first token and the second token and third token; and
generating a RMM for the first token includes generating the RMM for the first token, the RMM factoring in the first PMM for the first token, the modified PMM for the second token, and the modified PMM for the third token.

9. A method according to claim 6, wherein:
identifying at least two second tokens includes identifying five second tokens preceding the first token and five third tokens following the first token;
determining a second PMM for each of the at least two second tokens from the PMM database includes determining a PMM for each of the five second tokens and the five third tokens from the PMM database;
using a proximity function to modify each of the second PMMs for each of the at least two second tokens includes using the proximity function to modify the second PMMs for each of the five second tokens and the five third tokens, the proximity function factoring in the first token and the distance between the first token and each of the five second tokens and the five third tokens; and
generating a RMM for the first token includes generating the RMM for the first token, the RMM factoring in the first PMM for the first token and the modified PMM for each of the five second tokens and the five third tokens.

10. A method according to claim 6, further comprising using the RMM to modify the PMM for the first token in the PMM database.

11. An article, comprising a non-transitory storage medium, said non-transitory storage medium having stored thereon instructions that, when executed by a machine server, result in:
receiving a content at a server over a network;
identifying a first token in the content using the server;
determining a first probable measure of meaning (PMM) for the first token from a PMM database stored on the server;
identifying at least two second tokens;
determining a second PMM for each of the at least two second tokens from the PMM database stored on the server;
using a proximity function (PF) to modify each of the second PMMs for each of the at least two second tokens, the proximity function factoring in the first token and a distance between the first token and each of the at least two second tokens; and
generating a relative measure of meaning (RMM) for the first token, the RMM factoring in the first PMM for the first token and the each of modified PMMs for each of the at least two second tokens, according to





  
    R
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    
      M
      ⁡
      
        (
        
          token
          n
        
        )
      
    
  
  =
  
    P
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    M
    ⁢
    
      
    
    ⁢
    
      
        
          (
          
            token
            n
          
          )
        
        ⨯
        
          
            
              Mean
              d
            
            
              i
              =
              
                -
                d
              
            
          
          ⁡
          
            (
            
              P
              ⁢
              
                
              
              ⁢
              M
              ⁢
              
                
              
              ⁢
              
                M
                ⁡
                
                  (
                  
                    token
                    
                      n
                      -
                      i
                    
                  
                  )
                
              
              *
              P
              ⁢
              
                
              
              ⁢
              
                F
                ⁡
                
                  (
                  
                    
                      token
                      n
                    
                    ,
                    
                      token
                      
                        n
                        -
                        i
                      
                    
                    ,
                    i
                  
                  )
                
              
            
            )
          
        
      
      .

12. An article according to claim 11, wherein:
identifying a first token in the content using the server includes identifying a first sentence in content using the server; and
identifying a second token includes identifying a second sentence.

13. An article according to claim 11, wherein:
identifying at least two second tokens includes identifying a second token preceding the first token and a third token following the first token;
determining a second PMM for each of the at least two second tokens from the PMM database includes determining the second PMM for the second token from the PMM database and determining a third PMM for the third token from the PMM database;
using a proximity function to modify each of the second PMMs for each of the at least two second tokens includes using the proximity function to modify the second PMM for the second token and to modify the third PMM for the third token, the proximity function factoring in the first token and the distance between the first token and the second token and third token; and
generating a RMM for the first token includes generating the RMM for the first token, the RMM factoring in the first PMM for the first token, the modified PMM for the second token, and the modified PMM for the third token.

14. An article according to claim 11, wherein:
identifying at least two second tokens includes identifying five second tokens preceding the first token and five third tokens following the first token;
determining a second PMM for each of the at least two second tokens from the PMM database includes determining a PMM for each of the five second tokens and the five third tokens from the PMM database;
using a proximity function to modify each of the second PMMs for each of the at least two second tokens includes using the proximity function to modify the second PMMs for each of the five second tokens and the five third tokens, the proximity function factoring in the first token and the distance between the first token and each of the five second tokens and the five third tokens; and
generating a RMM for the first token includes generating the RMM for the first token, the RMM factoring in the first PMM for the first token and the modified PMM for each of the five second tokens and the five third tokens.

15. An article according to claim 11, said non-transitory storage medium having stored thereon further instructions that, when executed by the server, result in using the RMM to modify the PMM for the first token from the PMM database.