: The Formal Complexity of Natural Language. Studies in Linguistics and Philosophy, vol. 33. D. Reidel, Dordrecht: 1987. ISBN 1-55608-046-8 and 1-55608047 -6.  Home/Search   Document Not in Database   Summary   Related Articles

....of the Apple Linguistic Analysis Library: In most applications, there is no need to preserve all detected information until all text has been processed. For example, the information about gender or part ofspeech is not needed after a certain stage in processing; this allows to minimize memory needs. In addition, most linguistic modules do not have to operate on the entire text at once with a carefully designed system architecture, it is possible to analyze a 66 Chapter Six smaller chunk of a text (e.g. a paragraph) on its own. Then, only relatively few informations must be preserved; most ....

....the check succeeds and nothing happens. If the result however is equal, failAction is executed. NEQ is hence the opposite to EQ. Code Generation 89 n CNF checks allow to specify number of sets of disjoined EQ and NEQ checks; failAction is executed unless one disjunct from every set succeeds. The PowerPC code generation has been carefully tuned to take use of the optimal code sequence in most cases. For example, the specialized masking instruction rlwinm. which is not described in Appendix A for the sake of brevity) is emitted for EQ NEQ if this allows to replace longer sequences ....

: The Formal Complexity of Natural Language. Studies in Linguistics and Philosophy, vol. 33. D. Reidel, Dordrecht: 1987. ISBN 1-55608-046-8 and 1-55608047 -6.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC