Metraipolis › archive › dc_aa3b8ec91e46

Augmented transition network — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Augmented_transition_network
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-10T08:53:22.551Z
SHA-256 of the archived text
c977c9b8ef44c455be7bc551d4dd2802a56efd85c230f424c82c917f79e73fc7
Stable URL of this page
https://metraipolis.com/documento/dc_aa3b8ec91e46

How to cite

Augmented transition network — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Augmented_transition_network (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_aa3b8ec91e46 (Metraipolis archive dc_aa3b8ec91e46, sha256 c977c9b8ef44c455be7bc551d4dd2802a56efd85c230f424c82c917f79e73fc7)
BibTeX
@misc{dcaa3b8ec91e46,
  title = {Augmented transition network — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Augmented_transition_network},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_aa3b8ec91e46; sha256 c977c9b8ef44c455be7bc551d4dd2802a56efd85c230f424c82c917f79e73fc7},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Augmented_transition_network. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

An augmented transition network (ATN) is a type of graph theoretic structure used in the operational definition of formal languages, used especially in parsing relatively complex natural languages, and having wide application in artificial intelligence. An ATN can, theoretically, analyze the structure of any sentence, however complicated. ATN are modified transition networks and an extension of RTNs. ATNs build on the idea of using finite-state machines (Markov model) to parse sentences. W. A. Woods in "Transition Network Grammars for Natural Language Analysis" argues that by adding a recursive mechanism to a finite state model, parsing can be achieved much more efficiently. Instead of building an automaton for a particular sentence, a collection of transition graphs are built. A grammatically correct sentence is parsed by reaching a final state in any state graph. Transitions between these graphs are simply subroutine calls from one state to any initial state on any graph in the network. A sentence is determined to be grammatically correct if a final state is reached by the last word in the sentence. This model meets many of the goals set forth by the nature of language in that it captures the regularities of the language. That is, if there is a process that operates in a number of environments, the grammar should encapsulate the process in a single structure. Such encapsulation not only simplifies the grammar, but has the bonus of efficiency of operation. Another advantage of such a model is the ability to postpone decisions. Many grammars use guessing when an ambiguity comes up. This means that not enough is yet known about the sentence. By the use of recursion, ATNs solve this inefficiency by postponing decisions until more is known about a sentence.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Augmented transition network» — https://en.wikipedia.org/wiki/Augmented_transition_network
Wikidata Q3629536: «tipologia di grafo» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3629536
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Augmented_transition_network?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1345775820, consultata il 2026-11-10T08:49:14.277Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4fcb6345ecef81528a4bed6c3f38875877cf1c26a7471abe9fd3893305bedadd