Skip Navigation

The Computer Journal 1981 24(3):249-255; doi:10.1093/comjnl/24.3.249
© 1981 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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Thimbley, H. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A word boundary algorithm for text processing

H. W. Thimbley *

Computer Systems Laboratory, Queen Mary College, University of London, London, UK

Many text display editors include ‘word’ function keys. The user effectiveness of such functions depends crucially on a well thought out idea of what ‘words’ are. This paper presents a carefully thought out scheme for word functions and gives the relevant algorithms for them in Pascal. The approach used here has been used with success for well over two years after examining and rejecting many alternatives.

It is beyond the scope of this paper to attempt a psychological assertion on the nature of words or word formation.

Received September 1979.

* Computer Systems Laboratory, Queen Mary College, University of London, London E1, 4NS, UK


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.