| Patent application number | Description | Published |
|---|
| 20090063454 | VORTEX SEARCHING - Determining intersection points of parameter patterns. Parameter patterns are specified in a query. A method includes identifying a first parameter pattern from the query as occurring less often in the index than one other parameter pattern in the query. The data store is searched until a present location of the data store has been identified as including the first parameter pattern. Then the data store is searched for a location of another parameter pattern. If the present location is identified as including the another parameter pattern, then an indication is provided identifying an intersection. Otherwise, the method includes continuing searching remaining portions of the data store to find a location of the another parameter pattern at a new present location. At least one of the acts of searching above includes eliminating at least a portion of records of the data store from searching without being searched prior to being eliminated. | 03-05-2009 |
| 20090063479 | SEARCH TEMPLATES - Searching a data store for parameter patterns specified in a query. A method includes receiving a query from a user including N parameter patterns. One or more alternatives are associated to one or more of the N parameter patterns. One or more templates are created. Each of the templates describes a number of microsearches. Each of the microsearches includes one or more of the N parameter patterns or the alternatives. Microsearches described by at least one of the one or more templates are enumerated. One or more sub-microsearches are performed by searching for parameter patterns and/or alternatives. Each sub-microsearch may have less than all terms needed for a full microsearch. Based on the results of the one or more sub-microsearches, one or more microsearches are eliminated from searching. The data store is searched using one or more of the remaining microsearches. | 03-05-2009 |
| 20090307184 | Hyperspace Index - Hyperspace index data structure. A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes binary bits or groups of small parameter pattern keyed records. Each binary bit or parameter pattern keyed record corresponds to an identifier corresponding to a parameter pattern. If the bit or record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first data field. Each of the additional fields includes identifiers for a subset of information in the first field. The absence of an identifier corresponding to a parameter pattern at any level in all of the hierarchical threads indicates that the parameter pattern is not present. | 12-10-2009 |
| 20120096008 | HYPERSPACE INDEX - A data structure indexes identifiers corresponding to parameter patterns. The presence of an identifier in the data structure indicates that the corresponding parameter pattern may be present in a set of parameter patterns, while absence of the indicator can be used to indicate that the corresponding parameter pattern is not present. The data structure includes a first field which includes small parameter pattern records. Each parameter pattern record corresponds to an identifier corresponding to a parameter pattern. If the record corresponding to the identifier is set or present, the identifier is included in the first field. One or more additional fields are hierarchically below the first field. Each of the additional fields includes identifiers for a subset of information in the first field. The absence of an identifier corresponding to a parameter pattern at any level in all of the hierarchical threads indicates that the parameter pattern is not present. | 04-19-2012 |
| Patent application number | Description | Published |
|---|
| 20090204406 | SYSTEM AND METHODS FOR DETECTING DECEPTION AS TO FLUENCY OR OTHER ABILITY IN A GIVEN LANGUAGE - The invention relates to a system and methods for detecting when a user is representing he is not fluent in a language in which he is fluent. The present system and methods are adapted to be used in conjunction with conventional and novel computer systems and methods and provides detection of concealment of language skills by a user. | 08-13-2009 |
| 20090317776 | Economic Language Learning System - A system of language learning applies economic theory to provide speakers and learners of each of plural languages. Remote users teach the native languages to one another by providing practice time for users seeking to learn such language. A computer keeps track of the value and cost of teaching and learning time in each language. | 12-24-2009 |
| 20100143873 | APPARATUS AND METHOD FOR TASK BASED LANGUAGE INSTRUCTION - A computer-implemented system and method for teaching a target language are disclosed that may include providing a pool of tasks associated with instruction of the target language by a computing system; receiving a query from a user requesting instruction of a target task from among the pool of tasks; identifying a sequence of tasks beneficial for teaching the target task; and presenting a lesson plan, including the beneficial sequence of language tasks, to the user in response to the user query, wherein the lesson plan includes the target task and at least one supporting task. | 06-10-2010 |
| 20100143874 | LANGUAGE SKILLS TEACHING METHOD AND APPARATUS - A student providing a multi-word response in a computerized language teaching system provides a manual input concurrently with each responsive word. For example, he might enter a keystroke correspondent to the first letter of each word. When using the teaching computer silently, a student will typically “speak” each word mentally as he enters a keystroke, so the limited experience is almost as effective as speaking out loud. When a student types one or more keystrokes concurrently with each word that he speaks, the computer will be able to detect when a student is responding with a correct word, but merely mispronouncing it. Also, since the computer will receive a keystroke as the student starts each new word, it is better able to distinguish the boundaries between words and recognize them more reliably. | 06-10-2010 |
