Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Penn Treebank"”.

  1. Building representations from natural language

    … are common in the Wall Street Journal from the Penn Treebank, providing a counterpoint for the many other sorts of analyses of the Penn Treebank in other work. Then, I turn to recognized experts in provoking our imaginations with words, using my system to examine the work of four great authors …

    mit Repository record for Building representations from natural language (opens in a new tab)

  2. Parsing with sparse annotated resources

    … quantity of coarse CFG annotations from the Penn Treebank. While the trees annotated in all of the target formalisms share a similar basic syntactic structure with the Penn Treebank CFG, they also encode additional constraints and semantic features. To handle this apparent difference, we …

    mit Repository record for Parsing with sparse annotated resources (opens in a new tab)

  3. Higher Order Recurrent Neural Network for Language Modeling

    … task using two popular data sets, namely the Penn Treebank (PTB) and English text8 data sets. Experimental results have shown that the proposed HORNNs yield the state-of-the-art performance on both data sets, significantly outperforming the regular RNNs as well as the popular LSTMs.

    york Repository record for Higher Order Recurrent Neural Network for Language Modeling (opens in a new tab)

  4. Neural attentions for natural language understanding and modeling

    … AWD-LSTM model by reducing 2 perplexities on the Penn Treebank and Wikitext-2 data sets, and achieved new state-of-the-art performance on the Wikitext-103 data set with 17.4 perplexity. For language understanding tasks, we propose the use of a self-attention CNN for video question answering. The …

    mit Repository record for Neural attentions for natural language understanding and modeling (opens in a new tab)

  5. Adapting ADTrees for Improved Performance on Large Datasets with High Arity Features

    The ADtree, a data structure useful for caching sufficient statistics, has been successfully adapted to grow lazily when memory is limited and to update sequentially with an incrementally updated dataset. However, even these modified forms of the ADtree still exhibit inefficiencies in terms of both …

    byu Repository record for Adapting ADTrees for Improved Performance on Large Datasets with High Arity Features (opens in a new tab)