Pith. Sign in

RECORD

Expanding Abbreviations in a Strongly Inflected Language: Are Morphosyntactic Tags Sufficient?

Computation and Language · Submitted 20 Aug 2017

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Evidence is presented that the correct inflected form of an expanded abbreviation can in many cases be deduced solely from the morphosyntactic tags of the context.

how it is stated · asserted 0.86 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1708.05992 (version 2)
Pith IDVYUZXOSK, Pith's permanent record of this paper and its review
CitationPiotr \.Zelasko. "Expanding Abbreviations in a Strongly Inflected Language: Are Morphosyntactic Tags Sufficient?." arXiv:1708.05992 (2017). https://pith.science/paper/VYUZXOSK
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,974 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.93 · human participants 0.03 · controlled comparison 0.05 · randomized assignment 0.02 · states quantitative result 0.99 · compares with prior results 0.08 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

In this paper, the problem of recovery of morphological information lost in abbreviated forms is addressed with a focus on highly inflected languages. Evidence is presented that the correct inflected form of an expanded abbreviation can in many cases be deduced solely from the morphosyntactic tags of the context. The prediction model is a deep bidirectional LSTM network with tag embedding. The training and evaluation data are gathered by finding the words which could have been abbreviated and using their corresponding morphosyntactic tags as the labels, while the tags of the context words are used as the input features for classification. The network is trained on over 10 million words from the Polish Sejm Corpus and achieves 74.2% prediction accuracy on a smaller, but more general National Corpus of Polish. The analysis of errors suggests that performance in this task may improve if some prior knowledge about the abbreviated word is incorporated into the model.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 In this paper, the problem of recovery of morphological information lost in abbreviated forms is addressed with a focus on highly inflected languages. background 0.83 0.61 0.04 asserted 0.60
s1 Evidence is presented that the correct inflected form of an expanded abbreviation can in many cases be deduced solely from the morphosyntactic tags of the context. result 0.95 0.88 0.84 asserted 0.86
s2 The prediction model is a deep bidirectional LSTM network with tag embedding. method 1.00 0.84 0.04 asserted 1.00
s3 The training and evaluation data are gathered by finding the words which could have been abbreviated and using their corresponding morphosyntactic tags as the labels, while the tags of the context words are used as the input features for classification. method 1.00 0.93 0.03 asserted 0.99
s4 The network is trained on over 10 million words from the Polish Sejm Corpus and achieves 74.2% prediction accuracy on a smaller, but more general National Corpus of Polish. result 0.98 0.96 0.09 asserted 1.00
s5 The analysis of errors suggests that performance in this task may improve if some prior knowledge about the abbreviated word is incorporated into the model. future work 0.58 0.85 0.13 hedged possibility 1.00

What kind of paper the classifier reports this is: method or tool 0.72 · evidence from observation or experiment 0.59.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

In this paper, the problem of recovery of morphological information lost in abbreviated forms is addressed with a focus on highly inflected languages. Evidence is presented that the correct inflected form of an expanded abbreviation can in many cases be deduced solely from the morphosyntactic tags of the context. The prediction model is a deep bidirectional LSTM network with tag embedding. The training and evaluation data are gathered by finding the words which could have been abbreviated and using their corresponding morphosyntactic tags as the labels, while the tags of the context words are used as the input features for classification. The network is trained on over 10 million words from the Polish Sejm Corpus and achieves 74.2% prediction accuracy on a smaller, but more general National Corpus of Polish. The analysis of errors suggests that performance in this task may improve if some prior knowledge about the abbreviated word is incorporated into the model.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 1 sentence without a confident label

Uses the method or tool of 1 paper
  • The training was performed using the error backpropagation algorithm [ref] with cross-entropy criterion and Adam optimizer [ref] with the same settings of learning rate and momentum parameters as suggested in the paper.

    Adam: A Method for Stochastic Optimization · Experimental setup · 0.99

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.