Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars

Hiroyuki Seki, Ryuichi Nakanishi, Yuichi Kaji, Sachiko Ando, Tadao Kasami


Anthology ID:
P93-1018
Volume:
31st Annual Meeting of the Association for Computational Linguistics
Month:
June
Year:
1993
Address:
Columbus, Ohio, USA
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
130–139
Language:
URL:
https://aclanthology.org/P93-1018
DOI:
10.3115/981574.981592
Bibkey:
Cite (ACL):
Hiroyuki Seki, Ryuichi Nakanishi, Yuichi Kaji, Sachiko Ando, and Tadao Kasami. 1993. Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars. In 31st Annual Meeting of the Association for Computational Linguistics, pages 130–139, Columbus, Ohio, USA. Association for Computational Linguistics.
Cite (Informal):
Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars (Seki et al., ACL 1993)
Copy Citation:
PDF:
https://aclanthology.org/P93-1018.pdf