# Patent

## Title
Method for transforming words to unique numerical representation

## Abstract

Multiple words in a text are transformed to unique numerical representations for text mining applications. A web server receives the text, including multiple words in a natural language. A key-word extractor extracts one or more key-words from the received words. A morphologizer morphologizes the extracted key-words based on similarities of fundamental characteristics in the extracted key-words. An analyzer transforms each of the morphologized words to a unique numerical representation such that the transformed unique numerical representation does not result in multiple similar numerical representations.

## Background
FIELD OF THE INVENTION
This invention relates generally to the field of intelligent information retrieval, and more particularly pertains to text mining applications.
BACKGROUND
It is generally required to have unique numeric representation of words in any language for efficient processing in text mining applications such as natural language processing. The text form of words in a natural language is not an efficient representation of the words for text mining applications. For example, in a natural language, similarly spelt words can have entirely different meanings. Therefore, it is necessary that each word be mapped to a unique representation to avoid an overlap in the similarly spelt words. Currently, the words are generally mapped to a numerical domain to avoid an overlap in the similarly spelt words and to have unique numeric representations that can provide flexibility and computational efficiency in the text mining applications. Current methods to map the words in a text to unique numeric representations include methods such as ASCII conversion and random number generators. These methods can be very inefficient in mapping text to unique numeric representations, and can still generate overlapping numbers when multiple words are mapped to a numerical domain, which can result in ambiguous prediction of meaning during the text mining applications.
Therefore, there is a need in the art for a technique that can map the words in a text to unique numeric representations that can avoid overlapping of generated numbers, to provide flexibility and computational efficiency in text mining applications.
SUMMARY OF THE INVENTION
The present invention provides a system and a method for transforming multiple words in a text to unique numerical representations for text mining applications. The system and method includes a web server to receive a text including multiple words in a natural language. A key-word extractor extracts one or more key-words from the received words. A morphologizer morphologizes the extracted key-words based on similarities of fundamental characteristics in the extracted key-words. The similarities of fundamental characteristics can be based on underlying/basic meaning of words. In some embodiments, the morphologizing can include clustering of the extracted key-words based on statistical similarity of their contents. An analyzer transforms each of the morphologized words to a unique numerical representation such that the transformed unique numerical representation does not result in multiple similar numerical representations, to avoid ambiguous prediction of meaning of the translated words in the received text.
Other aspects of the invention will be apparent on reading the following detailed description of the invention and viewing the drawings that form a part thereof.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates an overview of one embodiment of a computer implemented system according to the present invention.
FIG. 2 illustrates a unique numerical representation in a helix graph.
FIG. 3 illustrates overall operation of the embodiment shown in FIG. 1.



