Open AccessDetecting Ad Hoc Rules for Treebank Development
Author(s) -
Markus Dickinson
Publication year - 2011
Publication title -
linguistic issues in language technology
Language(s) - English
Resource type - Journals
eISSN - 1945-3590
pISSN - 1945-3604
DOI - 10.33011/lilt.v4i.1225
Subject(s) - treebank , computer science , natural language processing , artificial intelligence , rotation formalisms in three dimensions , parsing , rule based machine translation , set (abstract data type) , grammar , linguistics , programming language , mathematics , philosophy , geometry
We outline a method of detecting ad hoc, or anomalous, rules in treebank grammars, by exploiting the fact that such rules do not fit with the rest of the grammar. Ad hoc rules are rules used for specific constructions in one data set and unlikely to be used again. These include ungeneralizable rules, erroneous rules, rules for ungrammatical text, and rules which are not consistent with the rest of the annotation scheme. Based on the idea that valid rules should receive support from other rules in the grammar, we develop two methods for detecting ad hoc rules in flat treebanks and show they are successful in detecting such rules. Although one can put some linguistic knowledge into determining rule similarity and dissimilarity, the methods work best by using a simple, modified Levenshtein distance. We illustrate this on the English Wall Street Journal treebank and the German TIGER treebank. For the latter, we extend the method to formalisms incorporating discontinuous constituents, employing CFG-like rules for the comparisons.