Transition network grammars for natural language analysis
From MaRDI portal
Cited in
(25)- Deterministic finite automata with recursive calls and DPDAs
- Characteristics of graph languages generated by edge replacement
- Interpreting a dynamic and uncertain world: task-based control
- Research in machine translation (1970-1974)
- Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
- The ECO family
- Processing natural language with schema constraint networks
- Artificial intelligence and automatic programming in CAI
- Case systems for natural language
- DATAPLAN: An interface generator for database semantics
- Intercalation lemmas for tree transducer languages
- Augmented transition networks and their relation to tree transducers
- Conversational language comprehension using integrated pattern-matching and parsing
- Theory of formal grammars
- Matrix Code
- Augmented transition networks as psychological models of sentence comprehension
- Towards a Taxonomy for ECFG and RRPG Parsing
- Querying databases with a domain-oriented natural language understanding system
- Relevance of computer science to linguistics and vice versa
- ARTIFICIAL INTELLIGENCE—A NEW DISCIPLINE IN THE COMPUTER SCIENCES (A VIEWPOINT)
- A parsing method for montague grammars
- Applications of weighted automata in natural language processing
- Visibly recursive automata
- Lexical ambiguity in tree adjoining grammars
- Knowledge-based dialogue for dynamic systems
This page was built for publication: Transition network grammars for natural language analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5674421)
