Declarative model for dependency parsing: a view into blackboard methodology

Authors:
K. Valkonen;H. Jäppinen;A. Lehtola;M. Ylilammi
Affiliations:
KIELIKONE-project, SITRA Foundation, Helsinki, Finland;KIELIKONE-project, SITRA Foundation, Helsinki, Finland;KIELIKONE-project, SITRA Foundation, Helsinki, Finland;KIELIKONE-project, SITRA Foundation, Helsinki, Finland
Venue:
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Year:
1987

Citing 5
Cited 1

Building expert systems

Building expert systems
Associative model of morphological analysis: an empirical inquiry

Computational Linguistics
The blackboard model of problem solving

AI Magazine
Language-based environment for natural language parsing

EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Language As a Cognitive Process: Syntax

Language As a Cognitive Process: Syntax

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 presents a declarative, dependency constraint model for parsing an inflectional free word order language, like Finnish. The structure of Finnish sentences is described as partial dependency trees of depth one. Parsing becomes a nondeterministic search problem in the forest of partial parse trees. The search process is able to solve also ambiguities and long-distance dependencies. Parsing is controlled by a blackboard system. A working parser for Finnish has been implemented based on the model.