Home
DICTIONARY or DICTIONARIES
|
|
Technical Examples
- In response to a jumping operation in which a word appearing in an explanatory description read from a Chinese-Japanese dictionary is specified as a jump word, language information on the jump word is read, and the jump word is converted to the corresponding all-purpose character codes by using an all-purpose character code/Chinese-Japanese dictionary local character code conversion table for the language information on the jump word. Further, the all-purpose character codes of the jump word are converted to the corresponding existing local character codes by using an all-purpose character code/existing local character code conversion table for the language information. Jump-enabled destination dictionaries are then extracted based on the language information, a headword matching the jump word is retrieved in a jump destination dictionary selected from the extracted jump-enabled destination dictionaries, and the corresponding explanatory description is then displayed.
- A method for indexing, extracting, analyzing, and utilizing co-occurrences of logical concepts in text documents is disclosed. References to logical concepts are detected by a text processing procedure by detection of descriptors, e.g., names, also including abbreviations, from a hierarchical dictionary with names and synonyms for said logical concepts, or database identifiers. Co-occurring concepts are indexed and stored in a database as a list or a table. Analysis of co-occurrences detects expressed and implied relationships between co-occurring concepts based on statistical and lexical text analysis. The method includes a procedure to create domain-specific hierarchical dictionaries for logical concepts in a given domain.
- A dictionary based accelerated method of lossless compression and encryption of data with a small statistical redundancy. The sequence of the least distances obtained between every input numerical sample and the samples of the several dictionaries, produced by random number generators, and statistical compression is further applied. The process is accelerated utilizing a packed content addressable memory (CAM) for dictionary and input samples. CAM is scanned for a marking bit indicating a presence of a dictionary sample to find the least distance. CAM is packed and loaded with successful ranges of the amplitudes of both dictionary and input samples to reduce an address space and to accelerate the process of compression further. The least distances are founded for an unique alphabet of the input sequence, and the results are merged with an original input to accelerate the process of compression further.
Thank you for using Findownersearch.com. If you have any comments or suggestions, please contact us.