Word association method and apparatus

Description of equivalent WO 03102812 A1

WORD ASSOCIATION METHOD AND APPARATUS

RELATED APPLICATIONS

This application is a continuation-in-part of U.S. Application No. 10/157,894, filed on May 31, 2002, which in turn is a continuation-in-part of U.S. Application No. 10/024,473, filed on December 21, 2001, which claims the benefit of U.S. Provisional Application No. 60/276,107 filed March 16, 2001, and U.S. Provisional Application No. 60/299,472 filed June 21, 2001, all of which are hereby incoφorated by reference.

COMPUTER PROGRAM LISTING APPENDIX

This application includes computer program listings in appendices included in U.S. Application Serial No. 10/157,894, filed on May 31 , 2002, which is incorporated herein by reference.

FIELD OF THE INVENTION

This invention relates to a method and apparatus for creating a database for use in converting information from one state to a second state. In the preferred embodiment, the information is language, and the invention relates to a method and apparatus for creating an association database, with the database capable of being used in a language translation system.

BACKGROUND

Devices and methods for automatically translating documents from one language to another are known. However, these devices and methods often fail to accurately translate documents from one language to another, can consume large amounts of time and can be inconvenient to use. In addition to human-based translators, other known devices include commercially available machine translation software. These known systems have flaws that render them susceptible to errors, slow speed and inconvenience. Known translation devices and methods cannot consistently return accurate translations for text input and therefore frequently require intensive user intervention for proof reading and editing. Accurate machine translation is more complicated than providing devices and methods that make word-for-word translations of documents. In these word-for-word systems, the translation often times makes little sense to readers of the translated document, as the word-for-word method results in wrong word choices and incoherent grammatical units.

To overcome these deficiencies, known translation devices have for decades attempted to make choices of word translations within the context of a sentence based on a combination or set of lexical, moφhological, syntactic and semantic rules. These systems, known in the art as "Rule-Based" machine translation (MT) systems are flawed because there are so many exceptions to the rules that they cannot provide consistently accurate translation.

In addition to Rule-Based MT, in the last decade a new method for MT known as "example-based" (EBMT) has been developed. EBMT makes use of sentences (or possibly portions of sentences) stored in two different languages in a cross-language database. When a translation query matches a sentence in the database, the translation of the sentence in the target language is produced by the database providing an accurate translation in the second language. If a portion of a translation query matches a portion of a sentence in the database, these devices attempt to accurately determine which portion of the sentence mapped to the source language sentence is the translation of the query. EBMT systems cannot provide accurate translation of a broad language because the databases of potentially infinite cross-language sentences are built manually and will always be predominantly "incomplete." Another flaw of EBMT systems is that partial matches are not reliably translated. Systems that use statistical machine translation attempt to automate the creation of cross-language databases using pairs of translated documents in combination with a large coφus of documents in just the target language.. None of these systems use an algorithm that reliably and accurately distill the translations of a sufficient number of words and word- strings from a pair of translated documents to produce a reliable translation.

Some translation devices combine both Rule-Based, Statistical MT and/or EBMT engines. Although this combination of approaches may yield a higher rate of accuracy than either system alone, the results remain inadequate for use without significant user intervention and editing.

The problems faced when attempting to translate documents from one language to another can apply more generally to the problem of converting data representing ideas or information from one state, say words, into data representing the ideas in another state, for example, mathematical symbols. In such cases cross-idea association databases that associate data in one state with equivalent data in the second state must be consulted. Therefore, a need exists for an improved and more efficient method and apparatus for creating dictionaries or databases that associate equivalent ideas in different languages or states, (e.g., words, word- strings, sounds, movement and the like) and for translating or converting ideas conveyed by documents in one language or state into the same or similar ideas represented by documents in a second language or state. The invention relates to manipulating content using a cross-idea association database. In particular, the present invention provides a method and apparatus for creating a database of associated ideas and provides a method and apparatus for utilizing that database to convert ideas from one state into other states.

In one embodiment, and by example, the present invention provides a method and apparatus for creating a language translation database, where two languages form the database of associated ideas. The present invention also provides a method and apparatus for utilizing that language database to convert documents (representing ideas) from one language to another (or more generally, from one state to another). However, the present invention is not limited to language translation, although that preferred embodiment will be presented. The database creation aspect of the present invention may be applied to any ideas that are related in some manner but expressed in different states and the conversion aspect of the present invention may be applied to accurately translate ideas from one state to another.

In another embodiment, the database creation aspect of the present invention can be used to make associations between ideas within a single language and their relationship to one another, to be used in artificial intelligence applications.

The application of the present invention to a language translation embodiment will now be described. As used herein, the terms related to converting, translating, and manipulating are used interchangeably and in their broadest sense.

SUMMARY OF THE INVENTION One object of the present invention is to facilitate the efficient translation of documents from one language or state to another language or state by providing a method and apparatus for creating and supplementing cross-idea association databases. These databases generally associate data in a first form or state that represents particular ideas or pieces of information with data in a second form or state that represents the same ideas or pieces of information. Another obj ect of the present invention is to facilitate the translation of documents from one language or state to another language or state by providing a method and apparatus for creating a second document comprising data in a second state, form, or language, from a first document comprising data in a first state, form, or language, with the result that the first and second documents represent substantially the same ideas or information. Yet another object of the present invention is to facilitate the translation of documents from one language or state to another language or state by providing a method and apparatus for creating a second document comprising data in a second state, form, or language, from a first document comprising data in a first state, form, or language, with the result that the first and second documents represent substantially the same ideas or information, and wherein the method and apparatus includes using a cross-idea association database.

Yet another object of the present invention is to provide the translation of documents (in a broad sense, the conversion of ideas from one state to another state) in a real-time manner. Yet another object of the present invention is to provide a method and apparatus for creating a database for use in converting information from one state to a second state. In a preferred embodiment, the information is language, and the invention relates to a method and apparatus for creating an association database, with the database capable of being used in a language translation system.

The present invention achieves these and other objects by providing a method and apparatus for creating a cross-idea database. The method and apparatus for creating the cross- idea database can include providing two or more documents, each document being in a different language but representing substantially the same ideas. The documents can be exact translations of the same text, i.e. parallel text documents, or can be translations containing generally related text, i.e. comparable text documents. The present invention selects at least a first and a second occurrence of all words and word strings that have a plurality of occurrences in the first language in the available cross-language documents. It then selects at least a first word range and a second word range in the second language documents, wherein the first and second word ranges correspond to the first and second occurrences of the selected word or word-string in the first language documents. Next, it compares words and word-strings found in the first word range with words and word strings found in the second word range and, locating words and word- strings common to both word ranges, and stores those located common words and word strings in the cross-idea database. The invention then associates in said cross-idea database located common words or word strings in the two ranges in the second language with the selected word or word string in the first language, ranked by their association frequency (number of recurrences), after adjusting the association frequencies as detailed herein. By testing common word and word-strings across languages in Parallel or Comparable Texts, the database will resolve more associations as more Parallel or Comparable Text becomes available in a variety of different languages.

The present invention also achieves these and other objectives by providing a method and apparatus for converting a document from one state to another state. The present invention provides a database comprised of data segments in a first language associated with data segments in a second language (created through methods described above or manually). The present invention translates text by accessing the above-referenced database, and identifying the longest word string in the document to be translated (measured by number of words) beginning with the first word of the document, that exists in the database. The system then retrieves from the database a word string in the second language associated with the located word string from the document in the first language. The system then selects a second word string in the document that exists in the database and has an overlapping word (or alternatively word string) with the previously identified word string in the document, and retrieves from the database a word string in the second language associated with the second word string in the first language. If the word string associations in the second language have an overlapping word (or alternatively words) the word string associations in the second language are combined (eliminating redundancies in the overlap) to form a translation; if not, other second language associations to the first language word strings are retrieved and tested for combination through an overlap of words until successful. The next word string in the document in first language is selected by finding the longest word string in the database that has an overlapping word (or alternatively words) with the previously identified first language word string, and the above process continued until the entire first language document is translated into a second language document.

The present invention also creates frequency tables to determine the association between two or more words or word strings so that the frequency tables may be utilized in other applications including those involved in converting content from one state to a second state. The frequency tables are created by examining documents in a given state (e.g., a given language) and determining the frequency at which two words and/or word strings are related based on the proximity to a word or word string in the text. Thus, for example, by examining texts in the English language frequency tables, associations can be established for words or word strings related to the phrase "Mount Everest," such as "mountain," "highest place in the world," "snow," "climb," "people died," and "cold." These frequency tables may then be utilized in any number of ways in smart applications to answer questions by identifying common associations on two or more frequency tables. Databases created for smart applications can be built from documents in a single language (or alternatively using cross-language text).

BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 shows an embodiment of a cross-idea database according to the present invention.

Figure 2 shows an embodiment of a computer system of the present invention for implementing the methods of the present invention.

Figure 3 shows a memory device of the computer system of the present invention containing programs for implementing the methods of the present invention. DETAILED DESCRIPTION OF THE INVENTION

The present invention provides a method and apparatus for creating and supplementing a cross-idea database and for translating documents from a first language or state i to a second language or state using a cross-idea database. Documents as discussed herein are collections of information as ideas that are represented by symbols and characters fixed in some medium. For example, the documents can be electronic documents stored on magnetic or optical media, or paper documents, such as books. The symbols and characters contained in documents represent ideas and information expressed using one or more systems of expression intended to be understood by users of the documents. The present invention manipulates documents in a first state, i.e., containing information expressed in one system of expression, to produce documents in a second state, i.e., containing substantially the same information expressed using a second system of expression. Thus, the present invention can manipulate or translate documents between systems of expression, for example, written and spoken languages such as English, Hebrew, and Cantonese, into other languages.

A system or apparatus for implementing the content conversion or content manipulation method of the present invention can be a computer system 200, shown in figure 2. The computer system 200 includes a processor 202 coupled via a bus 214 to a memory 208, an input device 210, and an output device 212. The computer system 200 can also include a storage device 204 and a network interface 206. The processor 202 accesses data and programs stored in the memory 208. By executing the programs in memory 208, the processor can control the computer system 200, and can carry out steps to manipulate data and to control devices including, for example, the input device 210, the output device 212, the storage device 204, the network interface 206, arid the memory 208. Programs stored in memory 208 can include steps to perform the methods of the present invention such as content conversion, associating words and word strings, and database creation and supplementing methods. The storage device 204 records and stores information for later retrieval by the memory

208 processor 202, and can include storage devices known in the art such as, for example, nonvolatile memory devices, magnetic disc drives, tape drives, and optical storage devices. Storage device 204 can store programs and data, including databases that can be transferred to the memory 208 for use by the processor 202. Complete databases or portions of databases can be transferred to memory 208 for access and manipulation by the processor 202. The network interface 206 provides an interface between the computer system 200 and a network 216 such as the Internet, and transforms signals from the computer system 200 into a format that can be transmitted over the network 216, and vice versa. The input device 210, can include, for example, a keyboard and a scanner for inputting data into mόmory 208 and into the storage device 204. Input data can include text of documents to be stored in a document database for analysis and content conversion. The output device 212 includes devices for presenting information to a computer system user and can include, for example, a monitor screen and a printer.

A detailed description of the present invention, including the database creation method and apparatus, and the conversion method and apparatus, will now be described.

Database Creation Method and Apparatus The method of the present invention makes use of a cross-idea database for document content manipulation. Figure 1 depicts an embodiment of a cross-idea database. This embodiment of a cross-idea database comprises a listing of associated data segments in columns 1 and 2. The data segments are symbols or groupings of characters that represent a particular idea or piece of information in a system of expression. Where a system of expression in a

^document is a word language for example, a segment can be a word or a string of words. Thus, System A Segments in column 1 are data segments that represent various ideas and combination of ideas Dal, Da2, Da3 and Da4 in a hypothetical system of expression A. System B Segments in column 2 are data segments Dbl, Db3, Db4, Db5, Db7, Db9, DblO and Dbl2, that represent various ideas and some of the combinations of those ideas in a hypothetical system of expression B that are ordered by association frequency with data segments in system of expression A. Column 3 shows the Direct Frequency, which is the number of times the segment or segments in language B were associated with the listed segment (or segments) in language A. Column 4 shows the Frequencies after Subtraction, which represents the number of times a data segment (or segments) in language B has been associated with a segment (or segments) in language A after subtracting the number of times that segment (or segments) has been associated as part of a larger segment, as described more fully later.

As shown in Figure 1, it is possible that a single segment, say Dal is most appropriately associated with multiple segments, Dbl together with Db3 and Db4. The higher the Frequencies after Subtraction (as described herein) between data segments, the higher the probability that a system A segment is equivalent to a system B segment. In addition to measuring adjusted frequencies by total number of occurrences, the adjusted frequencies can also be measured, for example, by calculating the percentage of time that particular system A segments have corresponded to a particular system B segments. When the database is used to translate a document, the highest ranked associated segment will be retrieved from the database first in the process. Often, however, the method used to test the combination of associated segments for translation (as described later) determines that a different, lower ranked association should be tested because the higher ranked association, once tested, can not be used. For example, if the database was queried for an association for Dal, it would return Dbl+Db3+Db4; if Dbl+Db3+Db4 could not be used as determined by the process that accurately combines data segments for translation, the database would then return Db9+Dbl0 to test for accurate combination with another associated segment, for translation.

In general, the method for creating a cross-idea database of the present invention includes examining and operating on Parallel or Comparable Text. The method and apparatus of the present invention is utilized such that a database is created with associations across the two states - accurate conversions, or more specifically, associations between ideas as expressed in one state and ideas as expressed in another. The translation and other relevant associations between the two states become stronger, i.e. more frequent, as more documents are examined and operated on by the present invention, such that by operation on a large enough "sample" of documents the most common (and, in one sense, the correct) association becomes apparent and the method and apparatus can be utilized for conversion puφoses. In one embodiment of the present invention, the two states represent word languages

(e.g., English, Hebrew, Chinese, etc.) such that the present invention creates a cross-language database correlating words and word-strings in one language to their translation counteφarts in a second language. Word-strings may be defined as groups of consecutive adjacent words and often include punctuation and any other mark used in the expression of language. In this example, the present invention creates a database by examining documents in the two languages and creating a database of translations for each recurring word or word string in both languages. However, the present invention need not be limited to language translation. The present invention allows a user to create a database of ideas and associate those ideas to other, differing ideas in a hierarchical manner. Thus, ideas are associated with other ideas and rated according to the frequency of the occurrence. The specific weight given to the occurrence frequency, and the use applied to the database thus created, can vary depending upon the user's requirements. For example, in the context of converting text from one language to another the present invention will operate to create language translations of words and word strings between the English and Chinese languages. The present invention will return a ranking of associations between words and word-strings across the two languages. Given a large enough sample size, the word or word-string occurring the most often will be one of the Chinese equivalents of the English word or word-string. However, the present invention will also return other Chinese language associations for the English words or word-strings, and the user may manipulate those associations as desired. For example, the word "mountain," when operated on according to the present invention may return a list of Chinese language words and word strings in the language being examined. The Chinese language equivalents of the word "mountain" will most likely be ranked the highest; however, the present invention will return other foreign language words or word-strings associated with "mountain," such as "snow", "ski", "a dangerous sport", "the highest point in the world", or "Mt. Everest." These words and word-strings, which will likely be ranked lower than the translations of "mountain," can be manipulated as desired by the user. Thus, the present invention is an automated association database creator. The strongest associations represent "translations" or "conversions" in one sense, but other frequent (but weaker) associations represent ideas that are closely related to the idea being examined. The databases can therefore, be used by systems using artificial intelligence applications that are well known in the art. Those systems currently use incomplete, manually created idea databases or ontologies as "neural networks" for applications. These databases of associated ideas for artificial intelligence applications can be built using any user-defined range from documents in a single language. . Another embodiment of the present invention utilizes a computing device such as a personal computer system of the type readily available in the prior art. Although the computing device is typically a common personal computer (either stand-alone or in a networked environment), other computing devices such as PDA's, wireless devices, servers, mainframes, and the like are similarly contemplated. However, the method and apparatus of the present invention does not need to use such a computing device and can readily be accomplished by other means, including manual creation of the cross-associations. The method by which successive documents are examined to enlarge the "sample" of documents and create the cross- association database is varied — the documents can be set up for analysis and manipulation manually, by automatic feeding (such as automatic paper loaders as known in the prior art), or by using search techniques on the Internet to automatically seek out the related documents such as Web Crawlers. Note that the present invention can produce an associated database by examining Comparable Text, in addition to (or even instead of) Parallel Text. Furthermore, the method looks at all available documents collectively when searching for a recurring word or word-string within a language.

Building the Database

According to the present invention, the documents are examined for the puφose of building the database. After document input (again, of a pair of documents representing the same text in two different languages), the creation process begins using the methods and/or apparatus described herein.

For illustrative puφoses, assume that the documents contain the same content (or, in a general sense, idea) in two different languages. Document A is in language A, Document B is in language B. The documents have the following text:

<img file="EP1556784A1_D0001.tif" />

The first step in the present invention is to calculate a word range to determine the approximate location of possible associations for any given word or word string. Since a cross- language word-to-word analysis alone will not yield productive results (i.e., word 1 in document A will often not exist as the literal translation of word 1 in document B), and the sentence structure of one language may have an equivalent idea in a different location (or order) of a sentence than another language, the database creation technique of the present invention associates each word or word-string in the first language with all of the words and word strings found in a selected range in the second language document. This is also important because one language often expresses ideas in longer or shorter word strings than another language. The range is determined by examining the two documents, and is used to compare the words and word-strings in the second document against the words and word-strings in the first document.

