Transition network grammars for natural language analysis
From MaRDI portal
Publication:5674421
DOI10.1145/355598.362773zbMath0258.68037OpenAlexW2035032881WikidataQ56575247 ScholiaQ56575247MaRDI QIDQ5674421
Publication date: 1970
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355598.362773
Related Items (24)
Characteristics of graph languages generated by edge replacement ⋮ Applications of Weighted Automata in Natural Language Processing ⋮ 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 ⋮ Lexical ambiguity in tree adjoining grammars ⋮ Relevance of computer science to linguistics and vice versa ⋮ Knowledge-based dialogue for dynamic systems ⋮ Matrix Code ⋮ The ECO family ⋮ Processing natural language with schema constraint networks ⋮ Artificial intelligence and automatic programming in CAI ⋮ Case systems for natural language ⋮ ARTIFICIAL INTELLIGENCE—A NEW DISCIPLINE IN THE COMPUTER SCIENCES (A VIEWPOINT) ⋮ DATAPLAN: An interface generator for database semantics ⋮ Querying databases with a domain-oriented natural language understanding system ⋮ Intercalation lemmas for tree transducer languages ⋮ Augmented transition networks and their relation to tree transducers ⋮ Conversational language comprehension using integrated pattern-matching and parsing ⋮ A parsing method for montague grammars ⋮ Towards a Taxonomy for ECFG and RRPG Parsing ⋮ Deterministic finite automata with recursive calls and DPDAs ⋮ Augmented transition networks as psychological models of sentence comprehension ⋮ Theory of formal grammars
This page was built for publication: Transition network grammars for natural language analysis
