Pith. Sign in

RECORD

Processing Unknown Words in HPSG

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Petra Barg, Markus Walther (University of Duesseldorf)

Computation and Language · Submitted 25 Sep 1998

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

The authors' main claim A worked-out example demonstrates the inferential capacity of our implemented system.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDcs/9809106 (version 1)
Pith IDMFTTAZLI, Pith's permanent record of this paper and its review
CitationMarkus Walther (University of Duesseldorf), Petra Barg. "Processing Unknown Words in HPSG." arXiv:cs/9809106 (1998). https://pith.science/paper/MFTTAZLI
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-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,488 input tokens, $0.0002 reported.

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

The abstract, sentence by sentence

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

The lexical acquisition system presented in this paper incrementally updates linguistic properties of unknown words inferred from their surrounding context by parsing sentences with an HPSG grammar for German. We employ a gradual, information-based concept of ``unknownness'' providing a uniform treatment for the range of completely known to maximally unknown lexical entries. ``Unknown'' information is viewed as revisable information, which is either generalizable or specializable. Updating takes place after parsing, which only requires a modified lexical lookup. Revisable pieces of information are identified by grammar-specified declarations which provide access paths into the parse feature structure. The updating mechanism revises the corresponding places in the lexical feature structures iff the context actually provides new information. For revising generalizable information, type union is required. A worked-out example demonstrates the inferential capacity of our implemented system.

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 The lexical acquisition system presented in this paper incrementally updates linguistic properties of unknown words inferred from their surrounding context by parsing sentences with an HPSG grammar for German. contribution 0.90 0.89 0.24 asserted 1.00
s1 We employ a gradual, information-based concept of ``unknownness'' providing a uniform treatment for the range of completely known to maximally unknown lexical entries. ``Unknown'' information is viewed as revisable information, which is either generalizable or specializable. method 0.63 0.79 0.11 asserted 1.00
s2 Updating takes place after parsing, which only requires a modified lexical lookup. method 0.99 0.61 0.07 asserted 1.00
s3 Revisable pieces of information are identified by grammar-specified declarations which provide access paths into the parse feature structure. method 1.00 0.76 0.05 asserted 1.00
s4 The updating mechanism revises the corresponding places in the lexical feature structures iff the context actually provides new information. method 0.99 0.71 0.12 asserted 1.00
s5 For revising generalizable information, type union is required. method 0.99 0.48 0.07 asserted 1.00
s6 A worked-out example demonstrates the inferential capacity of our implemented system. contribution 0.44 0.91 0.09 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.73.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
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

The lexical acquisition system presented in this paper incrementally updates linguistic properties of unknown words inferred from their surrounding context by parsing sentences with an HPSG grammar for German. We employ a gradual, information-based concept of ``unknownness'' providing a uniform treatment for the range of completely known to maximally unknown lexical entries. ``Unknown'' information is viewed as revisable information, which is either generalizable or specializable. Updating takes place after parsing, which only requires a modified lexical lookup. Revisable pieces of information are identified by grammar-specified declarations which provide access paths into the parse feature structure. The updating mechanism revises the corresponding places in the lexical feature structures iff the context actually provides new information. For revising generalizable information, type union is required. A worked-out example demonstrates the inferential capacity of our implemented system.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

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