That is, a range of words or word-strings in the second document is examined as possible associations for each word and word string in the first document. By testing against a range, the database creation technique establishes a number of second language words or word-strings that may equate and translate to the first language words and word-strings. There are two attributes that must be determined in order to establish the range in the second language document in which to look for associations for any given word or word string in the first language document. The first attribute is the value or size of the range in the second document, measured by the number of words in the range. The second attribute is the location of the range in the second document, measured by the placement of the mid-point of the range. Both attributes are user defined, but examples of preferred embodiments are offered below. In defining the size and location of the range, the goal is to insure a high probability that the second language word or word-string translation of the first language segment being analyzed will be included.

Various techniques can be used to determine the size or value of the range including common statistical techniques such as the derivation of a bell curve based on the number of words in a document. With a statistical technique such as a bell curve, the range at the beginning and end of the document will be smaller than the range in the middle of the document. A bell- shaped frequency for the range allows reasonable chance of extrapolation of the translation whether it is derived according to the absolute number of words in a document or according to a certain percentage of words in a document. Other methods to calculate the range exist, such as a "step" technique where the range exists at one level for a certain percentage of words, a second higher level for another percentage of words, and a third level equal to the first level for the last percentage of words. Again, all range attributes can be user defined or established according to other possible parameters with the goal of capturing useful associations for the word or word string being analyzed in the first language.

The location of the range within the second language document may depend on a comparison between the number of words in the two documents. What qualifies as a document for range location puφoses is user defined and is exemplified by news articles, book chapters, and any other discretely identifiable units of content, made up of multiple data segments. If the word count of the two documents is roughly equal, the location of the range in the second language will roughly coincide with the location of the word or word-string being analyzed in the first language. If the number of the words in the two documents is not equal, then a ratio may be used to correctly position the location of the range. For example, if document A has 50 words and document B has 100 words, the ratio between the two documents is 1 :2. The midpoint of document A is word position 25. If word 25 in document A is being analyzed, however, using this mid-point (word position 25) as the placement of the midpoint of the range in document B is not effective, since this position (word position 25) is not the midpoint of document B. Instead, the midpoint of the range in document B for analysis of word 25 in document A may be determined by the ratio of words between the two documents (i.e., 25 X 2/1 = 50), by manual placement in the mid-point of document B or by other techniques.

By looking at the position of a word or word-string in the document and noting all the word or word strings that fall within the range as described above, the database creation technique of the present invention returns a possible set of words or word-strings in the second- language document that may translate to each word or word-string in the first document being analyzed. As the database creation technique of the present invention is utilized, the set of words and word strings that qualify as possible translations will be narrowed as association frequencies develop. Thus, after examining a pair of documents, the present invention will create association frequencies for words and word strings in one language with words or word strings in a second language. After a number of document pairs are examined according to the present invention (and thus a large sample created), the cross-language association database creation technique will return higher and higher association frequencies for any one word or word string. After a large enough sample, the highest association frequencies result in possible translations; of course, the ultimate point where the association frequency is deemed to be an accurate translation is user defined and subject to other inteφretive translation techniques (such as those described in Provisional Application No. 60/276,107, entitled "Method and Apparatus for Content Manipulation" filed on March 16, 2001 and incoφorated herein by reference).

As indicated above, the invention tests not only words but also strings of words (multiple words). As mentioned, word strings include all punctuation and other marks as they occur.

After a single word in a first language is analyzed, the database creation technique of the present invention analyzes a two-word word string, then three-word word string, and so on in an incremental manner. This technique makes possible the translation of words or word strings in one language that translate into a shorter or longer word-string (or word) in another language, as often occurs. If a word or word-string only occurs once in all available documents in the first language, the process immediately proceeds to analyze the next word or word string, where the analysis cycle occurs again. The analysis stops when all word or word strings that have multiple occurrences in the first language in all available Parallel and Comparable Text have been analyzed.

In a sense, any number of documents are aggregated and can be treated as one single document for puφoses of looking for recurring of words or word strings. In essence, for a word or word-string not to repeat it would have to occur only once in all available Parallel and Comparable Text. In addition, as another embodiment it is possible to examine the range corresponding to every word and word string regardless of whether or not it occurs more than once in all available Comparable and Parallel Text. As another embodiment, the database can be built by resolving specific words and word strings that are part of a query. When words and word strings are entered for translation, the present invention can look for multiple occurrences of the words or word-strings in cross-language documents stored in memory that have not yet been analyzed, by locating cross-language text on the Internet using web-crawlers and other devices and, finally, by asking the user to supply a missing association based on the analysis of the query and the lack of sufficiently available cross-language material. The present invention thus operates in such a manner so as to analyze word strings that depend on the correct positioning of words (in that word string), and can operate in such a manner so as to account for context of word choice as well as grammatical idiosyncrasies such as phrasing, style, or abbreviations. These word string associations are also useful for the double overlap translation technique that provides the translation process as described herein.

It is important to note, that the present invention can accommodate situations where a subset word or word string of a larger word string is consistently returned as an association for the larger word string. The present invention accounts for these patterns by manipulating the frequency return. For example, proper names are sometimes presented complete (as in "John Doe"), abbreviated by first or surname ("John" or "Doe"), or abbreviated by another manner ("Mr. Doe"). Since the present invention will most likely return more individual word returns than word string returns (i.e., more returns for the first or surnames rather than the full name word string "John Doe"), because the words that make up a word string will necessarily be counted individually as well as part of the phrase, a mechanism to change the ranking should be utilized. For example, in any document the name "John Doe" might occur one hundred times, while "John" by itself or as part of John Doe might occur one hundred-twenty times, and "Doe" by itself or as part of John Doe might occur one hundred-ten times. The normal translation return (according to the present invention) will rank "John" higher than "Doe," and both of those words higher than the word string "John Doe" - all when attempting to analyze the word string "John Doe." By subtracting the number of occurrences of the larger word string from the occurrences of the subset (or individual returns) the proper ordering may be accomplished (although, of course, other methods may be utilized to obtain a similar result). Thus, subtracting one hundred (the number of occurrences for "John Doe"), from one hundred twenty (the number of occurrences for the word "John"), the corrected return for "John" is twenty. Applying this analysis yields one-hundred as the number of occurrences for the word string "John Doe" (when analyzing and attempting to translate this word string), twenty for the word "John," and ten for the word string "Doe," thus creating the proper associations.

Note that this issue is not limited to proper names and often occurs in common phrases and in many different contexts. For example, every time the word-string "I love you" is translated to its most frequent word-string association in another language, the word for "love" in that other language maybe associated independently each of those times as well. Additionally, when the word-string is translated differently in other text that is analyzed, the word "love" may again be associated. This will skew the analysis and return the word "love" in the second language instead of "I love you" in the second language for the translation of "I love you" in the first language. Therefore, once again, the system subtracts the number of occurrences of the larger word-string association, from the frequency of all subset associations when ranking associations for the larger string. These concepts are also reflected in Figure 1.

Additionally, the database can be instructed to ignore common words such as "it", "an", "a", "of, "as", "in", and the like - or any common words when counting association frequencies for words and word-strings. This will more accurately reflect the true association frequency numbers that will otherwise be skewed by the numerous occurrences of common words as part of any given range. This allows the association database creation technique of the present invention to prevent common words from skewing the analysis without excessive subtraction calculations. It should be noted that if these or any other common words are not "subtracted" out of the association database, they would ultimately not be approved as a translation, unless appropriate, because the double overlap process described in more detail herein would not accept it. It should be noted that other calculations to adjust the association frequencies could be made to insure the accurate reflection of the number of common occurrences of word and word strings. For example, an adjustment to avoid double counting may be appropriate when the ranges of analyzed words overlap. Adjustments are desirable in these cases to biήTd more accurate association frequencies. An example of an embodiment of the method and apparatus for creating and supplementing a cross-idea database according to the present invention will now be described using the two documents described above as an example — the table is re-created as follows:

Table 1

<img file="EP1556784A1_D0002.tif" />

Note once again that although this embodiment focuses on recurring words and word- strings in only a single document, this is mainly for illustrative puφoses. Recurring words and word-strings will be analyzed using all available Parallel and Comparable Text in the aggregate. Using the two documents listed above (A, the first language and B, the second language), the following steps occur for the database creation technique.

Step 1. First, the size and location of the range is determined. As indicated, the size and location may be user defined or may be approximated by a variety of methods. The word count of the two documents is approximately equal (ten words in document A, eight words in document B) therefore we will locate the mid-point of the range to coincide with the location of the word or word string in the document A. (Note: As the ratio of word counts between the documents is 80%, the location of the range alternatively could have been established applying a fraction 4/5 ths). In this example, a range size or value of three may provide the best results to approximate a bell curve; the range will be (+/-) 1 at the beginning and end of the document, and (+/ -) 2 in the middle. However, as indicated, the range (or the method used to determine the range) is entirely user defined.

Step 2. Next, the first word in document A is examined and tested against document A to determine the number of occurrences of that word in the document. In this example the first word in document A is X: X occurs three times in document A, at positions 1, 4. and 9. The position numbers of a word or word string are simply the location of that word, or word string in the document relative to other words. Thus, the position numbers correspond to the number of words in a document, ignoring punctuation - for example, if a document has ten words in it, and the word "king" appears twice, the position numbers of the word "king" are merely the places (out often words) where the word appears. Because word X occurs more than once in the document, the process proceeds to the next step. If word X only occurred once, then that word would be skipped and the process continued to the next word and the creation process continued.

Step 3. Possible second language translations for first language word X at position

1 are returned: applying the range to document B yields words at positions 1 and 2 (1 +/- 1) in document B: AA and BB (located at positions 1 and 2 in document B). All possible combinations are returned as potential translations or relevant associations for X: AA, BB, and AA BB (as a word string combination). Thus, XI (the first occurrence of word X) returns AA, BB, and AA BB as associations.

Step 4. The next position of word X is analyzed. This word (X2) occurs at position 4. Since position 4 is near the center of the document, the range (as determined above) will be two words on either side of position 4. Possible associations are returned by looking at word 4 in document B and applying the range (+/-)2 - hence, two words before word 4 and two words after word 4 are returned. Thus, words at positions 2, 3, 4, 5, and 6 are returned. These positions correspond to words BB, CC, AA, EE, and FF in document B. All forward permutations of these words (and their combined word strings) are considered Thus, X2 returns BB, CC, AA, EE, FF, BB CC, BB CC AA, BB CC AA EE, BB CC AA EE FF, CC AA, CC AA EE, CC AA EE FF, AA EE, AA EE FF, and EE FF as possible associations.

Step 5. The returns of the first occurrence of X (position 1) are compared to the returns of the second occurrence of X (position 4) and matches are determined. Note that returns which include the same word or word string occurring in the overlap of the two ranges should be reduced to a single occurrence. For example, in this example the word at position 2 is BB; this is returned both for the first occurrence of X (when operated on by the range) and the second occurrence of X (when operated on by the range). Because this same word position is returned for both XI and X2, the word is counted as one occurrence. If, however, the same word is returned in an overlapping range, but from two different word positions, then the word is counted twice and the association frequency is recorded. In this case the returns for word X is AA, since that word (AA) occurs in both association returns for XI and X2. Note that the other word that occurs in both association returns is BB; however, as described above, since that word is the same position (and hence the same word) reached by the operation of the range on the first and second occurrences of X, the word can be disregarded.

Step 6. The next position of word X (position 9) (X3) is analyzed. Applying a range of (+/-) 1 (near the end of the document) returns associations at positions 8, 9 and 10 of document B. Since document B has only 8 positions, the results are truncated and only word position 8 is returned as possible values for X: CC. (Note: alternatively, user defined parameters could have called for a minimum of two characters as part of the analysis that would have returned position 8 and the next closest position (which is GG in position 7)).

Comparing X3's returns to Xl's returns reveals no matches and thus no associations. . Step 7. The next position of word X is analyzed; however, there are no more occurrences of word X in document A. At this point an association frequency of one (1) is established for word X in Language A, to word AA in Language B.

Step 8. Because no more occurrences of word X occur, the process is incremented by a word and a word string is tested. In this case the word string examined is "X Y", the first two words in document A. The same technique described in steps 2-7 are applied to this phrase. Step 9. By looking at document A, we see that there is only one occurrence of the word string X Y. At this point the incrementing process stops and no database creation occurs. Because an end-point has been reached, the next word is examined (this process occurs whenever no matches occur for a word string); in this case the word in position 2 of document A i_s^«γ".

Step 10. Applying the process of steps 2-7 for the word "Y" yields the following: Two occurrences of word Y (positions 2 and 7) exist, so the database creation process continues

(again, if Y only occurred once in document A, then Y would not be examined);

The size of the range at position 2 is (+/-) 1 word;

Application of range to document B (position 2, the location of the first occurrence of word Y) returns results at positions 1, 2, and 3 in document B;

The corresponding foreign language words in those returned positions are: AA, BB, and CC;

Applying forward-permutations yields the following possibilities for Yl: AA, BB, CC, AA BB,

AA BB CC, and BB CC;

The next position of Y is analyzed (position 7);

The size of the range at position 7 is (+/-) 2 words;

Application of that range to document B (position 7) returns results at positions 5, 6, 7, and 8:

EE FF GG and CC;

All permutations yield the following possibilities for Y2: EE, FF, GG, CC, EE FF, EE FF GG,

EE FF GG CC, FF GG, FF GG CC, and GG CC;

Matching results from Yl returns CC as the only match;

Combining matches for Yl and Y2 yields CC as an association frequency for Y.

Step 11. End of range incrementation: Because the only possible match for word Y

(word CC) occurs at the end of the range for the first occurrence of Y (CC occurred at position 3 in document B), the range is incremented by 1 at the first occurrence to return positions 1, 2, 3, and 4: AA, BB, CC, and AA; or the following forward permutations: AA, BB, CC, AA BB, AA BB CC, AA BB CC AA, BB CC, BB CC AA, and CC AA. Applying this result still yields CC as a possible translation for Y. Note that the range was incremented because the returned match was at the end of the range for the first occurrence (the base occurrence for word "Y"); whenever this pattern occurs an end of range incrementation will occur as a sub-step (or alternative step) to ensure completeness.

Step 12. Since no more occurrences of "Y" exist in document A, the ^"analysis increments one word in document A and the word string "Y Z" is examined (the next word after word Y). Incrementing to the next string (Y Z) and repeating the process yields the following: Word string Y Z occurs twice in document A: position 2 and 7 Possibilities for Y Z at the first occurrence (Y Zl) are AA, BB, CC, AA BB, AA BB CC, BB CC; (Note, alternatively the range parameters could have been defined to include the expansion of the size of the range as word strings being analyzed in language A get longer.)

Possibilities for Y Z at the second occurrence (Y Z2) are EE, FF, GG, CC, EE FF, EE FF GG,

EE FF GG CC, FF GG, FF GG CC, and GG CC;

Matches yield CC as a possible association for word string Y Z;

Extending the range (the end of range incrementation) yields the following for Y Z: AA, BB, CC, AABB, AABB CC, AABB CCAA, BB CC,BB CC AA, andCCAA.

Applying the results still yields CC as an association frequency for word string Y Z.

Step 13. Since no more occurrences of "Y Z" exist in document A, the analysis increments one word in document A and the word string "Y Z X" is examined (the next word after word Z at position 3 in document A). Incrementing to the next word string (Y Z X) and repeating the process (Y Z X occurs twice in document A) yields the following: Returns for first occurrence of Y Z X are at positions 2, 3, 4, and 5; Permutations are BB, CC, AA, EE, BB CC, BB CC AA, BB CC AA EE, CC AA, CC AA EE, and AA EE;

Returns for second occurrence of Y Z X are at positions 5, 6, 7, and 8; Permutations are EE, FF, GG, CC, EE FF, EE FF GG, EE FF GG CC, FF GG, FF GG CC, and GG CC.

Comparing the two yields CC as an association frequency for word string Y Z X; again, note that the return of EE as a possible association is disregarded because it occurs in both instances as the same word (i.e., at the same position).

Step 14. Incrementing to the next word string (Y Z X W) finds only one occurrence; therefore the word string database creation is completed and the next word is examined: Z (position 3 in document A).

Step 15. Applying the steps described above for Z, which occurs 3 times in document A, yields the following:

Returns for Zl are: AA, BB, CC, AA, EE, AA BB, AA BB CC, AA BB CC AA, AA BB CC AA EE, BB CC, BB CC AA, BB CC AA EE, CC AA, CC AA EE, and AA EE;

Returns for Z2 are: FF, GG, CC, FF GG, FF GG CC, and GG CC;

Comparing Zl and Z2 yields CC as an association frequency for Z;

Z3 (position 10) has no returns in the range as defined. However, if we add to the parameters that there must be a least one return for each language A word or word string, the return for Z will be CC.

Comparing the returns for Z3 with Zl yields CC as an association frequency for word Z. However, this association is not counted because CC in word position 8 was already accounted in Z2's association above. When an overlapping range would cause the process to double count an occurrence, the system can reduce the association frequency to more accurately reflect for the number of true occurrences.

