. Ekeberg, rjan. Robust Dictionary Lookup Using Associative Networks, International Journal of Man-Machine Studies, Vol 28 1988, pp 29-43 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Approximate Swedish Name Matching - Survey And Test Of Different.. - Erikson (Correct)
....as pointers to specific database entries. A k n matrix, with k being the size of the alphabet, is created. Each field corresponds to a certain n gram and designates an index containing all words in the database with the particular n gram in them. These methods are described in [Kukich 1992] and [Ekeberg 1988]. According to [Ekeberg 1988] normal trigram index lists will have about twice as many entries as the database. Rubber N grams [Ekeberg 1988] proposes a method to render the n grams more flexible, so called rubber n grams. The idea is to create a link between an n gram and a word not only if ....
....entries. A k n matrix, with k being the size of the alphabet, is created. Each field corresponds to a certain n gram and designates an index containing all words in the database with the particular n gram in them. These methods are described in [Kukich 1992] and [Ekeberg 1988] According to [Ekeberg 1988], normal trigram index lists will have about twice as many entries as the database. Rubber N grams [Ekeberg 1988] proposes a method to render the n grams more flexible, so called rubber n grams. The idea is to create a link between an n gram and a word not only if the n gram itself is in the ....
[Article contains additional citation context not shown here]
. Ekeberg, rjan. Robust Dictionary Lookup Using Associative Networks, International Journal of Man-Machine Studies, Vol 28 1988, pp 29-43
Neural Associative Memories - Palm, Schwenker, Sommer, Strey (1993) (2 citations) (Correct)
....retrieval is the access of words in a large dictionary [H.J. Bentz, 1989] The following results are obtained with a dictionary of approximately 300,000 german word forms. Experiments with NAMs on this data base have been performed both in our group and in other places. In [Heimann, 1994, Ekeberg, 1988] the trigram encoding described in section 4 yielded a little more than 3 million trigrams in total, 7,561 features occur in the data which is a low fraction of the set of l 3 = 17; 576 possible trigrams. A systematic test regarding the fault tolerance had been carried out for some typical ....
Ekeberg, O. (1988). Robust dictionary lookup using associative networks. Int. Journal Man-Machine Studies, 28:29--43.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC