Penn Treebank
From MaRDI portal
Cited in
(only showing first 100 items - show all)- BoolQ
- NeuroX
- SQuARE
- A neurocomputational approach to prepositional phrase attachment ambiguity resolution
- CoQA
- HellaSwag
- Eigenwords: spectral word embeddings
- Probabilistic parse selection based on semantic co-occurences
- scientific article; zbMATH DE number 1946855 (Why is no real title available?)
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
- EGC: entropy-based gradient compression for distributed deep learning
- Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
- Database of grammatical sentences of Croatian language
- On the unsupervised analysis of domain-specific Chinese texts
- Gated Orthogonal Recurrent Units: On Learning to Forget
- Graph Neural Networks for Natural Language Processing: A Survey
- scientific article; zbMATH DE number 2098058 (Why is no real title available?)
- \(\mathrm{AD}^3\): alternating directions dual decomposition for MAP inference in graphical models
- scientific article; zbMATH DE number 1949710 (Why is no real title available?)
- scientific article; zbMATH DE number 1952699 (Why is no real title available?)
- Querying linguistic trees
- Neural Character-Level Syntactic Parsing for Chinese
- scientific article; zbMATH DE number 7455707 (Why is no real title available?)
- WinoGrande
- Many-valued logics in the Iberian peninsula
- From discourse analysis to argumentation schemes and back: relations and differences
- CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
- Survey: finite-state technology in natural language processing
- Learning to parse natural language with maximum entropy models
- scientific article; zbMATH DE number 5070289 (Why is no real title available?)
- A framework for step-wise explaining how to solve constraint satisfaction problems
- Automatic ambiguity resolution in natural language processing. An empirical approach
- Backward and forward bisimulation minimization of tree automata
- ASER: towards large-scale commonsense knowledge acquisition via higher-order selectional preference over eventualities
- Distributed block-diagonal approximation methods for regularized empirical risk minimization
- Exploiting meta features for dependency parsing and part-of-speech tagging
- Analogies between sentences: theoretical aspects -- preliminary experiments
- Training parsers by inverse reinforcement learning
- Cutting-plane training of structural SVMs
- Extending the coverage of a CCG system
- Fast support vector machines for convolution tree kernels
- Querying linguistic treebanks with monadic second-order logic in linear time
- Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
- MASS
- scientific article; zbMATH DE number 1953131 (Why is no real title available?)
- Discriminative reranking for natural language parsing
- dot
- NLTK
- OpenFst
- Tiburon
- SeqLog
- WordNet
- SVMstruct
- CCGbank
- MBT
- Stanford Tagger
- SVMTool
- TnT
- TreeTagger
- SRILM
- XMLTK
- pystruct
- DRAGON
- Snowball
- TopWORDS
- WordSpy
- QUB
- BabelNet
- ILPME
- UniParse
- Senseval
- IDPDraw
- Megatron-LM
- SQuAD
- Pylearn2
- GENIA corpus
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- LR parsing for LCFRS
- Transformer-XL
- TopicRNN
- Clockwork RNN
- MCTest
- Zoneout
- IllinoisSL
- BioCaster
- Probabilistic parsing using left corner language models
- Okapi
- FastGRNN
- RandAugment
- Event2Mind
- SemSUM
- scientific article; zbMATH DE number 1952687 (Why is no real title available?)
- Unsupervised and few-shot parsing from pretrained language models
- Natural language tagging with genetic algorithms
- Head-driven statistical models for natural language parsing
- VerbNet
- ASER
- CoCoLM
- DISCOS
- DADA
This page was built for software: Penn Treebank