Step 16. Incrementing to the next word string yields the word string Z X, which occurs twice in document A. Applying the steps described above for Z X yields the following: Returns for Z XI are: BB, CC, AA, EE, FF, BB CC, BB CC AA, BB CC AA EE, BB CC AA EE FF, CC AA, CC AA EE, CC AA EE FF, AA EE, AA EE FF, and EE FF. Returns for Z X2 are: FF, GG, CC, FF GG, FF GG CC, and GG CC; Comparing the returns yields the association between word string Z X and CC.

Step 17. Incrementing, the next phrase is Z X W. This occurs only once, so the next word (X) in document A is examined.

Step 18. Word X has already been examined in the first position. However, the second position of word X, relative to the other document, has not been examined for possible returns for word X. Thus word X (in the second position) is now operated on as in the first occurrence of word X, going forward in the document:

Returns for X at position 4 yield: BB, CC, AA, EE, FF, BB CC, BB CC AA, BB CC AA EE, BB CC AA EE FF, CC AA, CC AA EE, CC AA EE FF, AA EE, AA EE FF, and EE FF. Returns for X at position 9 yield: CC.

Comparison of the results of position 9 to results for position 4 yields CC as a possible match for word X and it is given an association frequency.

Step 19. Incrementing to the next word string (since, looking forward in the document, no more occurrences of X occur for comparison to the second occurrence of X) yields the word string XW. However, this word string does not occur more than once in document A so the process rums to examine the next word (W). Word "W" only occurs once in document A, so incrementation occurs - not to the next word string, since word "W" only occurred once, but to the next word in document A - "V". Word "V" only occurs once in document A, so the next word (Y) is examined. Word "Y" does not occur in any other positions higher than position 7 in document A, so next word (Z) is examined. Word "Z" occurs again after position 8, at position 10.

Step 20. Applying the process described above for the second occurrence of word

Z yields the following: Returns for Z at position 8 yields: GG, CC, and GG CC; Returns for Z at position 10 yields: CC; Comparing results of position 10 to position 8 yields no associations for word Z.

Again, word CC is returned as a possible association; however, since CC represents the same word position reached by analyzing Z at position 8 and Z at position 10, the association is disregarded.

Step 21. Incrementing by one word yields the word string Z X; this word string does not occur in any more (forward) positions in document A, so the process begins anew at the next word in document A — "X". Word X does not occur in any more (forward) positions of document A, so the process begins anew. However, the end of document A has been reached and the analysis stops.

Step 22. The final association frequency is tabulated combining all the results from above and subtracting out duplications as explained. Obviously, there is insufficient data to return conclusive results for words and word- strings in document A. As more document pairs are examined containing words and word strings with those associations examined above, the association frequencies will become statistically more reliable such that words or word strings between Languages A and B will build strong associations for possible translations of words and word-strings.

Programl, set forth in the computer program listing appendix, is an example of a program for implementing an embodiment of the database creation method. Programl can be executed on a computer system of the type known in the art.

As demonstrated, this embodiment is representative of the technique used to create associations. The techniques of the present invention need not be limited to language translation. In a broad sense, the techniques will apply to any two expressions of the same idea that may be associated, for at its essence foreign language translation merely exists as a paired associations of the same idea represented by different words or word strings. Thus, the present invention may be applied to associating data, sound, music, video, or any wide ranging concept that exists as an idea, including ideas that can represent any sensory (sound, sight, smell, etc.) experiences. All that is required is that the present invention analyzes two embodiments (in language translation, the embodiments are documents; for music, the embodiments might be digital representations of a music score and sound frequencies denoting the same composition, and the like).

In another embodiment, certain rule-based algorithms, well known in the art, can be incoφorated into the cross-language association learning to treat certain classes of text that are, for pmposes of context and meaning, interchangeable (and sometimes can have potentially infinite derivations) such as names, numbers and dates. In addition, if available cross-language documents do not furnish statistically significant results for translation, users can examine the possible choices for translations and other associations and approve and rank appropriate choices.

As described, the association frequencies get stronger between words and word-strings as more documents in translated pairs are analyzed for association frequencies. As documents in more language pairs are examined, the method and apparatus of the present invention will begin filling in "deduced associations" between language pairs based on those languages having a common association with a third language, but not directly with one another. In addition, when translated documents exist in multiple languages, common association returns can be analyzed across several languages until only one common association exists between all, which is the translation. Progranώ, set forth in the computer program listing appendix is an example of a computer program that, when operated in conjunction with a computer system of the type known in the art, provides a method where data in these languages is utilized in an embodiment of the present invention.

Also, if expressions in existing states are artificially attributed specific associations with data points in another state and catalogued in a database, conversions between those two states will be possible. For example, if each "idea" represented in a form, state, or language is assigned an association to an electromagnetic wave (tone), it will create an "electromagnetic representation" of the idea. Once a given number of ideas have been encoded with corresponding electromagnetic representations, data (in the form of an idea) can be translated into electromagnetic waves and transferred at once over conventional telecommunications infrastructure. When the electromagnetic waves reach the destination machine, that machine will synthesize the waves into separate components and, given the associations (along with ordering instructions, use of the double overlap technique as described herein, and/or other possible methods), present the individual ideas that were represented by the electromagnetic representations.

Idea Conversion Method and Apparatus

Another aspect of the present invention is directed to providing a method and apparatus for creating a second document comprising data in a second state, form, or language, from a first document comprising data in a first state, form, or language, with the end result that the first and second documents represent substantially the same ideas or information, and wherein the method and apparatus includes using a cross-idea association database. All embodiments of the translation method utilize a double-overlap technique to obtain an accurate translation of ideas from one state to another. In contrast, prior art translation devices focus on individual word translation or utilize special rule-based codes to facilitate the translation from a first language into a second language. The present invention, using the overlap technique, enables words and word strings in a second language to be connected together organically and become accurate translations in their correct context in the exact manner those words and phrases would have been written in the second language.

In an embodiment of the present invention, the method for database creation and the overlap technique are combined to provide accurate language translation. The languages can be any type of conversion and are not necessarily limited to spoken/written languages. For example, the conversion can encompass computer languages, specific data codes such as ASCII, and the like. The database is dynamic; i.e., the database grows as content is input into the translation system, with successive iterations of the translation system using content entered at a previous time. The preferred embodiment of the invention utilizes a computing device such as a personal computer system of the type readily available in the prior art. However, the system does not need to use such a computing device and can readily be accomplished by other means, including manual creation of the database and translation methods.

The present invention may be utilized on a common computer system having at least a display means, an input method, and output method, and a processor. The display means can be any of those readily available in the prior art, such as cathode ray terminals, liquid crystal displays, flat panel displays, and the like. The processor means also can be any of those readily available and used in a computing environment such that the means is supplied to allow the computer to operate to perform the present invention. Finally, an input method is utilized to allow the input of the documents for the pmposes of building the cross-association database; as described above the specific input method for conversion to digital form can vary depending on the needs of the user.

Manual Database Creation and Translation through Double-Overlap Technique

An example of an embodiment of the method and apparatus for translating a document from a first language into a second language according to the present invention, where the cross language database is developed by querying the user for translations of words and word strings, as well as automatically generating segment translations using the double overlap technique, will now be described. For the pmposes of describing the preferred embodiment, an example will be used wherein data in the English language is translated to data in the Hebrew language. These selections are for descriptive pmposes only and are not meant to limit the selection of a first and second language.

According to a preferred embodiment of the present invention, the computer system operates to create a database of associations between translations from English to Hebrew. The translation method encompasses at least the following steps:

First, data in the English language is input into the computer system.

Second, all words of the English language input are first examined on a word by word basis. The database will return known word translations in Hebrew. If the translation is not included in the database, then the computer system will operate in a manner to query the user to input the appropriate translation. Thus, if the database does not know the Hebrew equivalent to an input English word, the computer will ask the user to provide the appropriate Hebrew equivalent. The user will then return the translation and input said translation into the database. Upon subsequent use, the computer system will operate the database in a manner such that the translation is known by virtue of its input by the user at an earlier point in time. Thus, in a second step the input data is examined in its parsed state — e.g., word for word — and the appropriate translations are either returned (by virtue of the operation of the database) or entered into the database.

Third, the input data is examined in a manner so as to increment the parsed segments. For example, if the data was first parsed on a word-by- word basis, the translation method of the present invention next examines the input data by evaluating two word-strings. Again, in a manner similar to that described above, the database returns translations for the two-word strings if known; if unknown the translation system operates to query the user to input the appropriate translation for all possible two word strings. All overlapping 2 word segments are then stored in the database. For example, if a word string is comprised of four words, then the database checks to see if it has the following combinations translated in memory: 1,2 2,3 and 3,4. If not, it queries the user. Note that only specifically encoded translations for the two word strings will be returned as accurate translations, even though the database will necessarily contain each word definition by virtue of the second step above.

Fourth, if the Hebrew translations of two overlapping two- word English language strings have an overlapping word (or words), the system operates in a manner to combine the overlapped segments. Redundant Hebrew segments in the overlap are eliminated to provide a coherent translation of the three- word English language string that is created by combining the two overlapping English language strings (and eliminating redundancies in the English language overlap). The above steps are reiterated out from 1 to an infinite number of steps (n) so as to provide the appropriate translation. The translation method works automatically by verifying consistent strings that bridge encoded word-blocks in both languages through the overlap. These automatic approvals for overlap-bridges that are consistent across both languages provide a language network that translates between two languages with perfect accuracy once the database reaches critical mass.

As an example, consider the English language phrase "I want to buy a car." Upon operation of a method of the present invention, this phrase will be input into a computer operating a database. The computer will operate to determine if the database includes Hebrew equivalents to the following words: "I", "want", "to", "buy", "a", and "car". If such equivalents are known, the computer will return the Hebrew equivalents. If such equivalents are not known, the computer will query the user to provide the appropriate Hebrew translations, and store such translations for future use. Next, the computer will parse the sentence into two word segments in an overlapping manner: "I want", "want to", "to buy", "buy a" and "a car". The computer will operate to return the Hebrew equivalents of these segments (i.e., the Hebrew equivalent of "I want" etc.); if such Hebrew equivalents are not known then the computer will query the user to provide the appropriate Hebrew translations, and store such translations for future use.

The present invention will next examine three-word segments "I want to", "want to buy", "to buy a", and "buy a car". At this point in the process the present invention attempts to combine each pair of Hebrew translations whose two-word English translations overlap and combine to make each three-word English translation query (e.g., "I want" and "want to" combine to form "I want to"). If the Hebrew segments have a common overlap that connects them as well, the translation method automatically approves the three- word English word string to Hebrew as a translation without any user intervention. If the Hebrew segments do not overlap and combine, the user is queried for an accurate translation. After the appropriate translation attempts for three word English strings, the process proceeds with four-word strings, and so on, attempting to automatically resolve, through the cross-language overlap, combinations of translations until the segment being examined is complete (in this case, the entire phrase "I want to buy a car"). The method of the present invention, after going through this parsing, then compares the returned translation equivalents, eliminates redundancies in the overlapped segments, and outputs the translated phrase to the user. Document Translation through Association Database and Double Overlap Technique

As another preferred embodiment, the present invention can translate a document in a first language into a document in a second language by using a cross-language database as described above to provide word-string translations of words and word-strings in the document, and then combine overlapping word-strings in the second language to provide the translation of the document, using the cross-language double-overlap technique described above. For example, consider a database with access to enough cross-language documents to resolve the components of the following sentence entered in English and intended to be translated into Hebrew: "In addition to my need to be loved by all the girls in town, I always wanted to be known as the best player to ever play on the New York state basketball team."

Through the process described above, the manipulation method might determine that the phrase "In addition to my need to be loved by all the girls" is the largest word-string from the source document beginning with the first word of the source document and existing in the database. It is associated in the database to the Hebrew word string "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot." The process will then determine the following translations using the method described above - i.e. the largest English word string from the text to be translated (and exists in the database) with one word (or alternatively more words) that overlap with the previously identified English word string, and the two Hebrew language translations for those overlapping English language word strings have overlapping segments as well: "loved by all the girls in town" translates to "ahuv al yeday kol habahurot buir"; "the girls in town, I always wanted to be known" translates to "Habahurot buir, tamid ratzity lihiot yahua"; "I always wanted to be known as the best player" translates to "tamid ratzity lihiot yahua bettor hasahkan hachi tov"; and "the best player to ever play on the New York state basketball team" translates to "hasahkan hachi tov sh hay paam sihek bekvutzat hakadursal shel medinat new york".

With these returns by the database, the manipulation will operate in a manner to compare overlapping word and word strings and eliminate redundancies. Thus, "hi addition to my need to be loved by all the girls" translates to "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot"; and "loved by all the girls in town" translates to "ahuv al yeday kol habahurot buir". Utilizing the technique of the present invention, the system will take the English segments "In addition to my need to be loved by all the girls" and "loved by all the girls in town" and will return the Hebrew segments "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot" an "ahuv al yeday kol habahurot buir" and determine the overlap.

In English, the phrases are: "In addition to my need to be loved by all the girls" and "loved by all the girls in town". Removing the overlap yields: "In addition to my need to be loved by all the girls in town".

In Hebrew, the phrases are: "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot" and "ahuv al yeday kol habahurot buir" Removing the overlap yields: "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir"

The present invention then operates on the next parsed segment to continue the process. In this example, the manipulation process works on the phrase "the girls in town, I always wanted to be known". The system resolves the English segment "In addition to my need to be loved by all the girls in town" and the new English word set "the girls in town, I always wanted to be known". The Hebrew corresponding word sets are "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir" and the Hebrew corresponding word set "habahurot buir, tamid ratzity lihiot yahua". Removing the overlap operates, in English, as follows: "In addition to my need to be loved by all the girls in town" and "the girls in town, I always wanted to be known" to "In addition to my need to be loved by all the girls in town, I always wanted to be known". In Hebrew, the overlap process operates as follows:

"benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir" and "habahurot buir, tamid ratzity lihiot yahua" yields "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir, tamid ratzity lihiot yahua".

The present invention continues this type of operation with the remaining words and word strings in the document to be translated. Thus, in an example of the preferred embodiment, the next English word strings are "In addition to my need to be loved by all the girls in town, I always wanted to be known" and "I always wanted to be known as the best player". Hebrew translations returned by the database for these phrases are: "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir, tamid ratzity lihiot yahua" and "tamid ratzity lihiot yahua bettor hasahkan hachi tov". Removing the English overlap yields: "In addition to my need to be loved by all the girls in town, I always wanted to be known as the best player". Removing the Hebrew overlap yields:

"benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir, tamid ratzity lihiot yahua bettor hasahkan hachi tov"

Continuing the process: the next word string is "In addition to my need to be loved by all the girls in town, I always wanted to be known as the best player" and "the best player to ever play on the New York State basketball team". The corresponding Hebrew phrases are "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir, tamid ratzity lihiot yahua bettor hasahkan hachi tov" and "hasahkan hachi tov sh hay paam sihek bekvutzat hakadursal shel medinat new york". Removing the English overlap yields: "In addition to my need to be loved By all the girls in town, I always wanted to be known as the best player to ever play on the New York state basketball team". Removing the Hebrew overlap yields: "benosaf ltzorech sheli lihiot ahuv al yeday kol habahurot buir, tamid ratzity lihiot yahua bettor hasahkan hachi tov sh hay paam sihek bekvutzat hakadursal shel medinat new york", which is the translation of the text desired to be translated.

Upon the completion of this process, the present invention operates to return the translated final text and output the text.

It should be noted that the returns were the ultimate result of the database returning overlapping associations in accordance with the process described above. The system, through the process, will ultimately not accept a return in the second language that does not have a naturally fitting connection with the contiguous second language segments through an overlap. Had any Hebrew language return not had an exact overlap with a contiguous Hebrew word-string association, it would have been rejected and replaced with a Hebrew word-string association that overlaps with the contiguous Hebrew word-strings.

Program3, set forth in the computer program listing appendix, is an example of a program for implementing an embodiment of the manual database creation and translation using the double-overlap technique. Program3 can be executed on a computer system of the type known in the art. The above embodiment combining the use of a cross-language association database and the cross-language double overlap translation technique has other potential applications to improve the quality of existing technologies that attempt to equate information from one state to another, such as voice recognition software, and OCR scanning devices that are known in the art. Both of these technologies can test the results of their systems against the translation methods of the present invention. When a translation does not exist and therefore a mistake is presumed, the user can be alerted and queried or the system can be programmed to look for close alternatives in the database to the un-overlapped translation that will produce an overlapped translation. All returns to the user, of course, would be converted back into the original language. Creation of Association Database Method and Apparatus

Another embodiment of the present invention provides a method and apparatus for creating an association database within a single language and a method and system for using the association database to provide answers to queries or questions posed by users. In this embodiment, the association database can organize and store information that permits the determination and analysis of associations between words or word strings. An association program can embody some of the methods of the present invention and can be used to build the databases of the present invention and to analyze the information stored in the databases to determine associations between words or word strings. Figure 3 depicts memory 208 of the computer system 200 in which are stored a smart application 302, an association program 304, databases 306 and an operating system 308, for access by processor 202. The association program 304 can be an independent program or can form an integral part of a smart application 302. The association program 304 can analyze the databases 306 to determine word associations either in response to a query from a smart application 302, or in response to a query directly submitted by the user via the input device.

The system and method operates by parsing text of a document input into the system and creating a frequency association database in which segments of the parsed text are ^"associated with one another, based on, for example, the frequency of occurrence and position of a particular fragment with respect to other fragments of the document. Segments of parsed text can include words and word strings. Documents used in the present invention can be stored in a Document Database to facilitate access, parsing, and analysis of the documents.

