Hi,
The problem with using BruteForce matching is when some signatures are retrieved from LTM, the retrieved words should be matched to dictionary again, thus with brute force matching we have almost double time required for an iteration (when signatures are retrieved). Looking the logs, the WM is effectively decreasing, but as we can see in the time plot when signatures are retrieved, we have double time required. When using KD-Trees, the overhead of matching retrieved words is much lower than with BruteForce, then real-time constraints can be satisfied.
Time:
WM: