optimize complexity of filter out unwanted recognizers from O(n*m ) to O(n)

[rgupta2508]

Reopen this PR #1508
Creating map of supported entity and recognizers and filtering out based on entity name using kay .

Code refactor.

Improve complexity of filter out unwanted recognizers from O(n*m )to O(n)

In current code for loop is running inside for loop that makes complexity to O(n*m). after this change there is only one loop by using one extra variable.
where
m = total number of all_possible_recognizers
n= total supported entities which we want to include .

Change Description

Describe your changes

Issue reference

This PR fixes issue #XX

Checklist

• I have reviewed the contribution guidelines
• I have signed the CLA (if required)
• My code includes unit tests
• All unit tests and lint checks pass locally
• My PR contains documentation updates / additions if required

[rgupta2508]

@microsoft-github-policy-service agree