Words and word strings that frequently appear in close proximity to each other within a document can be used in artificial intelligence or smart applications which allow a user to ask the system to answer a question or perform an action. The pmpose for using the association databases of the present invention for smart applications is to determine common third word or word string associations between or among two or more words or word strings selected by a smart application. The user can define ranges in the document database as any number of words and/or word strings in proximity to each occurrence of each selected word and/or word string. The system then searches for words and/or word strings that are common to the ranges are common third words or word strings. The frequency of occurrence of common third words or word strings within the ranges of each selected word or word string can be stored in a frequency association database, shown in tables 3 and 4. Alternatively, the locations and frequency of occurrence of words and word strings recurring in the document database can be stored in a recurring word and word string database, also referred to herein as a Recurrence Database, an example of which is shown in table 5. Using these databases, the association program 304 can establish the highest ranked third word and word string relationships shared by the two or more words or word strings selected by the smart application 302, based on user-defined weighting or other criteria.

Association Database Building Within User-Defined Range

Disclosed is a method for building one type of association database herein refeπed to as a frequency association database that can be applied to documents in a single language for puφoses of building a database of related words and word strings based on their proximity to one anotiier in the text. An example of the frequency association database is shown in table 3. The method includes: a. Assembling a coφus of text in a single language in a "Document Database", the larger the coφus the better. b. Searching every word or word string for multiple occurrences of that word or string in the Document Database. c. Establishing a user-defined number of words or word strings on either side of the word or word string to be analyzed. This will serve as the Range. In addition to being defined as a certain number of words, the Range may be defined as broadly (all words in the specific text in which the word or word string occurs) or as narrowly (a specific sized word string in an exact proximity to the analyzed word or word string) as the user may define for the specific application. d. Determining the frequency with which each and every word and word string appears in the ranges around the selected word or word string being analyzed and, if desired, their proximity to the selected word or word string.

An example of the association building among a large number of documents in a single language follows. Sentence 1 and Sentence 2, shown in Table 2, are two among many sentences in the Document Database, as the entire coφus can be analyzed in its entirety with all of the results added to the frequency chart:

Table 2

Sentence 1 "I went to the doctor and I was sneezing a lot and he told me that the cold and the flu are going around like crazy and I should rest, keep taking Vitamin C, and a little chicken soup wouldn't hurt."

Sentence 2 "As a doctor, I'm constantly seeing sneezing, red eyed patients asking what they can do to treat the flu, to which I reply, "the only things that really work are rest and time"

The system will look for recurring words or word-strings. The only recurring words and word strings between the two sentences are:

T", "to", "the", "doctor", "and", "sneezing", "a", "that", "flu", "are", "resf

As described in U.S. Application No. 10/024,473, for certain applications the system can be instructed to recognize and disregard common words such as "F, "a" "to" etc. However, those common words will be considered and included in a database at times depending upon the goal of the specific application for the system. If the common words are disregarded, this would leave:

"Doctor", "sneezing", "flu", and "rest"

If the range is defined as including, for example, up to 30 words on either side, the system will record the frequency of occurrence of every word and word string within 30 words of each of these words. In addition, the system can also note the proximity of each word or word-string to the word or word string being analyzed. Since each of these words appears within the 30 word range of each of the other words in both sentences, each word would have a frequency of one for each of the others as follows in Table 3, which shows an embodiment of a Frequency Association Database:

Table 3

<img file="EP1556784A1_D0003.tif" /><img file="EP1556784A1_D0004.tif" />

In addition to taking note of the frequency with which words and word strings appear anywhere within ranges of the words and word strings being analyzed, the association database can be built based on frequencies of word and word strings appearing exactly X words away from the word or word string being analyzed. In such cases the range would be defined narrowly by the user for an application as one word or one word string of a specific size in an exact proximity to the word or word string being analyzed.

For instance, the system can analyze the documents available in the Document Database to determine that they include the phrase "go to the game" 10,000 times and it may find "go to the game" within a 20 word range of the word "Jets" 87 times. In addition, the system may determine that "go to the game" appeared exactly 7 words in front of the word "Jets" 8 times (counting from the first word "go" of the word string). Any combination of recurring patterns of words and word strings based on the number of words between them can also be recorded. For instance, the database can record the number of sentences in the database in which the word "Jets" appears 3 words before "go to the game" when "tickets" appears 9 words after "go to the game." That pattern may occur 3 times and the frequency of that word pattern in the text may be used by an application that will deduce the meaning of an idea to either help provide an answer to a question asked by the user, or help carry out a request made by the user. Based on Sentence 1 and Sentence 2 of Table 2, the frequency association database, shown in table 4, can be generated.

Table 4

<img file="EP1556784A1_D0005.tif" /><img file="EP1556784A1_D0006.tif" />

As indicated in table 4, of the recurring words within the range of Sentence 1 and Sentence 2, only one word, "sneezing," appears twice exactly four words after one of the words being examined. These tables indicating exact recurring word patterns in text based on their, proximity to each other measured by the number of words between them can be generated individually using a series of narrowly defined ranges. Typically, however, the most frequently useful word and word string patterns are those contiguous or in close proximity to the left and right to those words that are examined.

A large number of calculations may be required, if the above method is used to build a database of all of the proximity and frequency relationships between all recurring word patterns in the available text as described above. Many relationships being built as a result of this comprehensive process may never be used for an application. The following technique involves indexing recurring word strings, to avoid upfront processing that may never be used.

In addition, the following indexing process can be used as an alternate process to the method described above for automatically determining frequency and proximity associations, and to perform general range frequency analysis and an analysis of exact patterns based on specific word or word string locations within a range as described above. This embodiment of the invention is a method for building a recurring word and word string database (or Recurrence Database), which includes the location of each recurring word and word string in the document database is as follows: first, search for all words and word strings for recurrences in the available text; second, record in the database the "locations" for each word and word string with multiple occurrence by noting its position in each document in which it occurs, for example, by identifying the word number of the first word in the string, and the document number in the document database. Alternatively, just the document number of the document in the document database in which the word or word string is located can be stored. In this case, the position of the word or word string can be determined when responding to a query. Table 5 is an example of entries in the Recurrence Database.

Table 5

<img file="EP1556784A1_D0007.tif" /> As indicated, each occurrence of a word or word string found more than once in the Document Database will be added to the frequency count and its location noted by designating the word number position in a document as well as the number assigned to identify the document in which it occurs, or by using any other identifier of the word or word string's location in the document database.

If the Recurrence Database is fully and completely generated (including word number positions as well as document numbers) for all documents in the Document Database, the location information allows the system to calculate any general frequency relationships generated, or any specific word pattern frequency relationships generated as described above. Additionally, if the Recurrence Database has not yet been built, the system can perform the frequency analysis on two or more ranges on the fly. Any word or word string recurrence not yet in the Recurrence Database can be included while the system responds to a query by analyzing documents in the document database directly to supplement analysis of the Recurrence Database. After the information obtained by direct analysis of the documents in the Document Database has been used for the specific task for which it was generated, the information can then be stored in the Recuπence Database for any future use. Whether the system builds a frequency analysis using the Recuπence Database, or whether those relationships are created on the fly, the result is a database of word and word string associations to which smart applications can be applied.

Referring now to Figure 3, in a common frequency analysis process, smart application 302 can query the frequency association database of the Recuπence Database, via the association program 304, with two or more words or word strings to establish what other third words or word strings are frequently associated with some or all of the presented word strings. The system can employ two different methods when performing the Common Frequency Analysis (CFA): either 1) Independent Common Frequency Analysis, or 2) Related Common Frequency Analysis. Additionally, the system can do further statistical analysis after employing either of the two processes by extending them an additional generation or generations, or by combining the results and/or segments of any CFA for further CFAs. Independent Common Frequency Analysis (ICFA)

When the smart application 302 presents the association program 304 with two or more words and/or word strings for CFA, the system can identify all words and word strings frequently related to the presented words using an association database of the present invention. The system can then identify those words and/or word strings that are frequently associated to some or all of the presented words and word strings.

The system can then use the common associations among the presented words and/or word strings in a variety of user-defined ways. For example, the system can identify the highest- ranking common association by adding (or multiplying or any other user defined weighting) the frequencies for a common, or third word or word string association of the presented words and/or word strings in a frequency association database. As another example of a user defined parameter, a minimum frequency (as measured by total rank, raw number or any other measure) on all tables of presented words and or word strings may be required.

In using entries in the Recuπence Database example, the system can determine the frequency with which "ice cream" and "kids love" are within a user-defined range in all available documents as one analysis and the system can then record the frequency with which "ice cream" and "before going to bed" appear together. The frequency of each of the independent relationships can then be used by an application that will give relative value to each. This will be based on how high (user defined as either absolutely or relatively) the frequency of ice cream ranks on both a "kids love" frequency table and a "before going to bed" frequency table, or the percentage of time the association (e.g. "ice cream") appears with the word or word string (e.g., "kids love") relative to the total number of times the word string (e.g., "kids love") appears. Once again, the "kids love" and "before going to bed" frequency tables are tabulated rankings of the occurrence of third words or word strings within defined ranges based on their proximity to the selected word strings "kids love" and "before going to bed."

Based on user-defined values, this method, after analyzing "ice cream" can then analyze "a warm hug" by locating it on the "kids love" frequency table (based on the user defined range or proximity requirements of the application) for relative frequency and then locate "a warm hug" on the "before going to bed" frequency table. All other frequent associations (which may be user defined) on both frequency tables will be compared, for example "staying up late", and scored based on user-defined values of combined relative frequencies from both tables. The highest-ranking word string, based on user defined weighting of each frequency association, will be produced by the system. The result of this analysis may be that the system will identify that, while "kids love" "ice cream" more than "warm hugs," "kids love warm hugs" more than "kids love ice cream" "before going to bed."

As another example if the system was presented with the word "kangaroos" and the word and word strings "where can I find" and "in America", for Independent Common Frequency Analysis table 6 shows a frequency table that may be assembled based on the documents in the Document Database.

Table 6

<img file="EP1556784A1_D0008.tif" />

"Australia" ranks highest based on a total of the raw cumulative associations. However, user- defined parameters may weigh the relative frequencies. An example of one possible method may be to score the least found association as a one and then score the higher associated frequencies as a multiple of that number. In this case "the Zoo" will rank highest, as shown, for example, in Table 7.

Table 7

<img file="EP1556784A1_D0009.tif" /><img file="EP1556784A1_D0010.tif" />

The relative weights among the associations show how "the Zoo" will be the outcome based on the above user-defined parameter. Similar results can be achieved by multiplying the number of times a specific word or word string is associated to each of the queries to give weight to the relative balance between common associations. In the example shown in Table 6 the results will return "the Zoo":

1. "the Zoo" 7,000 x 2,000 x 5,000 = 70,000,000,000

2. "Australia" 21,000 x 1,000 x 300 = 6,300,000,000

3. "New Zealand" 1,000 x 500 x 100 = 50,000,000

Other user-defined criteria can be employed to rank and choose associations common among two or more presented words and/or word strings. This may include weighing certain associations in certain categories more than others. For example, an application may assign a higher value to a "location" association (e.g., "in America") for a "where?" question (e.g., "where can you find kangaroos in America?").

Related Common Frequency Analysis (RCFA)

In addition to finding common independent associations among two or more presented words and/or word strings, another embodiment may look to identify frequent appearances of words and or word strings that are found in user-defined ranges in only those documents containing two or more of the words or word strings being analyzed. A Related Common Frequency Analysis is different than an Independent Common Frequency Analysis in that related words appear together as opposed to appearing independently for analysis. The embodiment of a RCFA according to the present invention employs the following steps:

First, locate all document numbers from the database common to two or more of the presented words and/or word strings, i.e. locate all documents (by, for example, designating and returning specific document numbers) from a database that contains both of the presented words and/or word strings. The document numbers are those numbers designated by an indexing scheme known in the art or described in the present application.

Then, identify and compare each word and word string in a user-defined range in proximity to the presented words and/or word strings, and record the frequency for any word and word strings in the ranges. Once again, the user-defined range can be naπow and include only recurring word or word strings in a specific proximity to the presented words or word strings.

As an example, assume the system is presented with the two word strings "kids love" and "before going to bed" for analysis under RCFA. Further assume that the database contains the following entries within a user-defined range to the presented phrases in the documents in the Document Database:

"kids love a warm hug" 20 times

"kids love ice cream" 873 times

"kids love a warm hug before going to bed" 12 times

"kids love ice cream before going to bed" 10 times

"kids love staying up late before going to bed" 17 times

"before going to bed" 684 times Because in a RCFA two words and/or word strings are presented for analysis, a Recurrence Database can direct the system to the documents in the document database that have both "kids love" and "before going to bed" as they will have the same document number associated to them. In addition, if desired the system can locate only those documents where the word strings are within the user-defined number of words of each other or in any other user defined qualifying proximity to one another.

Once the system has identified all documents in the document database that contain "kids love" within a designated proximity to "before going to bed" the system can build a frequency chart of all recurring words and word strings within a user-defined range from the two presented word strings. In the above example, only those words and word strings which occur with both the presented phrases (with a user-designated delineation of how many words are allowed to be in between the two presented phrases) are analyzed (thus the existing word string "kids love a warm hug," "kids love ice cream," and "before going to bed" (by itself) are not analyzed). However, from the example, and, based on the limited sample of the word and word-string database, "ice cream" occurs at least ten times between the two presented phrases and thus has at least a frequency of 10, "staying up late" occurs at least seventeen times between the two presented phrases and thus has at least a 17 frequency, and "a warm hug" occurs at least twelve times between the two presented phrases and thus has at least a 12 frequency, depending on the user-defined range of word strings. These frequencies may be much higher as they can occur in the same text near "kids love" and "before going to bed" but not just directly adjacent to them (e.g., "kids love ice cream and other sweets before going to bed" or "before going to bed, kids love ice cream").

The response to the query "what do kids love before going to bed?" has many potential "correct" answers. Nevertheless, with a critical mass of documents reflecting various representative opinions, the various higher frequencies will reflect the consensus view on the question, and the lower frequencies will reflect existing alternative views. For instance "hot shower" may be within the range with "kids love" and "before going to bed" three times, which indicates a pattern of preference that is not nearly as popular an opinion as some others. Alternatively, user defined parameters may be established to require a minimum total frequency to qualify as an acceptable return.

For either the ICFA or the RCFA, a thesaurus or any other known or determined word- string equivalents can be used in place of the searched words and word strings to find recurring words and word strings around those word equivalent's ranges as alternative embodiments of the invention. For instance, the system can also search "kids like", "kids really love", "kids enjoy", "children enjoy", "children love", in place of "kids love". The same technique can be used to replace "before going to bed" with known equivalents to the system like "before bed", "before going to sleep", "before bedtime". Thus, a combination of a word thesaurus known in the art and/or the common frequency techniques of the present invention will yield a large number of semantically equivalent word and word strings that can be used to expand the analysis with many more relevant semantic search terms.

Second Level Frequency Analysis In another embodiment, the system may perform frequency analysis using the common association between either the first or second word or word string that make up a query, and the selected third word or word string from a common frequency analysis, which will add new information to the analysis performed for an application. For example, if the selected common association between the frequency of all words and word strings within the common range of "before going to bed" (first) and "kids love" (second) is "ice cream" (third), this embodiment generates either an independent or relative frequency analysis between either "before going to bed" (first) and "ice cream" (third), or "kids love" (second) and "ice cream" (third), and selecting associations based on those two frequency analysis. For example, "ice cream" and "before going to bed" may have a high common frequency association with "stomach ache" which may be useful in the analysis for an application to be used according to the present invention. Moreover, any two or more word or word strings can be analyzed using the same techniques in as many combinations of as many generations as the user defines. Specific applications will call for automated analysis identifying which common frequency analysis to perform on each generation of association frequency analysis. More complex applications will identify two or more frequency analysis be performed before the two or more independent results are used in combination.

Use of common frequency analysis to determine word function or meaning As described in U.S. Application No. 10/024,473, the high-frequency associations built between the word and word strings being analyzed and the word and word strings within their ranges that are not translations but are closely related ideas can be used for artificial intelligence applications. An artificial intelligence or smart application is an application that can answer a question or perform a task it has not necessarily been asked to answer or perform in the past. The present invention can utilize the association databases to identify formations and/or patterns of words and word strings that can be used as category indicators to identify the function or puφose of other words or word strings associated with the category indicators. For example a particular pattern of words may normally be associated with a word that is a person's name, a type of food, or an action. Using CFA, the present invention can analyze documents to reveal the existence of these patterns and their association with other words or word strings. Based on this association, the system can categorize other words that are similarly associated with these patterns, because other words that are similarly associated are likely to fall within similar categories. Thus, the system can identify the presence of and can make use of category indicators. Moreover, words and/or word strings that share highly associated patterns of words and word strings are often semantic equivilants or near semantic equivilants of one another. One example of such an application would be to aid the present invention translation method in completing translations that the system cannot otherwise resolve using the previously described processes. For example, assume the system received the English language query, "I love Moshe", to be translated into Language X. Assume the system has the translation of the word string "I love", but does not have the translations for "I love Moshe" or "love Moshe". The association database has the word "Moshe" in word strings, like "my name is Moshe," "Mr. Moshe Fein," "his name is Moshe." CFA can be used to identify the relationship between these word strings and the name Moshe. A user can then identify these phrases to the system as highly coπelative to names and are therefore name indicators, a particular type of category indicator. Once Moshe appears in a user defined number (or percentage) of the "name indicator" phrases, the system will determine with statistical certainty that "Moshe" is a potential name because it occurs in text that are "name indicators."

