Boyer-Moore pattern matching algorithm was used to search 35 natural language quenes against a file of 1000 titles and abstracts taken from the Library and Information Science Abstracts database. A model of searching using a singly-linked chain containing up to 11 transputers was carried out: the maximum speed-up obtained with this size of network was 10.4 with a processor utilization of 0.95, both figures being close to the ideal of 11.0 and 1.0. Expenments with a nearest neighbour searching algorithm for serial document files demonstrate the need to keep the processors fully occupied with computational work if a high degree of speed-up is to be obtained.