ACL RD-TEC 1.0 Summarization of P93-1018
Paper Title:
PARALLEL MULTIPLE CONTEXT-FREE GRAMMARS, FINITE-STATE TRANSLATION SYSTEMS, AND POLYNOMIAL-TIME RECOGNIZABLE SUBCLASSES OF LEXICAL-FUNCTIONAL GRAMMARS
PARALLEL MULTIPLE CONTEXT-FREE GRAMMARS, FINITE-STATE TRANSLATION SYSTEMS, AND POLYNOMIAL-TIME RECOGNIZABLE SUBCLASSES OF LEXICAL-FUNCTIONAL GRAMMARS
Authors: Hiroyuki Seki and Ryuichi Nakanishi and Yuichi Kaji and Sachiko Ando and Tadao Kasami
Primarily assigned technology terms:
Other assigned terms:
- alphabet
- case
- co-occurrence
- co-occurrence relation
- computational model
- computational models
- context-free grammar
- context-free grammars
- context-free language
- derivation
- derivation tree
- derivation trees
- empty string
- f-structure
- f-structures
- finite set
- formalism
- formalisms
- generative capacity
- grammar
- grammars
- information science
- leaf
- lemma
- lexical-functional grammars
- mapping
- meaning
- names
- natural language
- natural languages
- nonterminal
- nonterminals
- phrase
- polynomial time
- reflexive and transitive closure
- relation
- right-hand side
- root node
- schema
- sentence
- sentences
- sentential form
- subclass
- subtree
- surface structure
- symbol
- symbols
- syntax
- technology
- term
- terminals
- theorem
- transformational grammar
- transformational grammars
- transitive closure
- tree
- tree adjoining grammar
- tree adjoining grammars
- trees
- verb
- verb phrase