While other systems known in the art also incoφorate these name indicatόfs, and other category indicators for, for example dates, numbers and other specific classes, the present invention can use the manually encoded indicators like phrases indicating names to identify all the other phrases that names like Moshe and other known names also appear in. For example, the user may not have thought to add as a name indicator "the guy's name is" but the present invention will present it and many others a user would not have included using this embodiment. Each word and word string has a limited universe of possible alternative word or word strings that can be found among the surrounding words and word strings. This universe will include words and word strings expressing precisely the ideas they are replacing and will range away from the idea originally expressed to thoughts that are exact opposites. For example, if the phrase "I love chocolate" is examined, the system can generate all possible substitutions for the word "love." The system will generate equivalents and near equivalents like "I really love chocolate", "I adore chocolate", "I really enjoy chocolate", as well as non-equivalents and opposites like "I tolerate chocolate" and "I hate chocolate". The system will not find recurring frequencies of words that do not fill the whole left by the word love using the independent (or alternatively an embodiment of related) common association frequency analysis. For instance the databases in the analysis will not produce "I fish chocolate", "I you chocolate" "I who chocolate". Once the system establishes that Moshe is a name and if "I love" is a name indicator (but not one in which we have ever seen Moshe) then, if the Translation Engine has the translation for "Moshe" in Language B, it can attach it to the "I love" translation in Language B without an overlap. If the translation for "Moshe" in Language B is not known, a transliteration function from English to Language B can be used to generate the Language B representation of the name "Moshe" and attached it to the Language B translation for "I love", without an overlap.

Names that are clearly related to other words and/or word strings as names is a simple example of how a user identifying common statistical relationships between word strings representing ideas can be categorized by a general meaning to be leveraged for a smart application. Moreover all word strings will have their dynamic relationships to all other related concepts and ideas, illustrated by the in-language association databases that list related ideas based on their frequency of close proximity to one another when they are expressed in language. Each word string making up a coherent idea will have its universe of related ideas in frequently recurring patterns in text within certain proximity to one another for the system to extract probabilities of meaning for those ideas in any given context.

If, for example, a translation query involves a word that is not clearly a name, the frequency among related ideas can be examined on the next level of neighboring words and word strings to provide further context. For example, if the query in English to be translated into Language B is "I love Faith", this is somewhat ambiguous, because Faith can either be either a name or "a feeling of belief without proof.

If the other neighboring words near the phrase "I love Faith" in the complete translation query are "her" and "she" but are not "god", "religion", "church", etc., the system will apply formulas that weigh frequency, proximity as well as other category indicators to the associations existing in its database and "know" to chose the translation of the "name" Faith, not the "belief without proof Faith. Other neighboring words and word strings with their set of frequent relationships to other ideas will yield further evidence of the speakers intention until statistical significance fixes the answer, or the system queries the user for clarification based on a lack of information. This would happen, for example, if the entire query was "I love Faith." Since it is somewhat ambiguous, even a human translator might ask, "do you mean the word Faith to refer to a person?"

In the case of English, since most upper-case first letters will indicate that the "name" Faith is intended. This is another attribute the system can work with to determine that Faith is probably a name. Many non-Latin character based languages do not have upper- case/lower-case characters and therefore this sort of issue will rely on the pure level-upon-level relationship between word strings related by frequent proximity to one another in text, and any other representation of language (voice, symbols, signs, etc).

Use of common frequency analysis to locate semantically similar words

Words and word strings in a language that represent a particular idea often occur in patterns. These patterns can be represented by the frequency with which specific words and word strings are found immediately prior to a particular word (in English, to the left of the particular word) as well as following the particular word (in English, to the right of the particular word). Thus, words and word strings representing ideas that are alike will have commonality in the type and order of the words and word strings leading into and away from them. Another example of using the word patterns to generate information is in the creation of a comprehensive word and word string equivalent thesaurus. If the system is asked to identify words and/or word strings that have the same or almost the same meaning as another word or word string, i.e. the words and word strings are semantically similar, the system can find the word and word string frequencies associated with that word or word string and look for the words and word strings in that language whose associations frequencies most closely match it. Typically the more similar the formations between two words and/or word strings are, the more similar in meaning they are. Sometimes, opposites will share high frequency common associations, but will diverge strongly on certain important qualitative associations that create an "opposites signature" pattern that the system can provide for applications as well.

