Functional structures for parsing dependency constraints

Authors:
H. Jäppinen;A. Lehtola;K. Valkonen
Affiliations:
SITRA Foundation, Helsinki, Finland;SITRA Foundation, Helsinki, Finland;SITRA Foundation, Helsinki, Finland
Venue:
COLING '86 Proceedings of the 11th coference on Computational linguistics
Year:
1986

Citing 2
Cited 4

Language-based environment for natural language parsing

EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics

Parsing discontinuous constituents in dependency grammar

Computational Linguistics
Locally coverned trees and dependency parsing

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
The assignment of grammatical relations in natural language processing

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Blackboard-based dependency parsing

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper outlines a high-level language FUNDPL for expressing functional structures for parsing dependency constraints. The goal of the language is to allow a grammar writer to pinn down his or her grammar with minimal commitment to control. FUNDPL interpreter has been implemented on top of a lower-level language DPL which we have earlier implemented.