I imagine the file is loaded into memory, but this will not necessarily slow things down; it depends on how the data is searched. It would be instructive to create a huge dictionary, say via an automated process that renamed A<n> to Z<n> for arbitrarily large numbers of n values, to see if JAWS either slows down or starts consuming massive amounts of CPU time. I recommend a test document with no renamed values in it and another that is chocked full of them, for comparison. I've never tested this sort of thing. Here's a quick Python program to generate such a file. Usage: something like python gendict.py 5000 > notepad.jdf #! /usr/bin/env python # Save as gendict.py (or whatever you like) # Requires Python to be installed. import os, sys n = int(sys.argv[1]) for i in range(0, n): print ".A%d.Z%d." % (i, i) On Tue, May 21, 2013 at 05:12:12PM +0200, Csaba Godo wrote: Hi everybody, Could somebody tell me it how JAWS handles the dictionary files? Iwould like to know if entries are loaded into the memory on startup or JAWS reads entries on the fly like Windows reads the ini file entries. I would like to extend the Hungarian default JAWS dictionary with over 5,000 entries but I don't want to slow down the machine with memory overloading. So I would like to know if JAWS reads these files only during text processing or the whole file is loaded into the memory and JAWS looks these in-memory-file up during the process? Thanks in advance, Csaba -- Tshaba __________??? View the list's information and change your settings at //www.freelists.org/list/jawsscripts -- Doug Lee, Senior Accessibility Programmer SSB BART Group - Accessibility-on-Demand mailto:doug.lee@xxxxxxxxxxxxxxxx http://www.ssbbartgroup.com "While they were saying among themselves it cannot be done, it was done." --Helen Keller __________� View the list's information and change your settings at //www.freelists.org/list/jawsscripts