Penn Treebank
From MaRDI portal
Software:20038
No author found.
Related Items (54)
Unsupervised and few-shot parsing from pretrained language models ⋮ Graph Neural Networks for Natural Language Processing: A Survey ⋮ Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming ⋮ Backward and forward bisimulation minimization of tree automata ⋮ Natural language tagging with genetic algorithms ⋮ Analogies between sentences: theoretical aspects -- preliminary experiments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ ASER: towards large-scale commonsense knowledge acquisition via higher-order selectional preference over eventualities ⋮ A Neurocomputational Approach to Prepositional Phrase Attachment Ambiguity Resolution ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Head-Driven Statistical Models for Natural Language Parsing ⋮ Discriminative Reranking for Natural Language Parsing ⋮ CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank ⋮ Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploiting meta features for dependency parsing and part-of-speech tagging ⋮ On the unsupervised analysis of domain-specific Chinese texts ⋮ Towards incremental parsing of natural language using recursive neural networks ⋮ Fast support vector machines for convolution tree kernels ⋮ Unnamed Item ⋮ Many-Valued Logics in the Iberian Peninsula ⋮ Cutting-plane training of structural SVMs ⋮ Training parsers by inverse reinforcement learning ⋮ Multi-domain learning by confidence-weighted parameter combination ⋮ Unnamed Item ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ LR parsing for LCFRS ⋮ A framework for step-wise explaining how to solve constraint satisfaction problems ⋮ Gated Orthogonal Recurrent Units: On Learning to Forget ⋮ Unnamed Item ⋮ Smoothing and compression with stochastic \(k\)-testable tree languages ⋮ Unnamed Item ⋮ Extending the coverage of a CCG system ⋮ Querying linguistic treebanks with monadic second-order logic in linear time ⋮ Querying linguistic trees ⋮ 10.1162/153244302320884579 ⋮ Unnamed Item ⋮ Automatic ambiguity resolution in natural language processing. An empirical approach ⋮ Unnamed Item ⋮ EGC: entropy-based gradient compression for distributed deep learning ⋮ Unnamed Item ⋮ A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata ⋮ Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy ⋮ Learning to parse natural language with maximum entropy models ⋮ Distributed block-diagonal approximation methods for regularized empirical risk minimization ⋮ From Discourse Analysis to Argumentation Schemes and Back: Relations and Differences ⋮ Neural Character-Level Syntactic Parsing for Chinese ⋮ Survey: finite-state technology in natural language processing
This page was built for software: Penn Treebank
