Related Experiment Video
Updated: Jul 19, 2026

One Dimensional Turing-Like Handshake Test for Motor Intelligence
Published on: December 15, 2010
Lingos, finite state machines, and fast similarity searching
J Andrew Grant1, James A Haigh, Barry T Pickup
1AstraZeneca Pharmaceuticals, Mereside, Macclesfield, Cheshire SK10 4TF, England. andrew.grant@astrazeneca.com
Abstract:
We apply a recently published method of text-based molecular similarity searching (LINGO) to standard data sets for the purpose of quantifying the accuracy of the approach. Our implementation is based on a pattern-matching finite state machine (FSM) which results in fast search times. The accuracy of LINGO is demonstrated to be comparable to that of a path-based fingerprint and offers a simple yet effective method for similarity searching.
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Causes of Similarity-Dissimilarity Effect
Simplified Synchronous Machine Model
In this model, each generator is connected to a...
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Machines: Problem Solving II
