What do we need to know about an unknown word when parsing German
We propose a new type of subword embedding designed to provide more information about unknown compounds, a major source for OOV words in German. We present an extrinsic evaluation where we use the compound embeddings as input to a neural dependency parser and compare the results to the ones obtained with other types of embeddings. Our evaluation shows that adding compound embeddings yields a significant improvement of 2{\%} LAS over using word embeddings when no POS information is available. When adding POS embeddings to the input, however, the effect levels out. This suggests that it is not the missing information about the semantics of the unknown words that causes problems for parsing German, but the lack of morphological information for unknown words. To augment our evaluation, we also test the new embeddings in a language modelling task that requires both syntactic and semantic information.
Code (0)
등록된 구현이 없습니다.
Tasks
Language ModellingPOSWord EmbeddingsSimilar Papers 제목 키워드 기반
What is a word?
In order to design strong paradigms for isolating lexical access and semantics, we need to know what a word is. Surprisingly few linguists and philosophers have a clear model of what a word is, even though words impact b…
Experimental DesignAgainst Adversarial Learning: Naturally Distinguish Known and Unknown in Open Set Domain Adaptation
Open set domain adaptation refers to the scenario that the target domain contains categories that do not exist in the source domain. It is a more common situation in the reality compared with the typical closed set domai…
Domain AdaptationUse of a genetic algorithm to find solutions to introductory physics problems
In this work, we show how a genetic algorithm (GA) can be used to find step-by-step solutions to introductory physics problems. Our perspective is that the underlying task for this is one of finding a sequence of equatio…
Unsupervised Learning of Entailment-Vector Word Embeddings
Entailment vectors are a principled way to encode in a vector what information is known and what is unknown. They are designed to model relations where one vector should include all the information in another vector, ca…
Word EmbeddingsTackling small eigen-gaps: Fine-grained eigenvector estimation and inference under heteroscedastic noise
This paper aims to address two fundamental challenges arising in eigenvector estimation and inference for a low-rank matrix from noisy observations: (1) how to estimate an unknown eigenvector when the eigen-gap (i.e. the…
Uncertainty Quantification