Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages

Esa Nelimarkka, Harri Jappinen, Aarno Lehtola


Anthology ID:
P84-1080
Volume:
10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics
Month:
July
Year:
1984
Address:
Stanford, California, USA
Venues:
ACL | COLING
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
389–392
Language:
URL:
https://aclanthology.org/P84-1080
DOI:
10.3115/980491.980571
Bibkey:
Cite (ACL):
Esa Nelimarkka, Harri Jappinen, and Aarno Lehtola. 1984. Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages. In 10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics, pages 389–392, Stanford, California, USA. Association for Computational Linguistics.
Cite (Informal):
Two-Way Finite Automata and Dependency Grammar: A Parsing Method for Inflectional Free Word Order Languages (Nelimarkka et al., ACL 1984)
Copy Citation:
PDF:
https://aclanthology.org/P84-1080.pdf