Abstract: A method of linear unsupervised classification allowing a database composed of objects and of descriptors to be structured, which is stable on the order of the objects, comprises an initial step for transformation of the qualitative, quantitative or textual data into presence-absence binary data. A structural threshold ?s function is determined of the n2 agreements between the objects to be classified with the structural threshold defining an optimization criterion adapted to the data. The descriptors are used as structuring and construction generators of a partition or set of classes. A class generated by a descriptor and a partition (40, 41, 42) progressively merged. For an optimization criterion involving a function ƒ(Cii,Ci?i?)=Min(Cii,Ci?i?), sums of Minimum functions are linearized.

Abstract: Method for extracting information from a data file comprising a first step wherein the data are transmitted to a device (3.1) or “tokenizer” adapted to convert them in the course of a first step into elementary units or “tokens”, the elementary units being transmitted to a second step of searching in the dictionaries (3.2) and a third step (3.3) of searching in grammars, wherein, for each conversion step, a sliding window of given size is used, the data are converted into “tokens” as and when they arrive in the tokenizer and the tokens are transmitted as and when they are formed to the step of searching in dictionaries (3.2), then to the step of searching in the grammars (3.3).

Abstract: The invention relates to a method for comparing a textual document with an existing document base. An identifier Ii is allocated to this new document Di. The document is divided into blocks Pij, such as sentences. A “unique” key Eij is associated with each sentence Pij, then searching for this key Eij in a finite state machine in order to determine which are the documents of the document base that contain the sentence Pij. A similarity is calculated between the elements of the existing database and the dataset formed by the sentences Pij. The set of the old documents contained in the existing database is determined that contain at least a fixed percentage X % of sentences of the document to be compared.

Abstract: Method for extracting information from a data file comprising a first step wherein the data are transmitted to a device (3.1) or “tokenizer” adapted to convert them in the course of a first step into elementary units or “tokens”, the elementary units being transmitted to a second step of searching in the dictionaries (3.2) and a third step (3.3) of searching in grammars, characterized in that, for the conversion step, a sliding window of given size is used, the data are converted into “tokens” as and when they arrive in the tokenizer and the tokens are transmitted as and when they are formed to the step of searching in dictionaries (3.2), then to the step of searching in the grammars (3.3).

Abstract: A method of linear unsupervised classification allowing a database composed of objects and of descriptors to be structured, which is stable on the order of the objects, comprises an initial step for transformation of the qualitative, quantitative or textual data into presence-absence binary data. A structural threshold ?s function is determined of the n2 agreements between the objects to be classified with the structural threshold defining an optimization criterion adapted to the data. The descriptors are used as structuring and construction generators of a partition or set of classes. A class generated by a descriptor and a partition (40, 41, 42) progressively merged. For an optimization criterion involving a function ƒ(Cii,Ci?i?)=Min(Cii,Ci?i?), sums of Minimum functions are linearized.