Penn Treebank

swMATH8023MaRDI QIDQ20038FDOQ20038

Author name not available (Why is that?)

Cited In (54)

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

This page was built for software: Penn Treebank