1. Penn Treebank

    0 Comments Leave a Comment

    1-15 of 65 1 2 3 4 5 »
    1. Mentioned In 65 Articles

    2. FASTSUBS: An Efficient Admissible Algorithm for Finding the Most Likely Lexical Substitutes Using a Statistical Language Model. (arXiv:1205.5407v1 [cs.CL])

      ...asible. For example, it is possible to compute the top 10 substitutes for each one of the 1,173,766 tokens in Penn Treebank in about 6 hours on a typical workstation. The same task would take about 6 days with the naive ...
      Read Full Article
      Mentions: Penn Treebank WSJ
    3. 1-15 of 65 1 2 3 4 5 »
  1. Categories

    1. Default:

      Discourse, Entailment, Machine Translation, NER, Parsing, Segmentation, Semantic, Sentiment, Summarization, WSD