Tree Adjoining Grammar
E1315979
UNEXPLORED
Tree Adjoining Grammar is a highly structured formal grammar framework in computational linguistics used to model the syntax of natural languages with greater expressive power than context-free grammars.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Tree Adjoining Grammar canonical | 1 |
| Tree Adjoining Grammar formalism | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T18266742 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Tree Adjoining Grammar Context triple: [Aravind Joshi, knownFor, Tree Adjoining Grammar]
-
A.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
-
B.
Van Wijngaarden grammars
Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
-
C.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
D.
Lexical-Functional Grammar
Lexical-Functional Grammar is a non-transformational theory of syntax that models sentence structure through parallel levels of representation, emphasizing the relationship between grammatical functions and lexical information.
-
E.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Tree Adjoining Grammar Target entity description: Tree Adjoining Grammar is a highly structured formal grammar framework in computational linguistics used to model the syntax of natural languages with greater expressive power than context-free grammars.
-
A.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
-
B.
Van Wijngaarden grammars
Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
-
C.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
D.
Lexical-Functional Grammar
Lexical-Functional Grammar is a non-transformational theory of syntax that models sentence structure through parallel levels of representation, emphasizing the relationship between grammatical functions and lexical information.
-
E.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Tree Adjoining Grammar