Constructive Type-Logical Supertagging with Self-Attention Networks
We propose a novel application of self-attention networks towards grammar induction. We present an attention-based supertagger for a refined type-logical grammar, trained on constructing types inductively. In addition to achieving a high overall type accuracy, our model is able to learn the syntax of the grammar's type system along with its denotational semantics. This lifts the closed world assumption commonly made by lexicalized grammar supertaggers, greatly enhancing its generalization potential. This is evidenced both by its adequate accuracy over sparse word types and its ability to correctly construct complex types never seen during training, which, to the best of our knowledge, was as of yet unaccomplished.
Code (1)
Tasks
Vocal Bursts Type PredictionSimilar Papers 제목 키워드 기반
Geometry-Aware Supertagging with Heterogeneous Dynamic Convolutions
The syntactic categories of categorial grammar formalisms are structured units made of smaller, indivisible primitives, bound together by the underlying grammar's category formation rules. In the trending approach of con…
CCG SupertaggingSupertagging the Long Tail with Tree-Structured Decoding of Complex Categories
Although current CCG supertaggers achieve high accuracy on the standard WSJ test set, few systems make use of the categories' internal structure that will drive the syntactic derivation during parsing. The tagset is trad…
Structured PredictionTAGSupertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networks
Supertagging is conventionally regarded as an important task for combinatory categorial grammar (CCG) parsing, where effective modeling of contextual information is highly important to this task. However, existing studie…
CCG SupertaggingA Dynamic Window Neural Network for CCG Supertagging
Combinatory Category Grammar (CCG) supertagging is a task to assign lexical categories to each word in a sentence. Almost all previous methods use fixed context window sizes as input features. However, it is obvious that…
CCG SupertaggingSentenceWord EmbeddingsITE: A Lightweight Implementation of Stratified Reasoning for Constructive Logical Operators
Constraint Programming (CP) is a powerful declarative programming paradigm where inference and search are interleaved to find feasible and optimal solutions to various type of constraint systems. However, handling logica…
Negation