公开(公告)号：US20030014240A1

公开(公告)日：2003-01-16

申请号：US10137109

申请日：2002-04-30

Applicant: STMicroelectronics S.r.I.

Inventor： Loris Navoni ,  Roberto Canegallo ,  Mauro Chinosi ,  Giovanni Gozzini ,  Alan Kramer ,  Pierluigi Rolandi

IPC: G06F017/21

CPC classification number: G06F17/30985 ,  G11C15/046 ,  Y10S707/961 ,  Y10S707/99945

Abstract: A memory device includes an associative memory for the storage of data belonging to a plurality of classes. The associative memory comprises a plurality of memory locations aligned along rows and columns for the storage of data along the rows. Each memory row comprises a plurality of groups of memory locations, each storing a respective datum, wherein groups of memory locations adjacent along one and the same row store data belonging to different classes. Groups of memory locations adjacent in the direction of the columns and disposed on different rows store data belonging to one and the same class. Each class comprises data having a different maximum lengths. The device is particularly suitable for the storage of words belonging to a dictionary for automatic recognition of words in a written text.

Abstract translation: 存储器装置包括用于存储属于多个类别的数据的关联存储器。 关联存储器包括沿着行和列对准的多个存储器位置，用于沿行存储数据。 每个存储器行包括多组存储器位置，每组存储相应的数据，其中沿同一行相邻的存储器位置组存储属于不同类的数据。 在列方向上相邻并且位于不同行上的存储器组的组存储属于同一类的数据。 每个类包括具有不同最大长度的数据。 该装置特别适用于存储属于用于自动识别书面文本中的词典的字典的单词。

公开(公告)号：US20020034329A1

公开(公告)日：2002-03-21

申请号：US09974290

申请日：2001-10-09

Applicant: STMicroelectronics S.r.I

Inventor： Loris Navoni ,  Roberto Canegallo ,  Mauro Chinosi ,  Giovanni Gozzini ,  Alan Kramer ,  Pierluigi Rolandi

IPC: G06K009/00

CPC classification number: G06F17/30985 ,  G11C15/046 ,  Y10S707/99936

Abstract: A word recognition device uses an associative memory to store a plurality of coded words in such a way that a weight is associated with each character of the alphabet of the stored words, wherein equal weights correspond to equal characters. To perform the recognition, a dictionary of words is first chosen; this is stored in the associative memory according to a pre-determined code; a string of characters which correspond to a word to be recognized is received; a sequence of weights corresponding to the string of characters received is supplied to the associative memory; the distance between the word to be recognized and at least some of the stored words is calculated in parallel as the sum of the difference between the weights of each character of the word to be recognized and the weights of each character of the stored words; the minimum distance is identified; and the word stored in the associative memory having the minimum distance is stored.