4.5 Table look-up.. In lieu of a system to neutralize error another idea is to manually build a table of standard names with their abbreviations and oblique inflectional variants. This is the preferred method to handle the errors caused by these deviant forms of the name. These are situations where there is no hard and fast sequence of rules that could be relied on to characterize a suitable standard code. An example currently in use is the GIANT names table. This table includes much more than the irregular forms found in abbreviations and inflections, however. This mechanism is certainly feasible to resolve the same errors that arise by virture of the fallibility of the written and spoken language . Even though tables seem to be the best solution for the deviants coming from abbreviations and inflections, the GIANT table also contains these other similarly coded alternative spellings. The bottom line is that table look-up in general is much more efficient than rule execution. So, even though it is possible to think of a number of rules to generate possible abbreviations and certain case endings, the apparatus needed would probably seriously compromise the efficiency of a simple table look-up.