Abstract: A memory storing a computerized data array in the form of a table of values stored in the memory as a directed tree representing a set of data. Each data entry in the set is associated with a particular node of the tree, the values representing node ranks of the tree. The node ranks are ordered according to a first total order relation, the values being stored at addresses in the memory representing the node ranks and being ordered according to a second total order relation.

Abstract: A data processing system for constructing a co-occurrence data file relating to a corpus of objects comprises first memory and second memory. A module determines the size of the co-occurrence data file from an inventory of distinct objects in the corpus. A second module divides the size of the co-occurrence data file into blocks occupying a memory space at most equal to the size of a buffer block of the first memory, each block of the file matching inventoried objects with each other. A third module processes each block of the file by reading the corpus and incrementing by one unity a frequency count associated with objects of the block if those objects are grouped in the read corpus to satisfy a co-occurrence criterion, each group of objects corresponding to one co-occurrence data item. At the end of the reading of the corpus, the co-occurrence data and the associated non-null frequency counts corresponding to the co-occurrence data are transferred to the co-occurrence data file in the second memory.

Abstract: The invention derives automatically segmenting any graphic chain into graphemes and any phonetic chain into phonemes from transcriptions graphic chains (words) into phonetic chains. First probabilities (P(gi|pj)) of transcriptions of graphic elements into phonetic elements are estimated (E2). For each transcription of a given graphic chain with M graphic elements into a corresponding phonetic chain with N phonetic elements, second probabilities (P(g1, . . . gm|p1, . . . pn)) of MN second transcriptions of M graphic chains successively concatenating the M graphic elements into N phonetic chains successively concatenating the N phonetic elements are determined. Links between the last elements (gm, pn) of the graphic and phonetic chains of second transcriptions are established in order to constitute in an M×N matrix a path segmenting the given graphic chain into graphemes corresponding to respective phonemes segmenting the corresponding phonetic chain.

Abstract: A data processing system comprises a first memory and a second memory including a sparse direct matrix comprising full boxes storing a data item and a column index and addressable consecutively. A module dimensions a transposed matrix, by reading row by row column indices of the direct matrix so as to reserve boxes of the transposed matrix in the second memory. A module identifies in the first memory a submatrix of reserved boxes of the transposed matrix and occupying a memory space smaller than the first memory. A module fills in the boxes of the submatrix according to the column indices read from the boxes of the direct matrix, and transfers the submatrix into the second memory to fill-in the transposed matrix.

Abstract: A system checks the accuracy of a required graphic chain, e.g. usage errors. Modules constructs a phoneticizer by construction of an automaton compiling transcription rules and by determining probabilities of transitions between grapheme/phoneme correspondences. A dictionary of phonetic signatures is constructed by transcribing graphic chains from a graphic chains dictionary into phonetic signatures and linking the phonetic signatures to said graphic chains and determines probabilities of transcriptions of the graphic chains into the phonetic signatures. A transcription of the required graphic chain is determined into a request phonetic signature, and a probability of the preceding transcription is determined. In the phonetic signatures dictionary, phonetic signatures are looked up substantially identical to said required phonetic signature to derive therefrom attested graphic chains stored in the graphic chains dictionary.

Abstract: To reduce the memory space of the computer representation of a lexical tree and to find a word rapidly therein, the words are sorted in lexicographical order and the tree is then constructed by iteration. A prefix of the preceding and following words and a suffix of the following word are determined. If in the preceding word the length of a particular string, at the end of which a length from the root of the tree is at least equal to the length of the prefix, is greater than that of the prefix, the particular string is divided into first and second sub-strings. The suffix and the second sub-string that replaces the particular string are stored at first and second addresses in a son summit table relating to the first sub-string.

Abstract: A memory storing a computerized data array in the form of a table of values stored in the memory as a directed tree representing a set of data. Each data entry in the set is associated with a particular node of the tree, the values representing node ranks of the tree. The node ranks are ordered according to a first total order relation, the values being stored at addresses in the memory representing the node ranks and being ordered according to a second total order relation.