Pages that link to "Item:Q5674421"
From MaRDI portal
The following pages link to Transition network grammars for natural language analysis (Q5674421):
Displayed 22 items.
- Lexical ambiguity in tree adjoining grammars (Q909476) (← links)
- Knowledge-based dialogue for dynamic systems (Q916420) (← links)
- Deterministic finite automata with recursive calls and DPDAs (Q1014418) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- Interpreting a dynamic and uncertain world: task-based control (Q1128764) (← links)
- Research in machine translation (1970-1974) (Q1131845) (← links)
- Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks (Q1143818) (← links)
- The ECO family (Q1202626) (← links)
- Processing natural language with schema constraint networks (Q1203675) (← links)
- Artificial intelligence and automatic programming in CAI (Q1218287) (← links)
- Case systems for natural language (Q1220387) (← links)
- DATAPLAN: An interface generator for database semantics (Q1230648) (← links)
- Intercalation lemmas for tree transducer languages (Q1237574) (← links)
- Augmented transition networks and their relation to tree transducers (Q1238432) (← links)
- Conversational language comprehension using integrated pattern-matching and parsing (Q1240581) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Augmented transition networks as psychological models of sentence comprehension (Q2555830) (← links)
- Towards a Taxonomy for ECFG and RRPG Parsing (Q3618599) (← links)
- Querying databases with a domain-oriented natural language understanding system (Q3865525) (← links)
- Relevance of computer science to linguistics and vice versa (Q4055215) (← links)
- ARTIFICIAL INTELLIGENCE—A NEW DISCIPLINE IN THE COMPUTER SCIENCES (A VIEWPOINT) (Q4142722) (← links)
- A parsing method for montague grammars (Q4170266) (← links)