login

Inducing constraint grammars

Lecture notes in computer sciencePublished 1 January 1996
Christer Samuelsson, Pasi Tapanainen, Atro Voutilainen
Citations26
SJR quartileQ2
SJR score0.35
SNIP0.55

TL;DR

A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3 % precision (1.12 tags/word) at 98.2 % recall.

Abstract

Constraint Grammar rules are induced from corpora. A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3 % precision (1.12 tags/word) at 98.2 % recall. The results compare favourably with other methods that are used for similar tasks although they are by no means as good as the results achieved using the original hand-written rules developed over several years time.

Keywords

Computer Science