DETAILED DESCRIPTION
This invention offers a technique for transforming multiple words in a text to a unique numerical representation such that the transformed numerical representation does not result in multiple similar (same or exact) numerical representations, to avoid ambiguous prediction of meaning (in the prior-art mapping technique, two or more words having different meaning can result in same numerical representation, which in can in turn result in ambiguous prediction of meaning or improper interpretation of the words of the translated words in the received text. The transformed unique numerical representations can be used to significantly improve the efficiency of text mining applications such as automated email response, automated text mining applications, unique key-word representations, and/or intelligent communication devices.
FIG. 1 illustrates an overview of one embodiment of a computer-implemented system 100 according to the present invention. A web server 140 is connected to receive text including multiple words in a natural language from various sources 130. For example, the web server 140 can receive text from sources such as a data base/data warehouse, a LAN/WAN network, Internet, a voice recognition system, and/or mobile/fixed phone. The computer-implemented system 100 allows users and/or visitors 110 to send the text via the various sources 130 via their computers 120.
The computer-implemented system 100 can include a key-word extractor 150. The key-word extractor 150 is connected to the web server 140 and extracts one or more key-words from the received text. In some embodiments, the key-word extractor 150 extracts one or more key-words based on specific criteria, such as for filtering the text to remove all words including three or fewer letters in the received text, or for filtering the text to remove rarely used words.
In some embodiments, a morphologizer 160 is connected to the computer-implemented system 100 to morphologize each of the filtered key-words for base formatting to improve the efficiency of processing the filtered key-words in the computer-implemented system 100. In some embodiments, morphing is based on classifying the extracted key-words based on similarities of fundamental characteristics in the extracted key-words (based on the basis of the extracted key-words). For example, morphing recasts/alters words such a way that the morphed word's pronunciation or their meaning remain in place and adheres to its fundamental meaning. The following table illustrates one embodiment of morpholizing words according to the present invention:












Example




Number
Word(s) in the text
Morphologized Word







1
Police
Polic


2
Policy
Polici


3
Worked
Work


4
Going
Go


5
Destination
Destin


6
Personalize
Person


7
Based
Base


8
Industrial
Industri


9
Connect, Connected, Connecting,
Connect



Connection, Connections









An analyzer 170 is connected to the computer-implemented system 100 transforms each of the morphologized words to a unique numerical representation such that the transformed unique numerical representation does not result in multiple similar numerical representations, to avoid ambiguous prediction of meaning of the translated words in the received text. In some embodiments, the analyzer transforms the morphologized words using following A to Z helix transformation function: 



  
    (
    W
    )
  
  =
  
    
      ∑
      
        k
        =
        0
      
      l
    
    ⁢
    
      {
      
        
          
            (
            
              β
              
                l
                -
                k
              
            
            )
          
          ⁢
          
            n
            
              l
              -
              k
            
          
        
        +
        
          (
          
            l
            -
            k
          
          )
        
      
      }
    
  




    
    
        wherein W is a unique number obtained by using the above transformation function for a word having a length of l+1 letters, wherein the letters in the word W can be represented as βl β(l−1) β(l−2) . . . β0, and also wherein βi represents the letter in the ith location of the alphabet in a particular language having n distinct letters in the alphabet of the language. For example, in English language, n will be equal to 26.
    
    


In some embodiments, the analyzer 170 transforms the key-words to a unique numerical representation using the A to Z helix transformation function.
The following example illustrates the process of transforming a word such as KEYBOARD (this can be a key-word or a morphologized word) using the A to Z helix transformation function.
Table I illustrates the process of representing letters in the word KEYBOARD.















TABLE I





WORD
K
E
Y
B
O
A
R
D
























βl
β(l−1)
β(l−2)
β(l−3)
β(l−4)
β(l−5)
β(l− 6)
β0



β7
β6
β5
β4
β3
β2
β1
β0










Table II illustrates the mapping of the represented letters in the natural language to a scale. In this example the word KEYBOARD is in English; therefore letters A to Z are mapped to a scale of 1 to 26 (since there are 26 letters in the English alphabet) for the A to Z helix transformation. The following table compares the mapping techniques employed by the present invention with the mapping technique employed by the prior art methods ASCII 1 and ASCII 2 to further clarify the differences in the mapping techniques.




















TABLE II







Letter
A
B
C
D
E
F
G
H
I
J
K
L
M





Alphabet location
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13


Upper Case ASCII
65
66
67
68
69
70
71
72
73
74
75
76
77


Lower Case ASCII
97
98
99
100 
101 
102 
103 
104 
105 
106 
107 
108 
109 





Letter
N
O
P
Q
R
S
T
U
V
W
X
Y
Z





Alphabet location
14
15
16
17
18
19
20
21
22
23
24
25
26


Upper Case ASCII
78
79
80
81
82
83
84
85
86
87
88
89
90


Lower Case ASCII
110 
111 
112 
113 
114 
115 
116 
117 
118 
119 
120 
121 
122 









Table III illustrates the computation of the word KEYBOARD using the A to Z helix transformation function. The computed “total” generates the unique numerical representation for the word KEYBOARD.












TABLE III





SL







·
Significant

Scaling
Priority


No
Parameters
Letter
Location (i)
(l)
Place Value




















1
Most
K
11
7
11 * 267 + (7 − 0)


2
Next
E
5
6
 5 * 266 + (7 − 1)


3

Y
25
5
25 * 265 + (7 − 2)


4

B
2
4
 2 * 264 + (7 − 3)


5

O
15
3
15 * 263 + (7 − 4)


6

A
1
2
 1 * 262 + (7 − 5)


7

R
18
1
18 * 261 + (7 − 6)


8
Least
D
4
0
 4 * 260 + (7 − 7)








Total
11 * 267 + 5 * 266 + 25 * 265 + 2 * 264 +



15 * 263 + 1 * 262 + 18 * 261 + 4 * 260 + (28) =



90192703308









Table IV illustrates example embodiments of the method of obtaining numerical representation for the word KEYBOARD using the prior art ASCII 1, ASCII 2 and random mapping methods.










TABLE IV






Example
Example
Example



Embodiment 1
Embodiment
Embodiment 3


Letter
(ASCII 1)
(ASCII 2)
(Random Mapping)







K
75
75
—


E
69
69
—


Y
89
89
—


B
66
66
—


O
79
79
—


A
65
65
—


R
82
82
—


D
68
68
—


Total
7569896679658268
593 
Random Number









The following illustrates by contradiction the unique numerical representation obtained using A to Z helix transformation function is really unique.
Let αi (i=1, 2, . . . n) be letters in a particular language, where n is the number of distinct letters in that language. For example, in English language n=26. Consider one word W of length l+1, which can be represented as βl β(l−1) β(l−2) . . . β0. where βi represents the letter in the ith location of the alphabet, which is a subset of α.
Mathematically any word of length l can be represented as 



  W
  =
  
    {
    
      
        ∏
        
          k
          =
          l
        
        0
      
      ⁢
      
        β
        k
      
    
    }
  




In the above word W the Most Significant Letter (MSL) and Least Significant Letter (LSL) are βl and β0, respectively.
(A to Z)w helix representation of the word W is represented by 



  
    (
    W
    )
  
  =
  
    
      ∑
      
        k
        =
        0
      
      l
    
    ⁢
    
      {
      
        
          
            (
            
              β
              
                l
                -
                k
              
            
            )
          
          ⁢
          
            n
            
              l
              -
              k
            
          
        
        +
        
          (
          
            l
            -
            k
          
          )
        
      
      }
    
  




Assuming two distinct words W1 and W2 of length l1 and l2 that have the same representation in the A to Z helix transformation, W1 and W2 are represented in the A to Z helix notation as 



  
    
      
        
          W
          1
        
        =
        
          
            ∑
            
              k
              =
              0
            
            
              l
              1
            
          
          ⁢
          
            {
            
              
                
                  (
                  
                    β
                    
                      
                        l
                        1
                      
                      -
                      k
                    
                  
                  )
                
                ⁢
                
                  n
                  
                    
                      l
                      1
                    
                    -
                    k
                  
                
              
              +
              
                (
                
                  
                    l
                    1
                  
                  -
                  k
                
                )
              
            
            }
          
        
      
    
    
      
        (
        1
        )
      
    
  
  
    
      
        
          W
          2
        
        =
        
          
            ∑
            
              k
              =
              0
            
            
              l
              2
            
          
          ⁢
          
            {
            
              
                
                  (
                  
                    β
                    
                      
                        l
                        2
                      
                      -
                      k
                    
                  
                  )
                
                ⁢
                
                  n
                  
                    
                      l
                      2
                    
                    -
                    k
                  
                
              
              +
              
                (
                
                  
                    l
                    2
                  
                  -
                  k
                
                )
              
            
            }
          
        
      
    
    
      
         
      
    
  




The following illustrates the three possible scenarios for the words W1 and W2:

    
    
        Scenario 1: l1<l2 
        Scenario 2: l1>l2 and
        Scenario 3: l1=l2 

Mathematical Illustration for Scenarios 1 and 2: When l1<l2 & l1>l2 

    
    


The A to Z helix representation of word W1 given by equation (1), 


  
    
      
        W
        1
      
      =
      
        
          ∑
          
            k
            =
            0
          
          
            l
            1
          
        
        ⁢
        
          {
          
            
              
                (
                
                  β
                  
                    
                      l
                      1
                    
                    -
                    k
                  
                
                )
              
              ⁢
              
                n
                
                  
                    l
                    1
                  
                  -
                  k
                
              
            
            +
            
              (
              
                
                  l
                  1
                
                -
                k
              
              )
            
          
          }
        
      
    
    ,
    
      can
      ⁢
      
         
      
      ⁢
      be
      ⁢
      
         
      
      ⁢
      rewritten
      ⁢
      
        
           
        
        ⁢
        
           
        
      
      ⁢
      as
    
  




  
    
      W
      1
    
    =
    
      
        {
        
          
            (
            
              
                
                  β
                  
                    l
                    1
                  
                
                ⁢
                
                  n
                  
                    l
                    1
                  
                
              
              +
              
                (
                
                  
                    l
                    1
                  
                  -
                  0
                
                )
              
            
            )
          
          +
          
            (
            
              
                
                  β
                  
                    (
                    
                      
                        l
                        1
                      
                      -
                      1
                    
                    )
                  
                
                ⁢
                
                  n
                  
                    l
                    1
                    
                      -
                      1
                    
                  
                
              
              +
              
                (
                
                  
                    l
                    1
                  
                  -
                  1
                
                )
              
            
            )
          
          +
          ...
          +
          
            (
            
              
                
                  β
                  
                    (
                    
                      
                        l
                        1
                      
                      -
                      
                        l
                        1
                      
                    
                    )
                  
                
                ⁢
                
                  n
                  
                    
                      l
                      1
                    
                    -
                    
                      l
                      1
                    
                  
                
              
              +
              
                (
                
                  
                    l
                    1
                  
                  -
                  
                    l
                    1
                  
                
                )
              
            
            )
          
        
        }
      
      =
      
        {
        
          
            (
            
              
                
                  
                    l
                    1
                  
                  ⁡
                  
                    (
                    
                      
                        l
                        1
                      
                      +
                      1
                    
                    )
                  
                
                •
              
              -
              
                
                  ∑
                  
                    k
                    =
                    0
                  
                  
                    l
                    1
                  
                
                ⁢
                k
              
            
            )
          
          +
          
            
              ∑
              
                k
                =
                0
              
              
                l
                1
              
            
            ⁢
            
              
                (
                
                  β
                  
                    
                      l
                      1
                    
                    -
                    k
                  
                
                )
              
              ⁢
              
                n
                
                  
                    l
                    1
                  
                  -
                  k
                
              
            
          
        
        }
      
    
  



Consider the maximum value of W1:

    
    
        W1 is maximum when βk=n, ∀ k and can be represented by 



  
    
      (
      
        W
        1
      
      )
    
    max
  
  =
  
    {
    
      
        (
        
          
            
              l
              1
            
            ⁢
            
              (
              
                
                  l
                  1
                
                +
                1
              
              )
            
          
          -
          
            
              ∑
              
                k
                =
                0
              
              
                l
                1
              
            
            ⁢
            k
          
        
        )
      
      +
      
        
          ∑
          
            k
            =
            0
          
          
            l
            1
          
        
        ⁢
        
          n
          ·
          
            n
            
              
                l
                1
              
              -
              k
            
          
        
      
    
    }
  




    
    


Consider the minimum value of W2, where W2 is a minimum when βk=1 and can be represented by 



  
    
      (
      
        W
        2
      
      )
    
    min
  
  =
  
    {
    
      
        (
        
          
            
              l
              2
            
            ⁢
            
              (
              
                
                  l
                  2
                
                +
                1
              
              )
            
          
          -
          
            
              ∑
              
                k
                =
                0
              
              
                l
                2
              
            
            ⁢
            k
          
        
        )
      
      +
      
        
          ∑
          
            k
            =
            0
          
          
            l
            2
          
        
        ⁢
        
          1
          ·
          
            n
            
              
                l
                2
              
              -
              k
            
          
        
      
    
    }
  




But in the beginning it was assumed that l1<l2l2≧(l1+1), W1≠W2 for |l2|>|l1|
Mathematical Illustration for Scenario 2: When l1>l2 
The proof is similar to l1<l2 
Thus from the above two scenarios
We have


    
    
        l1<l2 and
        l1>l2 
        l1=l2 

 only scenario 3 i.e. l1=l2 holds good in this case.

    
    


The above illustration proves that the two words W1 and W2 should at least have the same length to have the same A to Z helix representation. Now the following shows how to prove that the two words W1 and W2 are the same.
Mathematical Illustration for Scenario 3: When l1=l2 
Let us assume that W1 and W2 differ at ordered positions r1 r2 . . . rs then 


  
    
      W
      1
    
    =
    
      
        {
        
          
            
              β
              l
            
            ⁢
            
              n
              
                l
                -
                0
              
            
          
          +
          
            (
            
              l
              -
              0
            
            )
          
        
        }
      
      +
      
        {
        
          
            
              β
              
                (
                
                  l
                  -
                  1
                
                )
              
            
            ⁢
            
              n
              
                l
                -
                1
              
            
          
          +
          
            (
            
              l
              -
              1
            
            )
          
        
        }
      
      +
      
        ...
        ⁢
        
           
        
        ⁢
        
          {
          
            
              
                β
                0
              
              ⁢
              
                n
                
                  l
                  -
                  l
                
              
            
            +
            
              (
              
                l
                -
                l
              
              )
            
          
          }
        
      
      +
      
        {
        
          
            
              β
              
                r
                ⁢
                
                   
                
                ⁢
                1
              
            
            ⁢
            
              n
              
                l
                -
                
                  r
                  ⁢
                  
                     
                  
                  ⁢
                  1
                
              
            
          
          +
          
            (
            
              l
              -
              
                r
                1
              
            
            )
          
        
        }
      
      +
      
        {
        
          
            
              β
              r2
            
            ⁢
            
              n
              
                l
                -
                r2
              
            
          
          +
          
            (
            
              l
              -
              
                r
                2
              
            
            )
          
        
        }
      
      +
      ...
      +
      
        {
        
          
            
              β
              
                r
                ⁢
                
                   
                
                ⁢
                s
              
            
            ⁢
            
              n
              
                l
                -
                
                  r
                  ⁢
                  
                     
                  
                  ⁢
                  s
                
              
            
          
          +
          
            (
            
              l
              -
              
                r
                s
              
            
            )
          
        
        }
      
    
  




  
    
      W
      2
    
    =
    
      
        {
        
          
            
              β
              l
            
            ⁢
            
              n
              
                l
                -
                0
              
            
          
          +
          
            (
            
              l
              -
              0
            
            )
          
        
        }
      
      +
      
        {
        
          
            
              β
              
                (
                
                  l
                  -
                  1
                
                )
              
            
            ⁢
            
              n
              
                l
                -
                1
              
            
          
          +
          
            (
            
              l
              -
              1
            
            )
          
        
        }
      
      +
      ...
      +
      
        {
        
          
            
              β
              0
            
            ⁢
            
              n
              
                l
                -
                l
              
            
          
          +
          
            (
            
              l
              -
              l
            
            )
          
        
        }
      
      +
      
        {
        
          
            
              β
              
                r
                ⁢
                
                   
                
                ⁢
                1
              
              1
            
            ⁢
            
              n
              
                l
                -
                
                  r
                  ⁢
                  
                     
                  
                  ⁢
                  1
                
              
            
          
          +
          
            (
            
              l
              -
              
                r
                1
              
            
            )
          
        
        }
      
      +
      
        {
        
          
            
              β
              r2
              1
            
            ⁢
            
              n
              
                l
                -
                r2
              
            
          
          +
          
            (
            
              l
              -
              
                r
                2
              
            
            )
          
        
        }
      
      +
      ...
      +
      
        {
        
          
            
              β
              
                r
                ⁢
                
                   
                
                ⁢
                s
              
              1
            
            ⁢
            
              n
              
                l
                -
                
                  r
                  ⁢
                  
                     
                  
                  ⁢
                  s
                
              
            
          
          +
          
            (
            
              l
              -
              
                r
                s
              
            
            )
          
        
        }
      
    
  




  
    
      
        
          
            
              W
              1
            
            -
            
              W
              2
            
          
          =
          
            
              
                (
                
                  
                    β
                    r1
                  
                  -
                  
                    β
                    r1
                    1
                  
                
                )
              
              ⁢
              
                n
                
                  l
                  -
                  
                    r
                    ⁢
                    
                       
                    
                    ⁢
                    1
                  
                
              
            
            +
            
              
                (
                
                  
                    β
                    r2
                  
                  -
                  
                    β
                    r2
                    1
                  
                
                )
              
              ⁢
              
                n
                
                  l
                  -
                  
                    r
                    ⁢
                    
                       
                    
                    ⁢
                    2
                  
                
              
            
            +
            ...
            +
            
              
                (
                
                  
                    β
                    
                      r
                      ⁢
                      
                         
                      
                      ⁢
                      s
                    
                  
                  -
                  
                    β
                    
                      r
                      ⁢
                      
                         
                      
                      ⁢
                      s
                    
                    1
                  
                
                )
              
              ⁢
              
                n
                
                  l
                  -
                  
                    r
                    ⁢
                    
                       
                    
                    ⁢
                    s
                  
                
              
            
          
        
      
    
    
      
        
          =
          
            
              
                (
                
                  a
                  1
                
                )
              
              ⁢
              
                n
                
                  l
                  -
                  
                    r
                    ⁢
                    
                       
                    
                    ⁢
                    1
                  
                
              
            
            +
            
              
                (
                
                  a
                  2
                
                )
              
              ⁢
              
                n
                
                  l
                  -
                  
                    r
                    ⁢
                    
                       
                    
                    ⁢
                    2
                  
                
              
            
            +
            ...
            +
            
              
                (
                
                  a
                  s
                
                )
              
              ⁢
              
                n
                
                  l
                  -
                  
                    r
                    ⁢
                    
                       
                    
                    ⁢
                    s
                  
                
              
            
          
        
      
    
  



    
    
        where ai=(βrs−βrsl) for i: 1 to s, which is the relative positional difference of letters in the reference words,
        =0 (from our assumption)
    
    


The A to Z helix representation (W1)=The A to Z helix representation (W2)

i.e. (a1)nl−r1=−(a2nl−r2+ . . . +asnl−rs).  (2)

In the above equation (2), the minimum value of LHS is given by

min((a1)nl−r1)=nl−r1 (min when a1=1)

In the above equation (2), the maximum value of RHS is given by

max{−(a2nl−r2+ . . . +asnl−rs)}=min(a2nl−r2+ . . . +asnl−rs)

=1nl−r2+ . . . +1.nl−rs (min. when a2=a3= . . . =as=1)

    
    
        nl−r1>(nl−r2+ . . . +nl−rs) (From lemma 1)
        min of LHS>max RHS
        W1≠W2 
         
    
    


This contradicts our assumption that W1 and W2 have the same A to Z helix representation. Therefore the A to Z helix transformation results in a unique numerical representation.
The following example demonstrates the numerical representations obtained by using the prior art ASCII method are not unique when compared with the numerical representations obtained using the A to Z helix transformation function of the present invention for two example dissimilar words Warned and Medium. It can be seen that the prior art method ASCII yields a similar numerical representation for the two example dissimilar words, whereas the A to Z helix transformation function of the present invention yields a unique numerical representation for each of the above two dissimilar words.













Sl.

Cumulative ASCII
A to Z helix


No.
Word
representation
representation







1
Warned
449
7125419340


2
Medium
449
4077312590









In some embodiments, the analyzer 170 outputs the transformed unique numerical representations for use in text mining applications 180 such as automated email responses, automated text summarizations, unique keyword representations in any language, and/or intelligent communication devices.
The computer-implemented system 100 of the present invention includes various modules as described above, which can be implemented either in hardware or as one or more sequence steps carried out in a microprocessor, a microcontroller, or in an Application Specific Integrated Circuit (ASIC). It is understood that the various modules of the computer-implemented system 100 need not be separately embodied, but may be combined or otherwise implemented differently, such as in software and/or firmware.
FIG. 2 illustrates graphically 200 the principle of obtaining a unique numerical representation of a word using the A to Z helix transformation function. The helix graph 200 in FIG. 2 illustrates the principle by using the previously used example word KEYWORD in the helix graph 200. Where A to Z lines are formed using the beginning and extreme letters, respectively in the English language. The helix graph 200 is formed by using a new A to Z line (a new dimension) for each letter in the example word and projecting the position of each of the letters in the example word on to another new A to Z line (another new dimension) until all of the letters in the example word are projected. It can be seen from the helical graph 200 that the fourth or the fifth significant letter in the example key-word is more than sufficient to uniquely represent the word KEYBOARD using the helical graph 200.
FIG. 3 illustrates an overview of one embodiment of the process 300 of the present invention. This process 300 provides, as illustrated in element 310, a computer-implemented system including a web server. The web server receives text including multiple words in a natural language from various sources such as a data base, a LAN/WAN network, the Internet, a voice recognition system, and/or mobile/fixed phone. Some embodiments allow the text to be in any natural language.
Element 320 filters the receive text to obtain one or more key-words. In some embodiments, the received text is filtered based on specific criteria such as filtering to remove all words that include less than or equal to three letters.
Element 330 morphologizes the filtered key-words for base formatting to improve the efficiency of processing the received text by the computer-implemented system for text mining applications. In some embodiments, the morpholizing includes classifying the filtered key-words according to similarities in fundamental characteristics of the filtered key-words.
Element 340 transforms the morphologized words to unique numerical representations for use in the text mining applications. In some embodiments, element 340 transforms the key-words to unique numerical representations. The process of transforming the morphologized words to unique numerical representations is described in detail with reference to FIGS. 1 and 2.
Element 350 includes inputting the transformed unique numerical representations for text mining applications such as data mining operations, automated email responses, automated text summarization's, unique keyword representations in any language, and/or intelligent communication devices.
CONCLUSION
The above-described computer-implemented technique provides a method and apparatus to transform multiple words in a text to unique numeric representations that can avoid overlapping of generated numbers, to provide flexibility and computational efficiency for various text mining applications.
The above description is intended to be illustrative, and not restrictive. Many other embodiments will be apparent to those skilled in the art. The scope of the invention should therefore be determined by the appended claims, along with the full scope of equivalents to which such claims are entitled.

## Claims

1. A computer-implemented method for transforming words to unique numerical representations, comprising:
receiving a text including multiple words; and 
transforming each of the received words into a unique numeral representation by using an A to Z helix transformation function such that the transformed unique numerical representation does not result in multiple similar numerical representations.

2. The method of claim 1, wherein receiving the text comprises:
receiving the text from a source selected from the group consisting of a data base/data warehouse, a LAN/WAN network, the Internet, a voice recognition system, and a mobile/fixed phone.

3. The method of claim 1, further comprising:
filtering the received words to extract one or more key-words; and 
morphologizing each of the filtered one or more key-words for base formatting based on similarities of fundamental characteristics in the one or more words.

4. The method of claim 3, wherein the filtering the received words to extract the key-words comprises:
filtering the received words to extract one or more key-words based on a specific criteria selected from the group consisting of filtering to remove all words comprised of three or fewer letters, and filtering to remove rarely used words.

5. The method of claim 3, further comprising:
inputting each of the transformed unique numerical representations for text mining applications.

6. A computer-implemented method for transforming words expressed in letters of an alphabet based language to unique numerical representations, comprising:
receiving a text including multiple words; and 
transforming each of the received words into a unique numeral representation such that the transformed unique numerical representation does not result in multiple similar numerical representations, wherein each of the received words is transformed into the unique numerical representation using an A to Z helix transformation function, wherein the A to Z helix transformation function comprises: 



  
    (
    W
    )
  
  =
  
    
      ∑
      
        k
        =
        0
      
      l
    
    ⁢
    
      {
      
        
          
            (
            
              β
              
                l
                -
                k
              
            
            )
          
          ⁢
          
            n
            
              l
              -
              k
            
          
        
        +
        
          (
          
            l
            -
            k
          
          )
        
      
      }
    
  




wherein W is a unique number obtained for a word having a length of l+1 letters, wherein the letters in the word W can be represented as βl β(l−1) β(l−2) . . . β0, and also wherein βi represents the letter in the ith location of the alphabet in a particular language having n distinct letters in the alphabet of the language.

7. A computer-implemented system for transforming words in a text to unique numerical representations, comprising:
a web server to receive the text including multiple words in a natural language; 
a key-word extractor to extract one or more key-words from the received words; 
a morphologizer to morphologize the extracted key-words based on similarities in fundamental characteristics of the extracted key-words; and 
an analyzer to transform each of the morphologized words to a unique numerical representation by using an A to Z helix transformation function such that the transformed unique numerical representation does not result in multiple similar numerical representations.

8. The system of claim 7, wherein the key-word extractor extracts key-words based on a specific criteria selected from the group consisting of filtering to remove all words including three or fewer letters in the received text, and filtering to remove rarely used words.

9. The system of claim 7, wherein the analyzer outputs the transformed words including unique numerical representations for use in text mining.

10. The system of claim 7, wherein the received text can be in any language.

11. A computer-implemented system for transforming words in a text expressed in letters of an alphabet based language to unique numerical representations, comprising:
a web server to receive the text including multiple words in a natural language; 
a key-word extractor to extract one or more key-words from the received words; 
a morphologizer to morphologize the extracted key-words based on similarities in fundamental characteristics of the extracted key-words; and 
an analyzer to transform each of the morphologized words to a unique numerical representation such that the transformed unique numerical representation does not result in multiple similar numerical representations, wherein the analyzer transforms each of the morphologized words to a unique numerical representation using an A to Z helix transformation function, wherein the A to Z helix transformation function comprises: 



  
    (
    W
    )
  
  =
  
    
      ∑
      
        k
        =
        0
      
      l
    
    ⁢
    
      {
      
        
          
            (
            
              β
              
                l
                -
                k
              
            
            )
          
          ⁢
          
            n
            
              l
              -
              k
            
          
        
        +
        
          (
          
            l
            -
            k
          
          )
        
      
      }
    
  




wherein W is a unique number obtained for a word having a length of l+1 letters, wherein the letters in the word W can be represented as βlβ(l−1) β(l−2) . . . β0, and also wherein βi represents the letter in the ith location of the alphabet in a particular language having n distinct letters in the alphabet of the language.

12. The method of claim 1, wherein transforming each of the received words to a unique numerical representation, further comprises:
using the A to Z helix transformation function, wherein the A to Z helix transformation function comprises: 



  
    (
    W
    )
  
  =
  
    
      ∑
      
        k
        =
        0
      
      l
    
    ⁢
    
      {
      
        
          
            (
            
              β
              
                l
                -
                k
              
            
            )
          
          ⁢
          
            n
            
              l
              -
              k
            
          
        
        +
        
          (
          
            l
            -
            k
          
          )
        
      
      }
    
  




wherein W is a unique number obtained for a word having a length of l+1 letters, wherein the letters in the word W can be represented as βl β(l−1) β(l−2) . . . β0, and also wherein βi represents the letter in the ith location of the alphabet in a particular language having n distinct letters in the alphabet of the language.

13. The system of claim 7, wherein the analyzer further transforms each of the morphologized words to a unique numerical representation using the A to Z helix transformation function, wherein the A to Z helix transformation function comprises: 



  
    (
    W
    )
  
  =
  
    
      ∑
      
        k
        =
        0
      
      l
    
    ⁢
    
      {
      
        
          
            (
            
              β
              
                l
                -
                k
              
            
            )
          
          ⁢
          
            n
            
              l
              -
              k
            
          
        
        +
        
          (
          
            l
            -
            k
          
          )
        
      
      }
    
  



wherein W is a unique number obtained for a word having a length of l+1 letters, wherein the letters in the word W can be represented as βlβ(l−1)β(l−2) . . . β0, and also wherein βi represents the letter in the ith location of the alphabet in a particular language having n distinct letters in the alphabet of the language.