Method for transforming words to unique numerical representation

• US 6,850,930 B2
• Filed: 03/13/2001
• Issued: 02/01/2005
• Est. Priority Date: 03/13/2001
• Status: Active Grant

• Current Assignee: Honeywell International Inc.
• Original Assignee: Honeywell International Inc.
• Inventors: Shetty, Ravindra K.
• Primary Examiner(s): Metjahic, Safet
• Assistant Examiner(s): LEROUX, ETIENNE PIERRE
• Application Number:
  US09/804,932
• Publication Number:
  US 20030023588A1
• Time in Patent Office: 1,421 Days
• Field of Search: 707/3, 707/4, 707/5, 707/6, 713/186, 341/106, 341/107, 704/4, 704/7, 704/9, 706/4, 706/12, 706/21
• US Class Current: 1/1
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

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.

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.

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;

$\left(W\right)=\underset{k=0}{\overset{l}{\sum <br><br>}}<br><br>\left\{\left({\mathrm{\beta <br><br>}}_{l-k}\right)<br><br>n^{l-k}+\left(l-k\right)\right\}$

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 β

<sub>(l−

1)</sub> β

<sub>(l−

2)</sub> . . . β

₀, and also wherein β

_i represents the letter in the i^th location of the alphabet in a particular language having n distinct letters in the alphabet of the language.

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;

$\left(W\right)=\underset{k=0}{\overset{l}{\sum <br><br>}}<br><br>\left\{\left({\mathrm{\beta <br><br>}}_{l-k}\right)<br><br>n^{l-k}+\left(l-k\right)\right\}$

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 β

<sub>(l−

1)</sub> β

<sub>(l−

2)</sub> . . . β

₀, and also wherein β

_i represents the letter in the i^th 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.

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:

$\left(W\right)=\underset{k=0}{\overset{l}{\sum <br><br>}}<br><br>\left\{\left({\mathrm{\beta <br><br>}}_{l-k}\right)<br><br>n^{l-k}+\left(l-k\right)\right\}$

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β

<sub>(l−

1)</sub>β

<sub>(l−

2)</sub> . . . β

₀, and also wherein β

_i represents the letter in the i^th location of the alphabet in a particular language having n distinct letters in the alphabet of the 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;

$\left(W\right)=\underset{k=0}{\overset{l}{\sum <br><br>}}<br><br>\left\{\left({\mathrm{\beta <br><br>}}_{l-k}\right)<br><br>n^{l-k}+\left(l-k\right)\right\}$

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β

<sub>(l−

1)</sub> β

<sub>(l−

2)</sub> . . . β

₀, and also wherein β

_i represents the letter in the i^th location of the alphabet in a particular language having n distinct letters in the alphabet of the language.