A theory of learning from different domains — TEI-tagged view

Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, Jennifer Wortman Vaughan · 2009 · machine-learning · doi:10.1007/s10994-009-5152-4 · TEI xml · tagged edition · index · concepts · authors
Where this record's text came from. 2026-08-21 schema-0.3 pass: every quote verified as an exact substring of the staged text and anchored at merge time; concept terms verified present; every edge endpoint an existing node.
Some quotes on this page contain (cid:NN). The PDF this text was extracted from encodes 1 character in a way that names no letter, so the extractor could not say what they were. The quotes keep them because a quote is reproduced exactly or it proves nothing — the marks are the source’s, not the tagging’s.
Other fields define these differently the same word, defined another way in another discipline
adaptability 2 fields
Tags on this paper every tag the record carries, whether or not the words occur in the text below — a number is how many papers in the corpus carry that tag; a tag with no number is unique to this paper
H-divergence L1 divergence ideal joint hypothesis adaptability3 labeling function distribution divergence VC dimension source domain2 target domain2 hypothesis classes mathematical-proof27
Method, as described: a VC-style uniform convergence argument, with the domain distance defined as a supremum over the hypothesis class and computed by training a classifier to separate unlabeled source from unlabeled target instances

Our tag layer for this paper

Cross-disciplinary analysis
content-tags & facets: phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text
phenomenondomain adaptation - training where the labels are and deploying where they are not, with a theory whose usable half is the half that can be computed without labels— “For example, we might have a spam filter trained from a large email collection received by a group of current users (the source domain) and wish to adapt it for a new user (the target domain). Intuitively this should improve filtering performance for the new user, under the assumption that users generally agree on what is spam and what is…
claim-typemechanism— “The H-divergence resolves both problems associated with the L1 divergence. First, for hypothesis classes H of finite VC dimension, the H-divergence can be estimated from finite samples (see Lemma 1 below). Second, the H-divergence for any class H is never larger than the L1 divergence, and is in general smaller when H has finite VC…
method — evidence— “Our basic plan of attack will be as follows: Label each unlabeled source instance with 0 and unlabeled target instance as 1. Then train a classifier to discriminate between source and target instances. The H-divergence is immediately computable from the error.”
object of study — evidence— “We give a classifier-induced divergence measure that can be estimated from finite, unlabeled samples from the domains. Under the assumption that there exists some hypothesis that performs well in both domains, we show that this quantity together with the empirical source error characterize the target error of a source-trained…
research question — evidence— “We give a classifier-induced divergence measure that can be estimated from finite, unlabeled samples from the domains. Under the assumption that there exists some hypothesis that performs well in both domains, we show that this quantity together with the empirical source error characterize the target error of a source-trained…
contribution — evidence— “The H-divergence resolves both problems associated with the L1 divergence. First, for hypothesis classes H of finite VC dimension, the H-divergence can be estimated from finite samples (see Lemma 1 below). Second, the H-divergence for any class H is never larger than the L1 divergence, and is in general smaller when H has finite VC…
transferfrom database change detection: a divergence built for change detection in data streams, taken into statistical learning theory as the domain-distance term of a generalisation bound— “The H-divergence resolves both problems associated with the L1 divergence. First, for hypothesis classes H of finite VC dimension, the H-divergence can be estimated from finite samples (see Lemma 1 below). Second, the H-divergence for any class H is never larger than the L1 divergence, and is in general smaller when H has finite VC…transfers[0]
transferfrom statistical hypothesis testing: binary classification itself used as a measuring instrument - a discriminator trained to separate two unlabeled samples, with its error read as a distance— “Our basic plan of attack will be as follows: Label each unlabeled source instance with 0 and unlabeled target instance as 1. Then train a classifier to discriminate between source and target instances. The H-divergence is immediately computable from the error.”transfers[1]
mechanisma distance defined by the classifier you were going to use the L1 divergence takes a supremum over all measurable subsets and is rejected as unestimable and over-strict; the H-divergence takes it over the hypothesis class. So the distance between two FIXED distributions is a function of H - a richer class sees the domains as further apart, and the bound loosens because the model got more expressive rather than because the data moved— “Bounding the error in terms of the L1 divergence between distributions has two disadvantages. First, it cannot be accurately estimated from finite samples of arbitrary distributions (Batu et al. 2000; Kifer et al. 2004) and therefore has limited usefulness in practice. Second, for our purposes the L1 divergence is an overly strict measure…mechanisms[0]
mechanismmeasure the difference by trying to detect it label every unlabeled source instance 0 and every unlabeled target instance 1, train a classifier to tell them apart, and read the divergence off its error. If the domains are indistinguishable to H the divergence is zero. The measurement IS the adversary, which is why the whole domain-adversarial literature follows from this paragraph— “Our basic plan of attack will be as follows: Label each unlabeled source instance with 0 and unlabeled target instance as 1. Then train a classifier to discriminate between source and target instances. The H-divergence is immediately computable from the error.”mechanisms[1]
mechanismthe third term is the assumption target error is bounded by source error plus divergence plus lambda. The first two come from unlabeled data. Lambda is the error of the best joint hypothesis and needs labelled target data to evaluate - the thing the setting is defined by not having. THE BOUND IS USABLE EXACTLY WHEN ITS UNCHECKABLE TERM IS SMALL— “When the combined error of the ideal joint hypothesis is large, then there is no classifier that performs well on both the source and target domains, so we cannot hope to find a good target hypothesis by training only on the source domain.”mechanisms[2]
mechanismthe half of the difference that is assumed away two domains can differ in their labeling functions as well as in their input distributions. One clause - `since we expect the labeling function difference to be small in practice` - removes the first from the theory. Everything downstream measures distributional shift and inherits the assumption without restating it— “Since we expect the labeling function difference to be small in practice, we focus here on measuring distribution divergence, and especially on how to estimate it with finite samples of unlabeled data from DS and DT .”mechanisms[3]
mechanisman intractable quantity approximated by a surrogate computing the H-divergence needs the minimum-error hypothesis for the source-versus-target problem, which is intractable for most classes. What is used instead is the error of a hypothesis minimising a convex upper bound - so the reported divergence is an approximation of an approximation, and the paper says so— “Of course, minimizing error for most reasonable hypothesis classes is a computationally intractable problem. Nonetheless, as we shall see in Sect. 7, the error of hypotheses trained to minimize convex upper bounds on error are useful in approximating the H-divergence.”mechanisms[4]
critiques the use of L1 and Kullback-Leibler divergence in domain adaptation, on the grounds that neither can be accurately estimated from finite samples in a distribution-free setting— “In a distribution-free setting, we cannot obtain accurate estimates of common measures of divergence such as L1 or Kullback-Leibler from finite samples. Instead, we show that when learning a hypothesis from a class of finite complexity, it is sufficient to use a classifier-induced divergence”claim_relations[0]
extends Kifer et al. 2004's divergence for change detection, carried into a learning bound— “The H-divergence resolves both problems associated with the L1 divergence. First, for hypothesis classes H of finite VC dimension, the H-divergence can be estimated from finite samples (see Lemma 1 below). Second, the H-divergence for any class H is never larger than the L1 divergence, and is in general smaller when H has finite VC…claim_relations[1]
distinguishes-from Crammer et al. 2008, whose bound is less general and does not handle positive H-delta-H divergence or non-uniform weighting— “However, the bound of Crammer et al. (2008) is less general.”claim_relations[2]
qualifies its own bound, by stating that it is informative only when the ideal joint hypothesis has small error - a quantity the setting cannot supply— “When the combined error of the ideal joint hypothesis is large, then there is no classifier that performs well on both the source and target domains, so we cannot hope to find a good target hypothesis by training only on the source domain.”claim_relations[3]
sensedivergence between domains - AS L1: a supremum over all measurable subsets, which cannot be accurately estimated from finite samples and unnecessarily inflates the bound— “Bounding the error in terms of the L1 divergence between distributions has two disadvantages. First, it cannot be accurately estimated from finite samples of arbitrary distributions (Batu et al. 2000; Kifer et al. 2004) and therefore has limited usefulness in practice. Second, for our purposes the L1 divergence is an overly strict measure…senses[0]
sensedivergence between domains - AS H-DIVERGENCE: a supremum over the hypothesis class only, estimable from finite unlabeled samples and never larger than L1— “The H-divergence resolves both problems associated with the L1 divergence. First, for hypothesis classes H of finite VC dimension, the H-divergence can be estimated from finite samples (see Lemma 1 below). Second, the H-divergence for any class H is never larger than the L1 divergence, and is in general smaller when H has finite VC…senses[1]
sensethe domain difference - THE PART MEASURED: the divergence between the two marginal distributions— “Since we expect the labeling function difference to be small in practice, we focus here on measuring distribution divergence, and especially on how to estimate it with finite samples of unlabeled data from DS and DT .”senses[2]
sensethe domain difference - THE PART ASSUMED AWAY: the difference between the two labeling functions, expected to be small in practice and not measured— “Since we expect the labeling function difference to be small in practice, we focus here on measuring distribution divergence, and especially on how to estimate it with finite samples of unlabeled data from DS and DT .”senses[3]
senselambda - AS A TERM IN THE BOUND: the combined error of the hypothesis that minimises source plus target error— “The ideal joint hypothesis explicitly embodies our notion of adaptability. When this hypothesis…senses[4]
senselambda - AS AN ASSUMPTION: adaptability itself. If it is large there is no classifier good on both domains and no hope from source training; if small, the H-divergence carries the bound - and which of the two holds cannot be checked without labelled target data
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
senses[5]
controlthe H-divergence checked against the L1 divergence on both counts that matter - estimability from finite samples and tightness of the resulting bound — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
— rules out a new measure adopted for convenience - it is shown never to be larger than the one it replaces, so the bound cannot have been loosened to make it work
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[0]
controlthe bound's behaviour examined at both extremes of lambda rather than only where it is convenient — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
— rules out a bound that is quietly vacuous when adaptation is impossible - the paper states plainly that a large lambda means no classifier serves both domains
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[1]
controlthe intractability of computing the H-divergence stated, with the convex surrogate named as an approximation rather than presented as the quantity — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
— rules out a reported divergence being read as the defined one - the gap between them is declared at the point the substitution is made
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[2]
controlsource domains at varying distance compared against target-only training as labelled target data increases — failed
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
— rules out the claim that source data always helps - with enough target labels it never does, whatever its volume
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[3]
controlthe relation to Crammer et al. (2008) worked out, with the conditions under which the two measures coincide — absent-stated-about-other — rules out that the two divergence measures differ in the cases that matter - the conditions under which they coincide are what would settle it
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[4]
weightthe use of L1 and Kullback-Leibler divergence in domain adaptation, on the grounds that neither can be accurately estimated from finite samples in a distribution-free setting — 0.95
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
claim_relations[0]
weightKifer et al. 2004's divergence for change detection, carried into a learning bound — 0.9
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
claim_relations[1]
weightCrammer et al. 2008, whose bound is less general and does not handle positive H-delta-H divergence or non-uniform weighting — 0.9
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
claim_relations[2]
weightits own bound, by stating that it is informative only when the ideal joint hypothesis has small error - a quantity the setting cannot supply — 0.95
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
claim_relations[3]
differs in (stated by the tagger, no quotation)H-divergence —distinct-from→ L1 divergence — what set the supremum runs over, and therefore whether the distance can be estimatedconcept_edges[0]
relationH-divergence —distinct-from→ L1 divergence — the H-divergence is estimable from finite samples for classes of finite VC dimension and is never larger than the L1 divergence, because its supremum runs over the hypothesis class rather than over all measurable subsets
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concept_edges[0]
weightH-divergence —distinct-from→ L1 divergence — 0.95
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concept_edges[0]
auditlabeling function —distinct-from→ distribution divergence — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the span sets the labeling-function difference aside to focus on distribution divergence; distinct-from is loose.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concept_edges[2]
differs in (stated by the tagger, no quotation)labeling function —distinct-from→ distribution divergence — which of the two ways a domain can shift the theory actually measuresconcept_edges[2]
relationlabeling function —distinct-from→ distribution divergence — two domains can differ in their labeling functions or in their distributions; the labeling difference is expected to be small in practice and the paper measures the other one
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concept_edges[2]
weightlabeling function —distinct-from→ distribution divergence — 0.95
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concept_edges[2]
outcomecontrol — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[0]
outcomecontrol — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[1]
outcomecontrol — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[2]
outcomecontrol — failed
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[3]
outcome (stated by the tagger, no quotation)control — absent-stated-about-other
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[4]
limitationthe bound is only useful when the ideal joint hypothesis has small error, and that error cannot be estimated without labelled target data
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[0]
limitationthe difference between the two domains' labeling functions is assumed small rather than measured
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[1]
limitationminimising error to compute the H-divergence is computationally intractable for most hypothesis classes, so a convex surrogate is used
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[2]
limitationcommon divergences such as L1 and Kullback-Leibler cannot be accurately estimated from finite samples in a distribution-free setting
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[3]
limitationwith enough labelled target data the source data is never preferred, no matter how much of it there is - the method's value is bounded by target-label scarcity
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[4]
limitationthe practical recommendation holds only given a reasonable measure of complexity
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[5]
Content tags
content-observations: finding · quantity · variable · definition · key-term — grounded in the full text
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[0]
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[1]
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[2]
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[3]
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[4]
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[5]
finding
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[6]
variabledistribution divergence
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.variables[0]
variablelabeling function
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.variables[1]
definitionH-divergence
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.definitions[0]
definitionadaptability
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.definitions[1]
Concepts
terms this paper carries, each with the sentence it was cut from — the layer that joins one paper to another. Terms with no quote yet are on CONCEPTS.html.
conceptH-divergence — not defined in this paper's own words; the distance between two distributions as seen by a hypothesis class - a supremum over H rather than over all measurable sets, so the distance between two fixed domains changes when H does
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[0]
conceptL1 divergence — not defined in this paper's own words; the classical distance, rejected here because it cannot be estimated from finite samples of arbitrary distributions and inflates the bound
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[1]
conceptideal joint hypothesis — not defined in this paper's own words; the hypothesis minimising combined source and target error; its error is the bound's third term and the one term that cannot be estimated without labelled target data
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[2]
conceptadaptability — not defined in this paper's own words; what the ideal joint hypothesis explicitly embodies - whether ANY single classifier could serve both domains, which is prior to any question about a particular one
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[3]
conceptlabeling function — not defined in this paper's own words; the second way two domains can differ; its difference is expected to be small in practice and is not measured, so the theory covers the distributional half
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[4]
conceptdistribution divergence — not defined in this paper's own words; the half of the domain difference the paper measures, chosen because the other half is assumed small
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[5]
conceptVC dimension — not defined in this paper's own words; the finiteness that makes the H-divergence estimable at all - the whole construction rests on the hypothesis class being simple enough to converge
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[6]
conceptsource domain — not defined in this paper's own words; where the labels are - in the paper's own example, the mail of a group of current users
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[7]
concepttarget domain — not defined in this paper's own words; where the classifier must work and where labels are scarce or absent - one new user, receiving a unique distribution of email
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[8]
concepthypothesis classes — not defined in this paper's own words; the set the learner searches; minimising error over most of them is computationally intractable, so the divergence is approximated by convex surrogates
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[9]
Statistics — cross-field join keys
field-invariant statistical terms, used in their statistical sense (gated on a number / symbol / test). A p-value or a standard deviation means the SAME thing in physics, biology, psychology and sociology — so these are the strongest cross-field join keys. Grounded verbatim.
VC dimension
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.statistics[0]

When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote for that row; on this page it is withheld with the article, and the article is at its publisher. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.

Tag layer © the Meta-Tagging Project, CC BY 4.0. The paper text is © its authors/publisher and is linked, not reproduced. Excerpts shown are short quotations for identification and verification. · back to index · concepts · authors · עברית
© 2026 Shir Sivroni · ORCID 0009-0000-2597-2824