17.12.2012 Views

Routledge dictionary of language and linguistics - Developers

Routledge dictionary of language and linguistics - Developers

Routledge dictionary of language and linguistics - Developers

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

A-Z 107<br />

augmented transition network (ATN)<br />

grammar<br />

Formalism used in computational <strong>linguistics</strong> 1 for analyzing (<strong>and</strong> generating) sentences,<br />

which was developed around 1970 as an alternative model to transformational<br />

grammar that could be easily implemented on computers. Instead <strong>of</strong> phrase structure<br />

rules (PS rules), augmented transition network grammar uses an equivalent set <strong>of</strong> finite<br />

state automata ( finite state automaton, formal <strong>language</strong>) that are called up<br />

recursively. Corresponding to the expansions <strong>of</strong> PS rules are permissible transitions<br />

between automata states; the working <strong>of</strong> transformations (e.g. in word order,<br />

congruence, active-passive-converse, control, etc.) is modeled by checking <strong>and</strong><br />

modifying the register contents <strong>of</strong> the computer (through auxiliary functions). The latter<br />

represent augmentations to the simpler (recursive) network grammars that are equivalent<br />

to context-free (PS) grammars. Moreover, it is possible to associate any kind <strong>of</strong><br />

actions—for example, ones which form tree diagrams, semantic representations, etc.—<br />

with the transitions between states. In this way, the augmented transition network<br />

grammar is not only a recognizing automaton, but also a transducer. Since the use <strong>of</strong><br />

registers is, in principle, not subject to any limitations <strong>and</strong> all the possibilities <strong>of</strong> a<br />

conventional programming <strong>language</strong> can be used, the augmented transition network<br />

grammar is as powerful as the universal Turing machine. For the application <strong>of</strong><br />

augmented transition network grammars to psycho<strong>linguistics</strong>, see Halle, Bresnan, <strong>and</strong><br />

Miller (1978).<br />

References<br />

Bates, M. 1978. The theory <strong>and</strong> practice <strong>of</strong> augmented transition network grammars. In L.Bolc<br />

(ed.), Natural <strong>language</strong> communication with computers. Berlin. 191–259.<br />

Bobrow, D. <strong>and</strong> B.Fraser. 1969. An augmented state transition network analysis procedure.<br />

Proceedings <strong>of</strong> the IJCAI 69. 557–67.<br />

Halle, M., J.Bresnan, <strong>and</strong> G.Miller (eds) 1978. Linguistic theory <strong>and</strong> psychological reality.<br />

Cambridge, MA.<br />

Kaplan, R. 1972. Augmented transition networks as psychological models <strong>of</strong> sentence<br />

comprehension. AI 3. 77–100.<br />

Rumelhart, D. 1977. Introduction to human information processing. New York.<br />

Thorne, J. et al. 1968. The syntactic analysis <strong>of</strong> English by machine. In D.Mitchie (ed.), Machine<br />

intelligence. New York.<br />

Wanner, E. <strong>and</strong> M.Maratsos. 1978. An ATN approach to comprehension. In M.Halle, J.Bresnan,<br />

<strong>and</strong> G.Miller (eds), Linguistic theory <strong>and</strong> psychological reality. Cambridge, MA. 119–61.<br />

Woods, W.A. 1970. Transition network grammars for natural <strong>language</strong> analysis. Communications<br />

<strong>of</strong> the ACM 13. 591–606.<br />

formal <strong>language</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!