By Topic

Rapid searching of massive dictionaries given uncertain inputs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lucas, S.M. ; Dept. of Electron. Syst. Eng., Essex Univ., Colchester, UK

A new method of searching large dictionaries given uncertain inputs is described, based on the lazy evaluation of a syntactic neural network (SNN). The new method is shown to significantly outperform a conventional tree-based method for large dictionaries (e.g. in excess of 100000 entries). Results are presented for the problem of recognising UK postcodes using dictionary sizes of up to 1 million entries. Most significantly, it is demonstrated that the SNN actually gets faster as more data is loaded into it

Published in:

Document Image Processing and Multimedia Environments, IEE Colloquium on

Date of Conference:

2 Nov 1995