transition network
E772507
A transition network is a type of finite-state graph model used to represent and process sequences, such as in computational linguistics for parsing natural language.
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
computational model
ⓘ
finite-state model ⓘ formalism in computational linguistics ⓘ graph-based model ⓘ |
| appliedTo |
morphological analysis
ⓘ
sentence recognition ⓘ simple dialogue systems ⓘ |
| basedOn | finite-state automaton ⓘ |
| canBeDeterministic | true ⓘ |
| canBeExtendedTo |
augmented transition network
ⓘ
recursive transition network ⓘ |
| canBeNondeterministic | true ⓘ |
| canBeVisualizedAs | state diagram ⓘ |
| captures | legal paths corresponding to grammatical structures ⓘ |
| edgeLabeledBy |
grammatical categories
ⓘ
input symbols ⓘ |
| formalizedIn | automata theory ⓘ |
| hasComponent |
accepting state
ⓘ
arcs ⓘ start state ⓘ states ⓘ |
| hasConstraint | processing is determined by current state and input symbol ⓘ |
| hasProperty |
finite number of states
ⓘ
finite number of transitions ⓘ |
| hasRepresentation | directed graph ⓘ |
| hasTypicalAlphabet |
part-of-speech tags
ⓘ
words ⓘ |
| influenced | later parsing formalisms in NLP ⓘ |
| models | finite-state grammar ⓘ |
| originatedIn | formal language theory ⓘ |
| relatedTo |
finite-state machine
ⓘ
regular grammar ⓘ state transition diagram ⓘ |
| represents |
sequences
ⓘ
strings over an alphabet ⓘ |
| supportsOperation |
path traversal
ⓘ
string recognition ⓘ |
| usedBy | early natural language parsers ⓘ |
| usedFor |
parsing natural language
ⓘ
recognizing grammatical sentences ⓘ syntactic analysis ⓘ |
| usedIn |
computational linguistics
ⓘ
language parsing systems ⓘ natural language processing ⓘ |
| usedToDefine | acceptance conditions for strings ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.