Looking on the internet deeply has found these results:

for small dictionaries is the most popular phrase on the web.

for the small dictionaries 12 results on the web	for small dictionaries 199 results on the web More popular!
Some examples and use cases from the internet:	Some examples and use cases from the internet:
previously for the small dictionaries, and it is proved that the provided structure can handle sequences of alphabets of arbitrary size using nlogσ+o(nlogσ) bits, ... dictionaries (373 and 452 words for the small dictionaries; 1396 and 1094 for the larger ones; about 1% for each dictionary). But because, unlike a dictionary's ...	The histogram technique clearly outperforms the MAX technique with 5–15% for small dictionaries up to 500–1,000 features, favoring this technique for ... For small dictionaries you should definitely see a performance benefit and I suspect you will see a size benefit as well. time systems. Effective for small dictionaries or for dictionaries where searches are common but inserts and deletes are rare (e.g. credit card authorizations). Hashing (2.5.2). ... be can computed quickly, so they're usally bad for small dictionaries; Resizing is very, very expensive, and probably can't be used in most real

for the small dictionaries

12 results on the web

for small dictionaries

199 results on the web

More popular!

previously for the small dictionaries, and it is proved that the provided structure can handle sequences of alphabets of arbitrary size using nlogσ+o(nlogσ) bits, ...
dictionaries (373 and 452 words for the small dictionaries; 1396 and 1094 for the larger ones; about 1% for each dictionary). But because, unlike a dictionary's ...

The histogram technique clearly outperforms the MAX technique with 5–15% for small dictionaries up to 500–1,000 features, favoring this technique for ...
For small dictionaries you should definitely see a performance benefit and I suspect you will see a size benefit as well.
time systems.
Effective for small dictionaries or for dictionaries where searches are common but inserts and deletes are rare (e.g. credit card authorizations). Hashing (2.5.2).
... be can computed quickly, so they're usally bad for small dictionaries; Resizing is very, very expensive, and probably can't be used in most real