Skip Navigation

The Computer Journal 1973 16(2):132-134; doi:10.1093/comjnl/16.2.132
© 1973 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Szanser, A. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bracketing technique in elastic matching

A. J. Szanser *

Division of Computer Science, National Physical Laboratory, Teddington, UK

‘Elastic’, or approximate matching makes it possible to extract quickly and exactly all non-identical versions of a string from a provided list, within an accepted error-threshold. It the list is very long, a procedure using a bracketing technique assists in reducing the operational time. The paper is based on the application of elastic matching to automatic error-correction in natural language, but the principles and techniques described are general and can be applied in other cases of matching strings of coded elements.

Received October 1971.

* Division of Computer Science, National Physical Laboratory, Teddington, Middlesex


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.