홈 › Papers

Some Languages Seem Easier to Parse Because Their Treebanks Leak

Cross-language differences in (universal) dependency parsing performance are mostly attributed to treebank size, average sentence length, average dependency length, morphological complexity, and domain differences. We point at a factor not previously discussed: If we abstract away from words and dependency labels, how many graphs in the test data were seen in the training data? We compute graph isomorphisms, and show that, treebank size aside, overlap between training and test graphs explain more of the observed variation than standard explanations such as the above.

Code (0)

등록된 구현이 없습니다.

Tasks

Similar Papers 제목 키워드 기반