The character of the association between any idea represented by a word or word string and any other idea represented by a word or word string, the "association signature," will be determined by the system. The system uses the association databases to detect specific word formations within user defined ranges tailored to detect word patterns suπounding an idea that defines the relationship between the idea and other ideas in a relational proximity to it. Program4, set forth in the computer program listing appendix, is an example of a program that uses common frequency analysis to locate semantically equivalent or similar words. A general explanation of how, using the association databases and a smart application 302, the system detects semantically equivalent word strings through common frequency analysis will be described. The system can also run the ICFA and the RCFA on the presented words and word strings and combine the results using a user defined weighting process. One embodiment using a specific word formation around a word or word string using ICFA is to identify words and/or word strings that are equivalents or near equivalents in semantic value (i.e., meaning) to any word or word string. This embodiment involves: Step 1, receiving a query requesting a word or word string (the query phrase) to be analyzed for equivalents, and returning a user defined, number of words and/or word strings (the returned phrases) of a user defined minimum and/or maximum size that occur with the highest frequency, as well as the occurrence frequency of each returned phrase, where the returned phrase is located directly to the left of the query phrase in all available documents. The larger the recurring user defined word string, the more precise the ultimate results will be. Step 2, produce a frequency analysis on each of a user defined number of the top ranked results from Step 1 using a range of one word or word string to the right of each word or word string analyzed (the range of one word or word string means the system will rank the highest recurring words and word strings to the right of each of the word or word strings analyzed in Step 2. The frequencies of all common word and word strings produced in Step 2 are then added. Step 3, produce a frequency analysis on the query using a range of a user defined number of words directly to the right side of the query (again at least two or more words is typically desirable for accuracy). Step 4, produce a frequency analysis on each of a user defined number of the top ranked words and word strings returned from Step 3 using a range of one word or word string directly to the left of each of the words and word strings being analyzed (again, the results of the one word or word string range directly to the left of the word or word string being analyzed will rank by frequency the words and word strings most often leading into each word and word string analyzed in step 4). The frequencies of all common word and word string results in Step 4 are then added. Step 5, conduct an ICFA by identifying each word or word string that is produced by both Steps 2 and 4. The frequency number of each of the returned common words and word strings in Step 2 are multiplied by the frequency numbers of the common word or word string produced from Step 4. The highest ranked word or word strings based on the products of their frequencies from Step 2 and Step 4 results will typically be the most semantically equivalent or similar words and word strings to the query.

The following example illustrates the above embodiment using a hypothetical database to create associations of all word and word string equivalents in the system's document database, and then creates associations having semantic equivalents, using ICFA. Assume the word "detained" is entered by the user to determine all of the word and word string equivalents known to the system for that word.

In Step 1, taking only the top three results to simplify the illustration (although the number of results analyzed by the present invention may be user defined), the system first determines the most frequent three-word strings directly to the left of "detained". The length of the word strings directly to the left of the analyzed word ("detained") is user-defined, in this example three- word word strings. The results of this analysis - the list of word strings of a user- defined length to the left of the presented word - is called the "Left Signature List." Assume that the system in the above example returns the following: 1. "the suspect was" 2. "was arrested and"

3. "continued to be" In Step 2, the system operates on the returned Left Signature List. The system locates words and or word strings that most frequently follow the above three returned three- word strings - i.e., those words and/or word stings to the right of the returned three-word strings. The length of the word strings that the system returns in this operation is user defined. The results of this analysis - each list of words and/or word strings to the right of each Left Signature List entry - is called a "Left Anchor List." Assume that the system in the above example returns the following Left Anchor Lists:

1. "the suspect was" a. "arrested" (240 freq.) b. "held" (120) c. "released" (90)

2. "was aπested and" a. "held" (250) b. "convicted" (150) c. "released" (100)

3. "continued to be" a. "healthy" (200) b. "confident" (150) c. "optimistic" (120)

Also in step 2, the frequencies of common returns in each of the Left Anchor Lists are added. The only common returns in the Left Anchor Lists are: a. "held" 120 + 250 = 370 b. "released" 90 + 100 = 190 In Step 3, the system determines the three most frequently occurring two word strings directly to the right of the selected query "detained" in the documents in the database. Again, the number of frequently occurring word strings analyzed is user defined (here, as in Step 1, the system returns the top three occurring word strings. And, the length of the word strings directly to the right of the analyzed word ("detained") is user-defined, in this example two-word word strings (because any length word string may be used in Step 1 and Step 3). The results of this analysis - the list of word strings of a user-defined length to the right of the presented word - is called the "Right Signature List." Assume that the system in the above example returns the following:

1. "for questioning"

2. "on charges"

3. "during the"

In Step 4, the system operates on the returned Right Signature List. The system locates words and or word strings that most frequently occur before the above three returned two-word strings - i.e., those words and/or word stings to the left of the returned two-word strings. The length of the word strings that the system returns in this operation can be user defined. The results of this analysis - each list of words and/or word strings to the left of each Right Signature List entry - is called a "Right Anchor List." Assume that the system in the above example returns the following Right Anchor Lists:

1. "for questioning" a. "held" (300) b. "wanted" (150) c. "brought in" (100) 2. "on charges" a. "held" (350) b. "arrested" (200) c. "brought in" (150)

3. "during the" a. "beautiful" (500) b. "happy" (400) c. "people" (250) Similar to step 2, the frequencies of common returns in the Right Anchor Lists are added. The only common returns in the Right Anchor Lists are: a. "held" 300 + 350 = 650 b. "brought in" 100 + 150 = 250

In Step 5, an ICFA is conducted and the system returns a ranking. In the present example, a weighted frequency is produced by multiplying the frequencies of the common returns of steps 2 and 4 (i.e., returns on both a Left Anchor Lists and a Right Anchor Lists) as follows: l. "held" 650 x 270 = 175,500

2. "arrested" 200 x 240 = 48,000

An alternative embodiment for ranking gives no consideration to the specific weighted frequency. Instead, all results produced on at least one Left Anchor List and on at least one Right Anchor List are ranked according to the total number of Anchor lists the on which the result appears. In the above example, the rankings using this embodiment would be:

Rank Semantic Equivalent # of Anchor Lists 1. "held" 4

2. "aπested" 2

Although both "released" and "brought in" were each produced twice in the analysis, neither was produced on both Left Anchor Lists and Right Anchor Lists ("released" was produced twice on Left Anchor Lists and "brought in" was produced twice on Right Anchor Lists). Other weighting schemes combining the number of Anchor lists and total frequency may be utilized.

The above illustration is based on a relatively small number of documents in the document database. The document database can be larger and can include documents remotely accessible to the system via networks such as the Internet. In one embodiment of the invention, the user not only defines the number of results to be included on a Signature List, but also can stop the analysis when the designated numbers of results have all been found with a user defined minimum frequency. This acts as a cut-off and will save processing power when using a large database. Other examples of user defined parameters for ICFA for producing semantic equivalent word and word strings to a query word or word string can consider frequently recurring word and word strings to the left and right sides of the query in various lengths. Thus, instead of having a fixed user-defined length to the word strings returned in the Left and Right Signature Lists, an embodiment might have a variable user-defined length to the word strings returned in these Signature Lists, with a minimum and maximum length to the word strings. More frequently occurring word strings of different sizes used in the analysis on both the left and right side of the query provides more context to identify more precisely semantic equivalents. In addition, this embodiment may include a minimum number of occuπences of a Signiture List return for the returned word or word strings to qualify for the Signiture List, for further precision.

In this variable word string analysis in an embodiment of the present invention, the query from the previous example ("detained,") can be analyzed as follows:

In Step 1, from an available database generate a Left Signature List of a user-defined number of the most frequent word strings to the left of the query, of a user defined minimum and maximum length. This is the same process in Step 1 of the previous example except here word strings of various lengths are used rather than fixed length word strings . If the user-defined parameters are (1) return the six most frequent word strings, (2) with the word strings having a minimum length of two words, and a maximum length of four words, and (3) with a minimum occuπence of at least 500 occuπences, the results in the previous example might look (again, using a hypothetical example) as follows:

Word String Frequency

1. "people were" 1,000

2. "arrested and" 950

3. "were reportedly" 800

4. "passengers were" 775

5. "was being" 700

6. "the suspect was" 650

7. "was arrested and" 575

8. "after the journalists were" 500 In Step 2, generate the Left Anchor Lists from the results on the Left Signature List as in the previous example.

In Step 3, generate a Right Signature List using the same defined parameters described in Step 1 of this example, with the following results: Word String Frequency

1. "for questioning" 1,750

2. "on charges" 1,520

3. "during the" 1,350

4. "because of 1,000 5. "due to" 750

6. "in connection" 600

7. "without charge or" 575

8. "for questioning after" 500

In Step 4, generate the Right Anchor Lists from the results on the Right Signature List as in the previous example.

In Step 5, rank all results produced on at least one Left Anchor List and on at least one Right Anchor List according to the total number of lists on which the result appears. Alternatively, rankings can be determined by multiplying the total number of Left Anchor Lists a result appears on by the total number of Right Anchor Lists it appears on. In addition, total _. frequency can be added to weighting the rankings.

It should be noted that while the above example query was a word ("detained") the system can produce semantic equivalents for word strings of any size where the word string represents a semantically identifiable idea. For instance, if the system were queried with "car race" it would produce potential semantic equivalents for "car race." Performing the same steps described in the embodiments above, which utilize an ICFA to determine semantic equivalents, the system might produce "stock car race" "auto race" "drag race" "NASCAR race" "Indianapolis 500", "race", among others semantic equivalents. The system accepts queries and produces semantic equivalents using exactly the same process, without regard to the size of the word string of the query or the result.

Another embodiment of creating semantic equivalent associations is based on use of the Related Common Frequency Analysis (RCFA) rather than the Independent Common Frequency Analysis (ICFA) examples shown above. This RCFA semantic equivalent analysis involves the following steps:

Step 1 : Receive a word or word string query to find the RCFA semantic equivalent word and word strings, and search a document database to identify portions of documents containing that word or word string. In an example, the word "initial public offering" is entered as a query to identify its RCFA semantic equivalents. The system then searches a document database, identifies portions of documents with the "initial public offering" word string, and retums those portions of documents to the user. The user may define and limit the number of portions returned.

Step 2: For each occurrence of the query word string found in Step 1, analyze the returned portions by recording the frequency of occuπence of (i) the word and/or word string(s) of user defined size to the left of the query, in combination with (ii) the word and/or word string(s) of a user defined size to the right of the query. This step creates a related left and right signature that "cradles" the query; the result creates a "Left/Right Signature Cradle."

In our example, the user defined left word string can be set at two, and the user defined right word string can be set at two. With a user-defined limit of cradles to be returned returned (for example, one-hundred) occurring a user-defined minimum number of times (for example, five), the calculations may be efficiently analyzed. This process could result in the following hypothetical returns for the query "initial public offering:" 1. "for an ofits"

2. "at an price of

3. "announced the ofits"

4. "at the ofits"

5. "as the ofits"

6. "announced its of the"

7. "the proposed for its"

8. "announced an of stock"

9. "completed its ofits"

10. "for the ofits"

Step 3: Search the document database for the most frequent words and word strings (up to a user defined maximum size) that appear between the left and right word strings of each Left/Right Signature Cradle produced in Step 2. Identifying other frequently occurring words and/or word strings that appear in between the word strings of the Left/Right Signature Cradle produces potential semantic equivalents. A user defined minimum number or percentage of Left/Right Signature Cradle can optionally be required to qualify.

Step 4: The resulting words and/or word strings that appear in between the word strings of the Left/Right Signature Cradle can be ranked based on total frequency, numbef of Left/Right Signature Cradle's "filled," or some other method or combination of methods.

In the example, top results in step 3 might be the words and or word strings IPO, ipo (the results may be case sensitive), Initial Offering, offering, Public Offering, and stock offering, all of which "fit" in the unresolved portion of some of the Left/Right Signature Cradles.

The use of ICFA and RCFA to determine semantic equivalents will include some results that fit the Left/Right Signature Cradle but are not semantic equivalents. For example, many words or word strings that have an opposite meaning to the query word or word strings will fit many of the same Left/Right Signature Cradle as the query, as will other related but non- semantically equivalent words and word strings. If an application requires that only semantic equivalents be included on the list for a query, filtering techniques known in the art can be used through the operation of a separate common frequency semantic equivalent analysis for each result on the list produced by the query. Filtering techniques, such as those including only results from the query list that also appear within a user-defined threshold ranking on a user- defined number of semantic equivalent lists, can be used to determine what will remain on the original query list. All other results will by filtered for applications that only call for semantic equivalents.

The above embodiments for semantic equivalent generation are one of many ways the present invention can use ICFA (or alternatively RCFA) to identify characteristics about ideas represented by words and word strings and the character of the relationship between a word or word string and any other word or word string. Other methods can be used based on the same core idea of leveraging the relationships between ideas defined by their frequency and proximity to one another in language, along with other category indicators, to solve more complex problems. This can involve conducting common frequency analysis on two or more different sets of segments and using combined results in a user-defined manner.

One example of a more complex relationship that can be identified is the pattern formed by the comparison of signatures of words or word strings that are the opposites of each other. To identify this pattern, a user will enter a word into the system (e.g. hot). The system will then identify all the frequencies of recurring words and word strings around this word (these generate the words "signature"). Next, the user will call on the system to identify all the frequencies of recurring words and word strings around the word or word string representing the opposite idea (e.g. cold). The system will then look for a common pattern for overlapping ideas between the left side of the word hot and the right side of cold and between the left side of cold and the right side of hot.

The results are a pattern formed by the comparison of the two signatures that the system can then use to identify other word or word string pairs with similar pattern formed by the comparison of their signatures. Thus if the system is queried with a word or word string in a manner that seeks the opposite, the system will (1) identify all word and word strings suπounding that query, (2) identify the list of words and word strings that have signatures similar to the query, but not at the level of similarity that would identify them as a synonym, (3) then compare the signatures of these related (but not synonymous) words and word strings against the query and (4) compare the comparison identified in step 3 with the comparisons of signatures of previously identified opposite word or word string pairs. If any of the comparisons generated in step 3 have a pattern that is similar enough (user defined) to the pattern formed by signature comparisons between known opposites, the system will identify the word or word string from step 2 that contrasted with the query to form that pattern and identify it as the opposite of the query.

It should also be noted that user defined parameters for the system to produce word string equivalents (or any other relationship) can involve word strings in any close proximity to the query and not just directly adjacent to the query on the left or right side. Adjusting the user defined parameters will be desirable in applications where expression of semantic meaning is typically less efficient or less structurally conventional (e.g., conversations fixed in an Internet "chat room" medium and other types of conversations).

Translation Database Builder Using Semantic Equivalent Generator

Additional embodiments of the present invention utilize the system and method for generating a list of semantic equivalents to aid in translation. It can be used as an alternative, or in conjunction with, the word string translation database builder using parallel text and the double overlap technique as previously described herein and in U.S. Patent Application No. 10/024,473.

One example of how the system and method for generating a list of semantic equivalents can be utilized in a translation database is as follows: First, generate two specific signatures of a user defined size to the left and right of the portion to be translated that is yet to be resolved. For example, assume that the system is translating the sentence "I went to the ball park to watch the baseball game." Moreover, assume that all segments of the translation for the sentence are known except for the phrase "the ball park" (this is known as un unresolved phrase or portion). If the user defined parameters are defined as the three word string immediately to the left of the unresolved phrase, and the four word string immediately to the right of the unresolved phrase, the present invention returns two word strings: a "Left Signature Specific Word String" and a "Right Signature Specific Word String." Thus, the Left Signature Specific Word String would be: "I went to." The Right Signature Specific Word String would be: "to watch the game."

Second, using any of the previously described embodiments for creating semantic associations, generate signature lists in the source language for the unresolved phrase from a document database. The Lists created using the above-described semantic equivalent system and method on the unresolved phrase are called the Left Signature List and the Right Signature List, respectively.

Third, translate both the Left Signature Specific Word String and the Left Signature List to the target language. The translations can be obtained using either the present invention's parallel text database builder, or other translation devices known in the art. Results using translation systems known in the art can be improved by using the present invention's multilingual leverage embodiment described above. The result of this process is the "Left Target Signature List." Conduct a similar translation process on the Right Specific Word String List and the Right Signature List to create a "Right Target Signature List." Fourth, create - using Steps 2 and 4 above of the semantic equivalent process - target language anchor lists from the Left and Right Target Signature Lists and any target language document database. The resulting lists from this process are, respectively, the Left Target Anchor Lists and the Right Target Anchor Lists.

Finally, compare the returns of the Left Target Anchor Lists with the returns of the Right Target Anchor Lists. The results that appear on at least one of the Left Target Anchor Lists and one of the Right Target Anchor Lists are potential translations of the query and are ranked according to the total number of Anchor Lists on which they appear. Extra weighting for the ranking can be given for appearances on the Anchor Lists derived from the Specific Context Word String Lists for greater precision. Rankings can also be determined by multiplying the number of Left Anchor Lists by the number of Right Anchor Lists that a result appears on. Additionally, some weight for the total frequency of returns can be included as a factor in ranking results.

Another embodiment using semantic equivalents to build a database of potential translations for a query, given an unresolved phrase, is as follows:

First, analyze the unresolved phrase of the query according to the semantic equivalent analysis using only Left and Right Specific Signature Word Strings , as described above. Then analyze the unresolved phrase of the query according to the semantic equivalent analysis using only Left and Right Signature Lists, as described above. The results that appear on either at least one of the Left Anchor Lists and or the Left Signiture Specific Word String and either one of the Right Anchor Lists and/or the Right Signituer Specific Word String are then ranked according to the total number of Anchor Lists on which they appear. Extra weighting for the ranking can be given for appearances on the Anchor Lists derived from the Signature Specific Word Strings. Next, the unresolved portion of the query and the list of semantic equivalents generated by the ranking described above are then translated into the target language. The translations can be obtained using either the present invention's parallel text database builder, or other translation devices known in the art. Results using translation systems known in the art can be improved by using the present invention's multilingual leverage embodiment previously described. For each of the translation results , the system generates a list of semantic equivalents using a database of text in the target language. Any target language translation that appears on a user defined number of the lists (but at least two of the lists) is designated as a potential translation of the unresolved portion of the query.

Given the potential inaccuracy of known translation devices, the translations produced for the unresolved portion of the query and its semantic equivalents using these devices can be examined for a threshold of partial accuracy as well. For instance, if translating a five-word word string using a rule based engine produced a five- word word string translation in the target language, that target language word string can be tested for semantic equivalents of any word string between a user defined number of words long that includes a user defined minimum of the words in the translation.

As another embodiement to translate documents from one language to another using ICFA or RCFA, involves including semantic equivilants of a query as well as their left and right signiture word strings attached. Using these lists in both the source and target languages, a word for word dictionary between both languages, and the double overlap technique, translation between languages can be accomplished. At it's core, the association database building technique involves (i) taking a unit of grouped data organized in a linear or ordered fashion, (ii) breaking the group of data down to all possible contiguous subsets of the whole, and (iii) building relationships between all subsets of data, based on frequent recurring (generally close) proximity to one another in all available units of grouped data. At the core of CFA, the system provides the frequently recurring proximity relationships between subset data segments to the user to help identify certain recurring patterns that define the "data signature" providing generalized information about any data related to that general "data signature". Therefore, the same techniques used in the database creation, and common frequency analysis can be employed to recognize patterns for many other types of data mining, text mining, target recognition, and any other application that requires the recognition of patterns.

As will be understood by those skilled in the art, many changes in the apparatus and methods described above may be made by the skilled practitioner without departing from the spirit and scope of the invention.

APPENDIX

PROGRAM 1

&lt;^"""&lt;?

$exclude_eng = array(

'itVits'^a' is' was' for' doVof s' the' and'/to' inVif or',

'that'/thisVin theVare' of the' by'^eVto theVasVon'/anVat',

^•with'/fromVhe' wiH^lias' not'/by theVwould' should'/saidVi',

^•but'/so'/had'/who'/no'/only'/her'/of a',τjeen','and the','at the');

$exclude_fre = array(

'ir,'elleVsonVsa','sesVun',^,uneVestVetaitVρour','faire^,,OpA(c)rerVposer','de',

'leVla' lesVet' A Ven' si' queVquiVcelui'/ceVcesVcetVcettes'/dans le',

'dans la','sont','de la','du','prA"s de',*de','daprA"s^,,'par','A!tre','A la','au',*aux',

^,commeVsi','en avantVsurVun^l,'uneVvers','avec','il','g^rA(c)','volontA(c)','devoir',

A_|tre obligA(c)','disaitVdisais','disentVje','mais','si','on',^lavait',^,avaisVavaient',

'quiVqueVnonVseulement','elleVet le','et la','et les','des', 'dans');

$exclude_spa = array(

'loVellaVsuVunVunaVesVfueVfui' porVparaVhacerVhacenVellos',

'ellas' deVelVlaVlosVyVhasta' enVsiVeseVqueVaquelloVaquella',

'este','esto','estA-','eresVson','del','cerca','al ladoVestar','ser','ar,'como',

'encendido','unVarroba','con',^,desdeVA(c)r,'voluntad',^,tiene','hay^,,'deber','dijo',

'yo','pero','sino','asA-','tan','o','habA-aVquien','quiA(c)n','no','sA31o','solamente',

'la','ha sido');

$dir= "hebfre"; Sdirdone = "hebfredone"; Slang = ".eng"; $olang = ".fre"; Stable = "hebfre"; Slanguagecount = "langcount"; Slanguage = "lang"; Solanguagecount = "olangcount"; $olanguage = "olang"; #$debug = "true"; function getmicrotime()

{ list($usec, $sec) = explode(" ",microtime()); return ((float)$usec + (float)$sec);

}

Sallstart = getmicrotime();

$fp = fopen("/usr/local/apache/log.txt", "w+"); fputs ($fp,"starting ".date("H:i:s")."&lt;BR&gt;\n");

$filelist = file("http://128.241.244.166/list.php?dir=$dir&amp;lang=$lang");#change

$temρ = imρlode("",$filelist);

$list = strtolower(trim($temp));

$mainarray = explode("\n",$list); sort($mainarray) ; reset($mainarray) ;

$filearray = aπay();

Scale = 0; for ($t = 0 ; $t &lt; count($mainaπay) ; $t++)#count($mainarray) change

{ if(file_exists(str_replace($lang,$olang,$mainarray[$t])))

{

$temp = $mainarray[$t];

$templ = file("$mainarray[$t]"); unset($temp2); for ($m = 0 ; $m &lt; count($templ) ; $m++)

{ if (strstr($templ [$m],"....")) unset($templ [$m]);

$templ[$m] = eregi_replace("[[:space:]]+", " ",strip_tags($templ[$m]));

$templ [$m] = urldecode(str_replace("&amp;htab;","",$templ [$m])); if ($temρl[$m] != "") $temp2 = $templ[$m];

} $filearray["$temρ"] = utf8_encode($temp2);

# 11 II II II 1! I!

$temp = str_replace($lang,$olang,$mainaπay[$t]);

$templ = file(str_replace($lang,$olang,$mainarray[$t])); unset($temp2); for ($m = 0 ; $m &lt; count($templ) ; $m++)

{ if (strstr($templ[$m],"....")) unset($temρl[$m]);

$templ[$m] = eregi_replace("[[:sρace:]]+", " ",strip_tags($templ[$m]));

$templ[$m] = urldecode(str_replace("&amp;htab;","",$templ[$m])); if ($templ[$m] != "") $temp2 = $templ[$m];

}

$filearray["$temρ"] = utf8_encode($temp2);

}

} fputs ($fp,date("H:i:s")."&lt;BR&gt;done loading files into array.\n");

Saddwords = "true";

$ctodo = count($mainarray);

$t = 0; for ($t = 0 ; $t &lt; $ctodo ; $t++)

{ if (fιle_exists(str_replace($lang,$olang,$mainarray[$t]))) Sfilexist = "true"; else unset($filexist); print "filee = $filexist - $mainarray[$t]\n"; if ($debug = "true") $filexist = "true"; if($filexist = "true")

{ if ($mainaπay[$t] &amp;&amp; $debug != "true")

{ system("mv $mainarray[$t]

/usr/locaFapache/$dirdone/".str_replace("/usr/local/apache/$dir/","",$mainarray[$t])); system("mv ".str_replace($lang,$olang,$mainarray[$t])." /usr/local/apache/$dirdone/".str_replace($lang,$olang,str_replace("/usr/local/apache/$dir/ ","",$mainarray[$t])));

} $lng = $filearray[$mainarray[$t]];

$olng = $filearray[str_replace($lang,$olang,$mainarray[$t])];

$lngs = explode(" ",$lng); for ($i = 0 ; $i &lt; count($lngs) ; $i++)

{ if (!ereg("[^Λa-zA-Z]",$lngs[$i])) $lngs[$i] = strtolower($lngs[$i]);

}

Solngs = explode(" ",$olng); for ($i = 0 ; $i &lt; count($olngs) ; $i++)

{ if (!ereg("[^Λa-zA-Z]",$olngs[$i])) $olngs[$i] = strtolower($olngs[$i]);

}

$sume = count($lngs); $sumh = count($olngs); if ($sume &gt; $sumh) { $margin = round($sume / ($sume - $sumh)); $action = "add"; } elseif ($sumh &gt; $sume) { Smargin = (round($sumh / ($sumh - $sume))); $action = "sub"; } else { $margin = 1; $action = "sub"; } $number = count($lngs); for ($j = $t+l ; $j &lt; $ctodo ; $j++) # main loop, rotate between the files to be checked.

{ if (file_exists(str_replace($lang,$olang,$mainaπay[$j]))) # check filename match.

{ $file_start = getmicrotime(); unset($aπay); $array = aπay();

$lngtp = $filearray[$mainaπay[$j]];

Solngtp = $filearray[str_replace($lang,$olang,$mainarray[$j])]; Slngstp = explode(" ",$lngtp); for ($i = 0 ; $i &lt; count($lngstp) ; $i++)

{ if (!ereg("[^Λa-zA-Z]",$lngstp[$i])) $lngstp[$i] = strtolower($lngstp[$i]);

} Solngstp = explode(" ",$olngtp); for ($i = 0 ; $i &lt; count($olngstp) ; $i++)

{ if (!ereg("[^Λa-zA-Z]",$olngstp[$i])) $olngstp[$i] = strtolower($olngstp[$i]);

}

$sumetp = count($lngstρ);

$sumhtp = count($olngstp); if (Ssumetp &gt; $sumhtp) { $margintp = round($sumetp / ($sumetp - Ssumhtp)); $action = "add"; } elseif (Ssumhtp &lt; $sumetp) { Smargintp = (round($sumhtp / (Ssumhtp - $sumetp))); $action = "sub"; } else { Smargintp = 1; $action = "add"; }

Snumbertp = count($olngstp); if ($debug = "true") print date("H-i-s")."&lt;BR&gt;\n"; for ($i = 0 ; $i &lt; $number ; $i++) #main loop, covers every space.

{ if($t = $j) $ni = $i + l; else $ni = 0; for ($n = $ni ; $n &lt; $numbertp ; $n++)

{ unset($thesameh);

$ρ = 0; unset($theb); Slangstart = getmicrotime(); while ($p &lt; 15 &amp;&amp; $lngs[$i+$p] == $lngstp[$n+$p] &amp;&amp; $lngstp[$n+$p] != "")#check if the $n words match.

{

$theb .= $lngs[$i+$p] . " ";

$thebl = trim($theb); if (!ereg("[ ~!@#$%^A&amp;*()o_+=-?.,;:Λ]",$thebl) &amp;&amp; !ereg("[0-

9]",substr($thebl,0,l)) &amp;&amp; !ereg("^Λ[0-9]*$",$thebl)

&amp;&amp; $thebl != "" &amp;&amp; substr($thebl,0,l) != "-" &amp;&amp; !ereg("[0-9]",substr($thebl,-

1))

&amp;&amp; substr($thebl,-l) != "-" &amp;&amp; substr($theb 1,0,1) != '"" &amp;&amp; substr($thebl,-l)

|__ It.!.

&amp;&amp; Sthebl != "'" &amp;&amp; $thebl != "" &amp;&amp; !in_array($thebl,$exclude_eng))

{

$temp = $aπay[$thebl]["hebrew_c"]; if (!$temp) #new, welcome

{

$array[$thebl]["hebrew_c"] = ",$i,"_;

} elseif (!strstr($temp,",$i,")) #new, welcome

{

$array[$thebl]["hebrew__c"] = $temρ . "$i,";

} $extra = floor($i/$margin); if (Saction == "add") { Sextrasm = $i + $extra - 45; $extralg = $i + $extra + 45;

} elseif (Saction = "sub") { Sextrasm = $i - Sextra - 45; Sextralg = $i - Sextra +

45; } if (Sextrasm &lt; 0) Sextrasm = 0; if (Sextralg &gt; Ssumh) Sextralg = Ssumh; Solangstart = getmicrotime(); for ($e = Sextrasm ; $e &lt; Sextralg; $e++)

{

Sextran = floor($n $margintp); if (Saction = "add") { $bot = $n + Sextran - 45; Stop = $n + Sextran + 45; } elseif (Saction = "sub") { Sbot = $n - Sextran - 45; Stop = $n - Sextran + 45; } if($bot &lt; 0) $bot = 0; if (Stop &gt; Ssumhtp) Stop = Ssumhtp; unset(Stbc); for ($x = $bot ; $x &lt; Stop ; $x++) # check the english, 10 back and 10 forward.

{ unset(Steng); if ((St = Sj &amp;&amp; $x &gt; $e)'|| St != $j)# $n &gt; $e &amp;&amp;

{

$a = 0; while ($olngs[$e+$a] = $olngstp[$x+$a] &amp;&amp; $olngs[$e+$a] != "")

{

Steng = " " . $olngs[$e+$a];

Steng = trim(Steng); if (!ereg("[ ~!@#$%^Λ&amp;*()o_+=-?.,;:Λ]",$teng) &amp;&amp; !ereg("[0- 9]",substr($teng,0,l)) &amp;&amp; !ereg("^Λ[0-9]*$",$teng)

&amp;&amp; Steng != "" &amp;&amp; substr($teng,0,l) != "-" &amp;&amp; !ereg("[0- 9]",substr($teng,-l))

&amp;&amp; substr($teng,-l) != "-" &amp;&amp; substr($teng,0,l) != "'" &amp;&amp; substr($teng,- 1) != "'"

&amp;&amp; Steng != "'" &amp;&amp; Steng != "" &amp;&amp; !in_array($teng,$exclude_fre))

{

Stemparray = array_keys($array[$thebl]); if (in_array($teng,$tempaπay))

{

Stemp = $array[$thebl][$teng]; if (!strstr("$temp",",$x,"))# &amp;&amp; !strstr("$templ",",$e,"))

{

$array[$thebl][$teng] = $temp."$x,";

} } else

{

$aπay[$thebl][$teng] = ",$x,";

} }

$a++;

} #end of while loop

} }# end of for loop. }# end of new loop Solangend = getmicrotime(); Stimel = Solangend - Solangstart;

#fputs ($fp,"French word number $n of Snumbertp took $timel\n"); }# end up to 5 hebrew together. $P++;

} # end of while loop $p &lt; 15 Slangend = getmicrotime(); $time2 = Slangend - Slangstart; #fputs ($fp,"English word number $i of Snumber took $time2\n");

} } if (count(Sarray) &gt; 0)

{ Sdbstart = getmicrotimeO;

Sstream = MYSQL_CONNECT("l 27.0.0. l","root");

Stempheb = array_keys($array); for (Si = 0 ; $i &lt; count(Stempheb) ; $i++)

{

$lng = $tempheb[$i]; if (substr_count($aπay[$lng]["hebrew_c"],",") - 1 &gt; 0)

{

Singe = substr_count($array[$lng]["hebrew_c"],",") - 1;

Stempolng = array_keys($array[$lng]);

$n = l; while ($n &lt; count(Stempolng) &amp;&amp; count(Stempolng) &gt; 1)

{

Solng = $tempolng[$n];

Solngc = substr_count($aπay[$lng] [$olng],",") - 1 ;

Squery = "update Stable set total = total+1 , Slanguagecount = $languagecount+$lngc , Solanguagecount = Solanguagecount+Solngc , article = concat(article,\", $mainarray[$j] \") where (article not like '% $mainaπay[$j] %' and Slanguage = "'.addslashes($lng). and Solanguage = "'.addslashes($olng).'")";

MYSQL("brain",$query,$stream)or die("#2 Can't Squery ".MYSQL_ERROR());

Snum = MYSQL_AFFECTED_ROWS($stream); if($num = 0)

{

Squery = "insert ignore into Stable values(\"NULL\",\"l\","'.addslashes($lng).",".addslashes($olng)."^,,\"".addslashes($lng)."\ ",\"$lngc\",\"".addslashes($olng)."\",\"$olngc\",\" $mainarray[$j] \")"; MYSQL("brain",$query,$stream)or die("#3 Can't Squery ".MYSQL_ERRORQ);

}

$n++;

}

}

} MYSQL_CLOSE($stream);

Sdbend = getmicrotime();

Stime = Sdbend - Sdbstart; φuts ($φ,"db took $time\n");

} $file_end = getmicrotime();

} } }

}

Sallend = getmicrotimeQ;

Stime = Sallend - Sallstart; φuts ($φ,"the whole shit took $time\n"); φuts ($φ,"final: ".date("Y-m-d H:i:s") . " - Scale - &lt;BR&gt;\n"); fclose(Sφ);

?&gt;

??

??

Footnote continued from previous page

Footnote continued on next page

PROGRAM 2

&lt;?

Sword = "united nations";

$engspa_t = "engspa";

Sengfre = "hebfre";

$frespa_t = "frespa";

$c = l;

MYSQL_CONNECT("128.241.244.166","root");

Squery = "select total,lang,langcount,olang,olangcount from $engfre_t where olang =

'Sword'";

Sresult = MYSQL("brain",$query) or die("Error #1 - Squery - ".MYSQL_ERROR());

Squeryl = "select lang from $engspa_t where olang = 'Sword'";

Sresultl = MYSQL("brain",$queryl) or die("Eπor #2 - Squeryl - ".MYSQL_ERROR())_. for (Si = 0 ; $i &lt; MYSQL_NUM_ROWS($resultl) ; $i++)

{ list(Slang) = MYSQL_FETCH_ROW($resultl);

Sin = ","^,.addslashes($lang).^m";

}

$in = substr($in,l);

Snum = MYSQL_NUM_ROWS($result); print "$in&lt;BRxBR&gt;\n"; for ($i = 0 ; Si &lt; Snum ; $i++)

{ list($total,$lang,$langc,$olang,$olangc) = MYSQL_FETCH_ROW($result); print "Slang , ";

$query2 = "select cid from $frespa_t where olang = '".addslashes($lang).'" and lang in (Sin)";

$result2 = MYSQL("brain",$query2) or die("Eπor #3 - $query2 - ".MYSQL_ERROR0); if (MYSQL_NUM_ROWS($result2) &gt; 0)

{

Sres .= "$i - $total,$lang,$langc,$olang,$olangc&lt;BR&gt;\n";

$c++;

} } print "&lt;BRxBR&gt;$res"; print "$c / ".MYSQL_NUM_ROWS($result); ?&gt;

??

??

Footnote continued from previous page

Footnote continued on next page PROGRAM 3

&lt;? function convert($what,$olang)

{ if (Swhat == '"") $what = "V"; if($what == "\\") return;

Squery = "select sletter from " . Solang . "letter where fletter = 'Swhat'";

Sresult = MYSQL("minibush","$query") or die("*$what* -error #1 Squery - " .

MYSQL_ERROR()); if (MYSQL_NUMROWS($result) &gt; 0)

{ list(Ssletter) = MYSQL_FETCH_ROW($result); return Ssletter;

} else return stripslashes(Swhat);

} function overlap($s,$mm,$mean,$tos,$osmean,$max,$dictionary_t,$lang,$olang,$spaceaddress,$l ongestolang)

{

Stempmax = Smax;

$ {Solang} = $osmean;

$ {Slang} = Smean;

Smean = explode(" ",$mean);

Sosmean = explode(" ",$osmean); for ($m = $mm; $m &lt; count(Smean) ; $m++)

{ unset(Sstring); for ($1 = $m ; $1 &lt; count(Smean) ; $1++) Sstring .= $mean[$l] . " ";

$sm = $s + count(Smean); unset(Snextwordmatch) ; if ($spaceaddress[$sm+l]) Snextwordmatch = "Slang like '".str_reρlace("%","",trim($string.$spaceaddress[$sm]))." %' or";

Squeryl = "select $lang,$olang from $dictionary_t where Snextwordmatch Slang = "*.str_replace("%","",trim($string.$spaceaddress[$sm])).*" and Solang o " order by Slang desc, length($lang),$olang desc, length(Solang) desc";

Sresultl = MYSQL("minibush","$queryl") or die("can't error #2 - 'Squeryl* " . MYSQL jERRORO);

$t = 0; while (St &lt; MYSQL_NUMROWS($resultl))# &amp;&amp; Stempmatch != "yes")

{ list($ {"temp".$lang} ,$ {"temp".$olang}) = MYSQL_FETCH_ROW($resultl);

Stempmean = explode(" ",${"temp".$lang});

Stempomean = explode(" ",${"temp".$olang});

$tg = $m; $tm = 0; unset(Stempmatch); while ($tg &lt; count(Stempmean) + $m)

{ if (($spaceaddress[$s+$tg] = $tempmean[$tm]) &amp;&amp; (Stempmatch != "no")) Stempmatch = "yes"; else Stempmatch = "no";

$tg++;

$tm++;

} if (Stempmatch = "yes" &amp;&amp; substr_count($longestresult," ") &lt;= substr_count(${"temp".$lang}," ")) #checks if the new overlap is matching the translation request.

{

Slongestresult = ${"temp".$lang};

Somean = explode($tempomean[0],$ {Solang});

$to = count(Somean) - 1;

Stcheckb = substr(${"temp".$olang},0,strlen($tempomean[0])); if ($osmean[$tos] = $tempomean[0] &amp;&amp; isset($osmean[$tos]))

{ if (count(Smean) + count(Stempmean) - 1 &gt; Smax) # singleword overlap

{

Smax = $m + count(Stempmean);

$ns = $m;

Stolang = ${$olang} . substr(${"temp".$olang},strlen($tempomean[0]));

Soverlap = "true";

} else Stempmatch = "no";

} elseif ($osmean[($tos-l)] = $tempomean[0] &amp;&amp; $osmean[$tos] = $tempomean[l] &amp;&amp; isset($osmean[($tos-l)]))

{ if (count(Smean) + count(Stempmean) - 1 &gt; Smax) # singleword overlap

{

Smax = $m + count(Stempmean); Sns = $m;

Stolang = $ {Solang} . substr(S{"temp".$olang},strlen($tempomean[0]." " .$tempomean[ 1 ]));

Soverlap = "true";

} else Stempmatch = "no";

} elseif ($osmean[($tos-2)] = $tempomean[0] &amp;&amp; $osmean[($tos-l)] = $tempomean[l] &amp;&amp; $osmean[$tos] = $tempomean[2] &amp;&amp; isset($osmean[($tos-2)]))

{ if (count(Smean) + count(Stempmean) - 1 &gt; Smax) # singleword overlap {

Smax = $m + count(Stempmean); $ns = $m;

Stolang = $ {Solang} . substr(${"temp".$olang},strlen($tempomean[0]." ".$tempomean[l]." ".$tempomean[2])); Soverlap = "true";

} else Stempmatch = "no";

} elseif (substr_count($ {Solang}," ") = 0 &amp;&amp; Stcheckb = trim(substr($ {Solang}, 1)))

{ if (count(Smean) + count(Stempmean) - 1 &gt; Smax) # singleword overlap

{

Smax = $m + count(Stemρmean); $ns = $m;

Solangminus = substr($ {"temp". $olang},strlen($ {Solang})); Stolang = $ {Solang} . " " . Solangminus; Soverlap = "true"; } } elseif (substr_count($ {Solang}," ") = 0 &amp;&amp; substr_count(${ "temp ".Solang}," ") == 0) # english overlap hebrew one word only.

{

Smax = $m + count(Stempmean);

$ns = $m;

Stolang = $ {Solang} . " " . ${"temp".$olang};

Soverlap = "true";

} else

{

Stempmatch = "no"; .

} if ($overlap = "true")

{

Smmean = explode(" ".$tempmean[0],$ {Slang});

$to = count(Smmean) - 1 ;

Sttos = count(Smean) - 1 ; if ($mmean[$to] &amp;&amp; $to &gt; 0)

{

Stcheck = substr(${"temp".$lang},strlen($tempmean[0])+l); if (substr($tcheck,0,strlen(trim($mmean[$to]))) == trim($mmean[$to])) # overlapping

{

$tlang = $ {Slang} . substr($tcheck,strlen(trim($mmean[$to]))); } } elseif ($mean[$ttos] = $tempmean[0] &amp;&amp; $mean[$ttos])

{

$tlang = $ {Slang} . substr(${"temp".Slang},strlen($tempmean[0]));

} else { print "BIG ERROR"; exit; }

} }

$t++;

}

} if (Soverlap != "true") Soverlap = "false"; if (Stempmax = Smax &amp;&amp; Soverlap != "true") Smax = 0;

$array = aπay("s"=&gt;"$s","mm"=&gt;count($mean),"mean"=&gt;$tlang,"tos"=&gt;substr_count($tolang,"

"),"osmean"=&gt;$tolang,"max"=&gt;"$max","tolang"=&gt;"$tolang","overlap"=&gt;"$overlap","lon gestolang"=&gt;"$longestolang"); return Saπay;

} function translate($word,$lock,$tags,$baselang)

{ global $id_t,$prefix_t,$dictionary_t;

Sbaselang = "hebrew"; if (! Sword) return; if (Stranseng = "true") { if (ereg("[a-zA-Z]",$word)) return Sword; } if (Sbaselang = "hebrew") { Sspaceit = "true"; Semailend = " • o,£.6f.,D";} if (Sbaselang = "Japanese") { $dictionary_t = "dictionaryjap"; Sspaceit = "false"; } if (Sbaselang = "chinesesim") { $dictionary_t = "dictionarychnsim"; Sspaceit = "false";

}

MYSQL CONNECT("216.205.78.138","nobody")or die("can't connect " . MYSQL_ERROR()); Sword = trim(Sword); if ((strstr($word,hebrev($id_t).",") || strstr($word,hebrev($id_t).^π ") || substr($word,strlen($word) - strlen($id_t)) = hebrev($id_t)) &amp;&amp; isset($id_t))

{

Sword = str_replace(hebrev($id_t),"",$word);

Ssystemsite = "true";

} if (Sword)

################# # www.something #

#################

{

##################### if (strstr($word, "http://www.inhebrew.co.il/nsia.html"))

{

Sword = split("=",$word); Sword = split("&amp;",$word[l]); return $word[0];

}

##################### if (strstr($word,"://")) { Stemp = explode("://",$word); Saddress = $temp[l]; } else Saddress = Sword; Saddress = explode("/",$address); Saddresscheck = $address[0]; if (!ereg("[a-zA-Z...-£j",$addresscheck)) Saddresscheck = $address[lj; if(ereg("[a-zA-Z]",$addresscheck))

{

Slang = "english"; Solang = Sbaselang; if (strtolower(substr($word,0,7)) = "http://") { Sword = substr($word,7); Spre = "„SS"://"; } if (strtolower(substr($word,0,8)) = "https://") { Sword = substr($word,8); Spre = "„SS"π://"_; } if (strtolower(substr($word,0,6)) = "ftp://") { Sword = substr($word,6); Spre = ""S"://"; }

} elseif (Sbaselang = "hebrew")

{

Slang = "hebrew";

Solang = "english"; if (substr($word,0,8) = "„SS"://*") { Sword = substr($word,8); Spre = "http://"; Supper = "true"; } elseif (substr($word,0,7) = "„SS"://") { Sword = substr($word,7); Spre = "http://"; } elseif (substr($word,0,9) = "„SS"α_://*") { $word = substr($word,9); Spre = "https://"; Supper = "true"; } elseif (substr($word,0,8) = "„SS"π_://") { $_WOrd = substr($word,8); Spre = "https://";

} elseif (substr($word,0,7) = ""S"://*") { Sword = substr($word,7); Spre = "ftp://";

Supper = "true"; } elseif (substr($word,0,6) = ""S"://") { Sword = substr($word,6); Spre = "ftp://"; } elseif (substr($word,0,l) = "*") { Sword = substr($word,l); Supper = "true"; }

} elseif (Sbaselang = "Japanese")

{

Slang = "Japanese";

Solang = "english";

} elseif (Sbaselang = "chinesesim")

{

Slang = "chinesesim";

Solang = "english"; } $s = 0;

Stempreplace = strtolower(Sword); while ($s &lt; strlen(Stempreplace))

{ if (!ereg("[...-£a-zA-Z0-9V\"]",$tempreplace[$s]))

{

Stempreplace = substr_replace($tempreplace," $tempreplace[$s] ",$s,l);

$s = $s + 2;

}

$s++;

} Stempreplace = eregi_replace("[[:space:]]+", " ",$tempreplace);

Sspaceaddress = explode(" ",$tempreplace);

$s = 0; unset(Sspace);

Scolor = "red";

Scounts = count(Sspaceaddress);

Squery = "select $lang,$olang from $dictionary_t where Slang = 'Stempreplace'";

Sresult = MYSQL("minibush","$query") or die("can't eπor #0.1 - 'Squery' " .

MYSQL_ERROR()); if (MYSQL_NUMROWS($result) &gt; 0)

{ list(${$lang},${$olang}) = MYSQL_FETCH_ROW($result);

$space = $ {Solang};

Scounts = 0;

} . while (Scounts &gt; $s) # word between . .

{

$spaceaddress[$s] = trim($spaceaddress[$s]); if (Stags = "true")

{

Sopen = "&lt;font color=\"$color\"&gt;";

Sclose = "&lt;/font&gt;"; if (Scolor = "red") Scolor = "blue"; else Scolor = "red";

} if (ereg("[...-£a-zA-ZY\"]",$spaceaddress[$s]))

{ unset(Srestofaddress); for (Si = $s ; $i &lt; Scounts ; $i++) Srestofaddress .= " ".$spaceaddress[$i]; Srestofaddress = trim(Srestofaddress);

Squery = "select $lang,$olang from $dictionary_t where Slang = 'Srestofaddress'"; Sresult = MYSQL("minibush","$query") or die("can't error #0.2 - 'Squery' " . MYSQL_ERROR()); if (MYSQL_NUMROWS($result) = 1) { list($ {Slang} ,$ {Solang}) = MYSQL_FETCH_ROW($result); Sspace .= " ".$open.$ {Solang}. Sclose; Sspace = trim(Sspace); Scounts = 0;

} else

{

$n = $s + l; unset(Snextwordmatch) ; if ($spaceaddress[$n]) Snextwordmatch = "Slang like "^,.str_replace("%","",$spaceaddress[$s])." ".str_replace("%","",$spaceaddress[$n])."%' or";

Squery = "select $lang,$olang from $dictionary__t where Snextwordmatch Slang = '$spaceaddress[$s]' and Solang o " order by Slang desc, length($lang),$olang desc, length(Solang) desc";

Sresult = MYSQL("minibush","$query") or die("can't error #1 - 'Squery' " . MYSQL_ERROR()); if ($match = "yes") unset(Smatch); if ((MYSQL_NUMROWS($result) &gt; 0) &amp;&amp; (Smatch != "no"))

{

$n = 0; '

Smaximum = 0;

Smaximumr = 0; unset(Sfinals); unset(Sfinalsr); unset(Slongestolang) ; unset(Slongestlang); while ($n &lt; MYSQL_NUMROWS($result))# &amp;&amp; (Smatch != "yes"))

{ list($ {Slang} ,$ {Solang}) = MYSQL_FETCH ROW($result);

Smean = explode(" ",$ {Slang});

Sosmean = explode(" ",$ {Solang});

Stos = count(Sosmean) - 1 ;

$g = 0; unset(Smatch); while ($g &lt; count(Smean))

{ if (($spaceaddress[$s+$g] = $mean[$g]) &amp;&amp; (Smatch != "no")) Smatch =

"yes" else Smatch = "no";

$g++; } if (Smatch = "yes")

{ if (strlen(Slongestolang) &lt; strlen($ {Solang})) Slongestolang = $ {Solang}; if (strlen(Slongestlang) &lt; strlen($ {Slang})) Slongestlang = $ {Slang}; unset(Soverlap); unset(Smax);

$ array = aπay();

$ array = overlap($s, 1 ,$ {Slang} ,$tos,$ {Solang} ,$g,$dictionary_t,$lang,$olang,$spaceaddress,$lon gestolang);

Smax = $array["max"];

Stolang = $aπay["tolang"]; if (Stolang) Swasok = "true"; while ($array["overlap"j != "false" &amp;&amp; count(Sspaceaddress) &gt; Smax)

{ $array = overlap($array["s"],$array["mm"],trim($aπay["mean"]),$aπay["tos"],trim($aπay["osmea n"]),$g,$dictionary_t,$lang,$olang,$spaceaddress,$longestolang); if ($array["overlap"] = "true")

{

Smax = $aπay["max"];

Stolang = $aπay["tolang"];

Swasok = "true";

} } if (Smax &gt; Smaximum &amp;&amp; Smax &gt; 0)

{

Smaximum = Smax;

Sfinals = Stolang;

} if ($wasok != "true")

{ if (strlen($ {Slang}) &gt; Smaximumr)

{

Smaximumr = strlen($ {Slang});

$gr = $g;

$fmalsr = $ {Solang};

} } }

$n++;

} if($wasok == "tme")

{ Smatch = "true"; if (!strstr($finals,$longestolang) &amp;&amp; Smaximum &lt;= (substr_count(" ",$longestolang)+l))

{

#print "*"; if ($s = 0) Sspace = Sspace . $open . Slongestolang . Sclose; else Sspace = Sspace . " " . Sopen . Slongestolang . Sclose; $s = $s + substr_count($longestlang," ") + 1;

} else

{ if ($s == 0) Sspace = Sspace . Sopen . Sfinals . Sclose; else Sspace = Sspace . " " . Sopen . Sfinals . Sclose;

$s = $s + Smaximum;

} unset(Smaximum); unset(Swasok);

} elseif (Sfinalsr) ### testing new thing, what happens when a partial mach was found, (ie a something, but a is not in the system).

{ if ($s = 0) Sspace = Sspace . Sopen . Sfinalsr . Sclose; else Sspace = Sspace . " " . Sopen . Sfinalsr . Sclose;

$s = $s + Sgr; unset($maximumr);

} else # still is test phase.

{ if (ereg("[a-zA-Z...-£]",$spaceaddress[$s])) Sspace = Sspace . " " . Sopen . convert(substr($spaceaddress[$s],0,l),$baselang) . Sclose; else Sspace = Sspace . Sopen . convert(substr($spaceaddress[$s],0,l),$baselang) . Sclose;

$spaceaddress[$s] = substr($spaceaddress[$s],l); if (!$spaceaddress[$s] || $spaceaddress[$s] = "0") $s++; unset(Smatch);

} } else

{ if (ereg("[a-zA-Z...-£]",$spaceaddress[$s])) Sspace = Sspace . " " . Sopen . convert(substr($spaceaddress[$s],0,l),$baselang) . Sclose; else Sspace = Sspace . Sopen . convert(substr($spaceaddress[$s],0,l),$baselang) . Sclose;

$spaceaddress[$s] = substr($spaceaddress[$s],l); if (!$spaceaddress[$s] || $spaceaddress[$s] = "0") $s++; unset(Smatch);

} if (!$sρaceaddress[$s] || $spaceaddress[$s] = "0") $s++;

} } else

{ if (ereg("[a-zA-Z...-£]",$spaceaddress[$s])) {Sspace = Sspace . " " . Sopen . convert(substr(Sspaceaddress[$s],0,l),$baselang) . Sclose; print "##"; } elseif (ereg("[a-zA-Z...-£]",$spaceaddress[($s-l)])) Sspace = Sspace . " " . Sopen . convert(substr($spaceaddress[Ss],0,l),$baselang) . Sclose; else Sspace = Sspace . Sopen . convert(substr($spaceaddress[Ss],0,l),$baselang) . Sclose;

$spaceaddress[$s] = substr($spaceaddress[$s],l);

$s++; unset(Smatch);

} }# end of word between . . Surl .= Sspace; unset(Stemp); $count++; #next word. if(strstr($word,"@"))

{

Srevid = hebrev($id_t); if (strstr($url,".")) Surl = ereg_replace("([a-zA-Z0-9/-/_/ ])@([a-zA-Z0-9/-/_/ ]*)([/₅])";'\\l-\\2@inhebrew.co.il\\3","$url"); else Surl = ereg_replace("([a-zA-Z0-9/-/_ ])@([a-zA-Z0-9/-/_/ ]*)","\\l.\\2@inhebrew.co.il",$url); unset(Ssystemsite);

} if (strstr($word, " @inhebrew.co . il"))

{

Srevid = hebrev($id_t);

Surl = ereg_replace("([...-£]).([/-/ ...-£/-/ ]*)@$emailend","\\l@\\2$revid",$url);

} if (Ssystemsite = "true" &amp;&amp; !strstr("$word","@"))

{ if (Send) return "http://" . str_replace(" ","",$end) . ".inhebrew.co.il/index.html?sub=" . substr($end,l); else return "http://" . str_replace(" ","",$url) . ".inhebrew.co.il";

} if (ereg("inhebrew.co.il/([a-zA-Z0-9/-]*)/index.htmr',$word) &amp;&amp;

!strstr($ word, "inhebrew.co.il sample/"))

{

Send = substr($end, 1 ); if(strstr($end,"/"))

{ return eregi_replace("[[:space:]]+", " ",str_replace(" - ","-",str_replace("

@","@",($end))));

} } return eregi_replace("[[:space:]]+", " ",str_replace(" - ","-",str_replace("

@","@",$url))); } } ?&gt;

??

??

Footnote continued from previous page Footnote continued on next page

PROGRAM 4

&gt;package Brain;

&gt;

&gt;import j ava.sql. * ;

&gt;import j ava.util. Vector;

&gt;import java.util.Hashtable;

&gt;import java.util.Map;

&gt;import j ava.util.Comparator;

&gt;import j ava.util. Arrays;

&gt;import java.util.StringTokenizer;

&gt;

&gt; * @author Nischala

&gt; * @version &gt; */

&gt;public class PhraseCollectBean { &gt;

&gt; private int maxResults;

&gt; private String reqPhrasel;

&gt; private String reqPhrase2;

&gt; private String reqPhrase3;

&gt; private String reqPhrase4;

&gt; private int startSelCount;

&gt; private int endSelCount;

&gt; private int startMinWords;

&gt; private int endMinWords;

&gt; private boolean isContentCreated = false; &gt;

&gt; private Vector startPhrs;

&gt; private Vector endPhrs;

&gt; private Hashtable stMidPhrs = new Hashtable(lO);

&gt; private Hashtable enMidPhrs = new Hashtable(lO);

&gt; private Hashtable uniqStPhrs = new Hashtable(lO);

&gt; private Hashtable uniqEnPhrs = new Hashtable(lO); &gt;

&gt;

&gt; private Connection dbConnection = null; &gt;

&gt; /** Creates new PhraseCollectBean

&gt; * and initiaslize it's properties to default values

&gt; */

&gt; public PhraseCoUectBean() { &gt; maxResults = 30;

&gt; reqPhrasel = "";

&gt; reqPhrase2 = "";

&gt; reqPhrase3 = ""; &gt; reqPhrase4 = "";

&gt; startSelCount = 4;

&gt; endSelCount = 4;

&gt; startMin Words = 1;

&gt; endMinWords = 1;

&gt; dbConnection = Brain.getDBConnection();

&gt; } &gt;

&gt; public int getMaxResults () {

&gt; return maxResults;

&gt; } &gt;

&gt; public String getReqPhrasel () {

&gt; return reqPhrasel ;

&gt; } &gt;

&gt; public String getReqPhrase2 0 {

&gt; return reqPhrase2;

&gt; } &gt;

&gt; public String getReqPhrase3 () {

&gt; return reqPhrase3;

&gt; } &gt;

&gt; public String getReqPhrase4 0 {

&gt; return reqPhrase4;

&gt; } &gt;

&gt; public int getStartSelCount () {

&gt; return startSelCount;

&gt; } &gt;

&gt; public int getEndSelCount () {

&gt; return endSelCount;

&gt; } &gt;

&gt; public int getStartMinWords () {

&gt; return startMinWords;

&gt; } &gt;

&gt; public int getEndMinWords () {

&gt; return endMinWords; &gt; } &gt;

&gt; public String[] getPhrases() {

&gt; StringO arr = {reqPhrasel, reqPhrase2, reqPhrase3, reqPhrase4};

&gt; return arr;

&gt; } &gt;

&gt; public void setMaxResults (int x) {

&gt; maxResults = x;

&gt; } &gt;

&gt; public void setReqPhrasel (String x) {

&gt; reqPhrasel = x;

&gt; //System. out.println("New value-I being set..");

&gt; } &gt;

&gt; public void setReqPhrase2 (String x) {

&gt; reqPhrase2 = x;

&gt; //System.out.println("New value-II being set..");

&gt; } &gt;

&gt; public void setReqPhrase3 (String x) {

&gt; reqPhrase3 = x;

&gt; //System.out.println("New values-Ill being set..");

&gt; } &gt;

&gt; public void setReqPhrase4 (String x) {

&gt; reqPhrase4 = x;

&gt; //System.out.println("New values-IV being set..");

&gt; } &gt;

&gt; public void setStartSelCount (int x) {

&gt; startSelCount = x;

&gt; } &gt;

&gt; public void setEndSelCount (int x) {

&gt; endSelCount = x;

&gt; } &gt;

&gt; public void setStartMinWords (int x) {

&gt; startMinWords = x;

&gt; } &gt;

&gt; public void setEndMinWords (int x) {

&gt; endMinWords = x; &gt; } &gt;

&gt; private int getPhraseId(String phr) { &gt; if(phr = null) phr = "";

&gt; try {

&gt; if (!(phr == "")) {

&gt; return new Phrase(phr).getld();

&gt; } else return 0;

&gt; } catch (Exception e) {

&gt; System.out.println("Exception while getting the phrase ID from &gt;Brain.Phrase (PhraseCollectBean. getPhraseld): " + e);

&gt; eπors = "Exception while getting the phrase ID from &gt;Brain.Phrase (PhraseCollectBean.getPhraseld): " + e;

&gt; return 0; &gt; }

&gt; } &gt;

&gt; private Map.Entry[] sortByValue(Hashtable ht) {

&gt; java.util.Set set = ht.entrySet();

&gt; Map.Entry[] entries = (Map.Entry[])set.toArray(new &gt;Map.Entry[set.sizeQ]);

&gt; Arrays.sort(entries, new ComparatorQ {

&gt; public int compare(Object ol, Object o2) {

&gt; Object objl = ((Map.Entry)ol).getValue();

&gt; Object obj2 = ((Maρ.Entry)o2).getValue();

&gt; return ((Comparable)obj2).compareTo(objl);

&gt; }

&gt; });

&gt; return entries;

&gt; } &gt;

&gt; public String getAssocByJoinsO {

&gt; logMsg = "";

&gt; eπors = "";

&gt; PreparedStatement p2Stmt, plStmt;

&gt; ResultSet p2Result = null, plResult = null;

&gt; stMidPhrs.clearQ;

&gt; enMidPhrs.clearO;

&gt; uniqStPhrs.clear();

&gt; uniqEnPhrs.clear();

&gt; StringBuffer resultStr = new StringBuffer("");

&gt; String relativeResult = "";

&gt; startPhrs = new Vector(startSelCount);

&gt; endPhrs = new Vector(endSelCount); &gt;

&gt; Connection dbConnection = null; &gt; &gt; int pid = 0;

&gt; String[] phrases = getPhrases();

&gt; String inQry = "";

&gt; for (int i = 0; i ");

&gt; resultStr.append(" " + i + " ");

&gt; resultStr.append(" " + plcnt + " ");

&gt; String tempSt = plPr;

&gt; if((st = startMinWords)){

&gt; int pi id = getPhraseId(plPr);

&gt; if(plid != 0) {

&gt; startPhrs.addElement(""+plid); &gt; st++;

&gt; resultStr.aρρend(" " + plPr &gt;+ " ");

&gt; }

&gt; } else {

&gt; resultStr.append(" " + plPr + " ");

&gt; }

&gt; resultStr.append(" " + (String)stMidPhrs.get(plPr) +

&gt;" ");

&gt; resultStr.append(" ");

&gt; resultStr.append(" " + (String)enMidPhrs.get(p2Pr) +

&gt;" ");

&gt;

&gt; String tempEn = p2Pr;

&gt; if((en = endMinWords)) {

&gt; int p2id = getPhraseId(p2Pr);

&gt; if(p2id != 0) {

&gt; endPhrs.addElement(""+p2id);

&gt; en++;

&gt; resultStr.apρend(" " + p2Pr

&gt;+ " ");

&gt; }

&gt; } else {

&gt; resultStr.append(" " + p2Pr + " ");

&gt; }

&gt; resultStr.append(" " + p2cnt + " ");

&gt; resultStr.append("n");

&gt; i++;

&gt; }

&gt; m++;

&gt; } &gt;

&gt; if(i &gt; l) {

&gt; createAssignedBin();

&gt; createDataBin(stEntries, enEntries, stMidPhrs, enMidPhrs); &gt; isContentCreated = false;

&gt; }

&gt;/**/

&gt; } catch(Exception e) {

&gt; resultStr.append(" Exception while retrieving the results

&gt; 'l(PhraseCollectBean.getAssocByJoins):" + e + ". Check the log for eπors");

&gt; //System.out.println("Exception while retrieving the results &gt;(PhraseCollectBean.getAssocByJoins) :" + e);

&gt; eπors += "Exception while retrieving the results &gt;(PhraseCollectBean.getAssocByJoins) :" + e;

&gt; e.printStackTrace();

&gt; }

&gt; return resultStr.toString() ;

&gt; } &gt;

&gt; public String getRelatives(int maxShow) {

&gt; eπors = ""; &gt; logMsg = "";

&gt; String strl = "", str2 = "", str3 = "";

&gt; PreparedStatement plRelStmt = null;

&gt; int newScore = 0;

&gt; Hashtable uniqMidPhrs = new HashtableQ;

&gt; Hashtable phrllds = new Hashtable();

&gt; Hashtable phr2Ids = new Hashtable();

&gt; StringBuffer relResultStr = new

&gt; StringBuffer("Common Phrases bin surronding relatively common middle phrase

&gt; S. NOTotal Scorephrase 2");

&gt; int sno = 1 ; &gt;

&gt; try {

&gt; if(dbConnection = null) {

&gt; //System.out.ρrintln("DB Conn is Null in getRelatives!");

&gt; dbConnection = Brain.getDBConnection();

&gt; }

&gt; } catch(Exception e) {

&gt; //System.out.println("Exception while getting connection from &gt;Brain:" + e);

&gt; } &gt;

&gt; if((startPhrs = null) || (startPhrs.sizeO = 0) || (endPhrs = &gt;null) || (endPhrs.sizeO = 0)) return relResultStr.toStringO;

&gt; String startCond = "(";

&gt; for (int i = 0; i " + sno + "");

&gt; String winName = "newwin" + m;

&gt; relResultStr.append(""+ phrScore +" " + phrKey + " ");

&gt; sno++; &gt; }

&gt; //System.out.println("IS Content Created?? : " + &gt;isContentCreated);

&gt; if( (! isContentCreated) &amp;&amp; (maxShow != 50) &amp;&amp; (sno &gt; 1)) {

&gt; createContentBin(entries);

&gt; }

&gt; } catch(Exception e) {

&gt; //System.out.println("Exception while executing query: "+ e);

&gt; }

&gt; return relResultStr.toString() + "";

&gt; } &gt;

&gt; private void createAssignedBin() {

&gt; if(! assignedHash.isEmptyO) assignedHash.clear();

&gt; assignedHash.put("maxRes", new Integer(maxResults));

&gt; String phraseStr = "";

&gt; String[] aπay = getPhrases();

&gt; for(int i = 0; i

Galshan delivers the entire Internet in Hebrew.

Get a Hebrew e-mail address (and free web mail service).

Want to surf the Web in Hebrew? Download Galshan's browser bar.