Maximal Parse Accuracy?: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:2003:20, 24 December 2023SatoshiNakamoto talk contribs 2,283 bytes +2,283 Created page with "Title: Maximal Parse Accuracy? Authors: Rens Bod Abstract: This research aims to find the minimal set of fragments that achieves maximal parse accuracy in Data Oriented Parsing. The study uses the Penn Wall Street Journal treebank and investigates several strategies for constraining the set of subtrees. The results show that an upper bound of the number of words in the subtree frontiers and an upper bound on the depth of unlexicalized subtrees do not decrease the parse..."