Pith. sign in

REVIEW 3 major objections 5 minor 53 references

Increasing the Accessibility of Causal Domain Knowledge via Causal Information Extraction Methods: A Case Study in the Semiconductor Manufacturing Industry

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Pith's one-line read A multi-stage sequence tagging pipeline extracts causal relations from semiconductor FMEA documents at 93% F1, making industrial causal knowledge machine-readable.

desk verdict A competent, honest applied case study whose 'practical suitability' claim outruns the evidence because the metrics are token-level, not relation-level. read the letter →

arxiv 2411.10172 v1 pith:RX2FIDON submitted 2024-11-15 cs.CL cs.AI

classification cs.CLcs.AI
keywords causalinformationextractionsequencetaggingFMEAsemiconductormanufacturingpresentationslidesdomain-specificlanguagemodelsinter-annotatoragreementindustrialNLP
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks whether automated causal information extraction can make the causal knowledge locked in industrial documents machine-readable, and tests it on real semiconductor manufacturing records. It proposes two sequence-tagging approaches: a single-stage multi-label tagger and a multi-stage pipeline that finds causal trigger words first and then identifies the causes and effects attached to each trigger. On FMEA table cells the multi-stage method reaches a mean macro F1 of 93%, which the authors argue is suitable for practical use; on presentation slides it reaches 73%. The authors also show that starting from a materials-aware language model and fine-tuning it on in-domain text, especially with pointwise mutual information masking, tends to improve extraction. A sympathetic reader would take the central claim to be that a previously lab-proposed pipeline transfers to real industrial documents, with the caveat that full relations are only extracted when an explicit causal trigger is present.

What carries the argument

The load-bearing mechanism is the MST cascade: a binary token classifier detects causal triggers (words like "due to" or "leads to"), a grouping classifier merges tokens belonging to the same interrupted trigger, an attention network aggregates the trigger's token embeddings, and a final multi-label classifier assigns each token as cause or effect relative to that trigger. Because cause/effect detection is conditioned per trigger, the same token can be cause for one relation and effect for another, which is how enchained relations are captured. The pipeline runs on BERT-style embeddings, and the paper compares BERT with MatBERT, with and without in-domain masked-language-model fine-tuning under uniform and PMI masking. Annotation follows the paper's own guidelines defining cause, effect, and trigger, with explicit-trigger-only, nested/chained/disrupted entity rules.

What would settle it

Take a random sample of the 495 FMEA texts, have a third expert annotate them with the same guidelines, adjudicate every disagreement with the original annotators, and recompute macro F1 for the best MST configuration; if the adjudicated F1 falls well below 93%, the practical-suitability claim fails.

Watch

Extended reading notes

Core claim

The central discovery, stated on the paper's own terms, is that the multi-stage sequence tagging (MST) method — detect trigger tokens, group tokens into trigger entities, aggregate trigger embeddings, then label cause and effect tokens for each trigger — extracts causal relations from FMEA documents at a mean macro F1 of 93% (MatBERT with PMI masking) and from presentation slides at 73%. This makes MST, originally developed for historical texts, the stronger of the two evaluated methods for industrial use: it handles enchained relations, nested relations, and disrupted entities, which plain single-stage tagging cannot. The same experiments show that swapping the general BERT base model for MatBERT, a model pretrained on materials-science text, and then fine-tuning in-domain, improves results in most configurations. The paper presents these results as a case study demonstrating practical applicability for semi-structured FMEA documents in particular.

Load-bearing premise

The evaluation treats the two annotators' aggregated labels as the correct gold standard, even though the guidelines are new and disagreements are kept as parallel annotations rather than resolved, so if those labels are biased the F1 scores overstate how well the method extracts true causal relations.

Editorial extensions

If this is right

  • FMEA cells containing several merged causal relations can be automatically split into separate cause–effect pairs, feeding a more connected knowledge graph.
  • Practitioners with similar semi-structured quality documents have a concrete recipe: a domain-aligned pretrained model, in-domain fine-tuning, and the MST tagging cascade.
  • Presentation slides remain harder: extraction at 73% F1 is useful for triage but not full automation, and OCR plus explicit-trigger constraints lose visual and implicit causal information.
  • The annotation guidelines provide a starting template for other industrial domains, with triggers proving easier to annotate consistently than causes and effects.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the 93% figure holds under adjudicated gold labels, the same MST recipe should transfer to adjacent semi-structured documents such as 8D reports, CAPA records, or equipment maintenance logs, where cause–effect entries are similarly cell-structured.
  • The gap between trigger agreement and effect agreement suggests that part of the model's remaining error on effect boundaries may be inherited from annotation subjectivity; a reconciled gold standard would separate label noise from model error.
  • The explicit-trigger constraint means the method is best framed as a recall-limited structure extractor rather than a full causal reader, since implicit causal language is invisible to it.
  • A natural extension is to use the annotation guidelines as prompts for instruction-tuned language models, which the paper mentions as future potential; if those models can also resolve coreference across cells, inter-cell relations would become accessible.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper presents a case study in which two sequence-tagging approaches — a single-stage sequence tagger (SST) and a multi-stage sequence tagger (MST) adapted from a co-author's master's thesis — are used to extract explicit causal relations (cause, trigger, effect triples) from industrial documents in the semiconductor manufacturing domain. The authors introduce annotation guidelines, use them to label 495 FMEA texts and 440 presentation-slide texts (plus 481 additional slide texts annotated by one expert), and report inter-annotator agreement, per-component token-level F1 scores, and results for different BERT-based language models with and without domain-specific fine-tuning using two masking strategies (UM and PMI). The headline result is a macro-averaged token-level F1 of 93% for MST on FMEA texts and 73% on slides, leading to the claim that the MST method is 'suitable for practical applications.'

Significance. If the reported performance is trustworthy, the paper contributes a useful industrial application report: it demonstrates that existing causal IE machinery can be transferred to a private industrial corpus with relatively high token-level F1, and it provides annotation guidelines plus an empirical study of domain-adaptive pre-training for this setting. The inter-annotator agreement analysis is a positive feature, as is the use of five-fold cross-validation with standard deviations. However, the central 'practical suitability' claim rests on token-level component F1 scores rather than on an evaluation of the final causal relation triples, and no external baseline is included; both aspects limit the significance of the findings as an advance in causal information extraction. The lack of public data is understandable but makes a stringent in-paper evaluation all the more important.

major comments (3)
  1. [Abstract, Section 3.4, Table 2] The headline '93% F1 score' is a token-level macro-averaged F1 over individual label classes (Cause, Effect, Trigger) and trigger-grouping, not an evaluation of the complete causal relation extraction output. The MST pipeline is cascaded: trigger detection, trigger grouping, and argument detection are measured separately, and no relation-level precision/recall, exact-match, or head-matching metric is reported. A token can be tagged correctly while the trigger-grouping or argument-assignment step yields an incorrect cause-trigger-effect triple. Thus the abstract's and Conclusion's claim that MST is 'suitable for practical applications' is not supported by the reported measurements. I request an end-to-end evaluation of the extracted triples, at minimum a relation-level F1 with exact argument span matching (or a well-defined partial matching scheme), together with the test-set size and the label distribution.
  2. [Section 1 (Research Questions) and Section 4] The first research question, 'How effective are existing causal information extraction methods on different types of industrial documents?', is not answered because no existing causal IE method is implemented or evaluated as a baseline. The paper compares only the proposed SST and the MST method adapted from Gärber (2022), both of which are sequence-tagging variants in the same family. Adding an external baseline (for example, a published span-based or pattern-based system, or a standard generative extraction model) would contextualize the absolute F1 values and substantiate the claim that the authors are 'extending causal information extraction methods to industrial documents.'
  3. [Section 4 (Annotation Aggregation)] The aggregation rule states that 'when there is a disagreement between the annotators, the annotations are aggregated,' meaning both conflicting annotations are kept as parallel gold labels. Since the two annotators are both NLP experts rather than domain experts, and since the guidelines are introduced in this paper, the resulting gold standard may contain substantial label noise. The paper does not report the proportion of disagreed instances in the test set, nor does it analyze performance on agreed versus disagreed items. This makes it difficult to interpret the reported F1 scores as estimates of extraction quality on a reliable gold standard. I ask the authors to report disagreement statistics and to discuss or quantify the impact of the aggregation rule on the reported numbers.
minor comments (5)
  1. [Section 3.3] In the description of the MST argument-detection step, 'devices them as an input to a multi-class calcification' contains two typos: 'devices' should be 'uses' and 'calcification' should be 'classification'.
  2. [Figure 2 caption] The caption begins with 'Automated Causal Information Extraction from T ext' — 'T ext' should be 'Text'.
  3. [Tables 1 and 2] Several formatting inconsistencies appear: 'T able' in Table 1's caption, inconsistent spacing in values such as '82 ± 4' versus '82±4', and incomplete alignment of the 'F 1%' header. These should be corrected for readability.
  4. [Section 3.4] The text says 'we executed a performance evaluation of each component of the MST pipeline,' but the description of the evaluation does not specify the exact evaluation unit (e.g., is the token-level F1 computed with BIO tagging or a simpler token classification scheme?) or how the SST and MST outputs are converted to the labels in Table 2. A few sentences clarifying the evaluation protocol would strengthen reproducibility.
  5. [Introduction and Section 3.1] The contribution mentions addressing 'data consistency issues commonly found in semi structured documents, like the merged cells in FMEA,' but the evaluation does not explicitly measure how well the proposed pipeline handles merged-cell texts. The paper should either include a specific analysis of such texts or soften this contribution claim.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the reported F1 scores are measured on a held-out test set, not derived from the method's own definitions or fitted inputs.

full rationale

The paper's central claim (MST achieves 93% F1 on FMEA text) is an empirical measurement reported in Table 2 on a held-out test set, with models trained across five folds and early stopping on validation folds. The MST architecture is attributed to Garber (2022), a co-author's thesis, but the paper does not use that citation to justify the performance number; the performance is measured on newly annotated industrial data. The annotation guidelines define the target schema (cause, trigger, effect), and the aggregation rule merges annotator labels, but these are inputs to a supervised training/evaluation pipeline, not quantities that are later renamed as predictions. No equation in the paper reduces a predicted quantity to a fitted constant, and no test-set label is used to set a parameter and then reported as a prediction. The minor self-citations (Garber 2022 for MST; Razouk and Kern 2022 and Razouk et al. 2023 for cell-level FMEA text extraction; Tosone 2022 for the in-domain fine-tuning data and pipeline) are provenance for components, not load-bearing evidence for the empirical outcome. Concerns that the 93% figure is token-level rather than end-to-end relation-level, or that the dual-annotator gold standard may be noisy, are correctness and validity risks, not circularity: they do not make the reported F1 equal to the input by construction. Accordingly, no circular step is identified.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central claim rests on four domain assumptions: explicit-only causality, text-unit granularity, OCR fidelity, and gold-standard correctness. There is one unstated free-parameter group (training hyperparameters). No new physical or conceptual entities are introduced. The paper's contribution is an empirical application, not a derivation, so the axiom load is moderate but all assumptions are domain-specific and reasonable for a case study.

free parameters (1)
  • Model hyperparameters for fine-tuning = Not reported
    Learning rate, batch size, optimizer, and number of epochs are chosen by hand and not disclosed. These affect the reported F1 scores and make independent replication difficult.
assumptions (4)
  • domain assumption Only explicit causal relations with a trigger are in scope
    Annotation guideline 7 in Section 3.2 excludes implicit causal relations, so the reported F1 only measures explicit, trigger-marked causality.
  • domain assumption One FMEA cell or one OCR text box is the atomic text unit
    Guideline 1 in Section 3.2 restricts annotation to a single cell or text box, ignoring causal relations across cells or boxes, which is a significant limitation for slides.
  • domain assumption OCR text extraction preserves the causal content of presentation slides
    The method uses OCR in Section 3.1, and the limitations section acknowledges that visual elements such as arrows and color encoding are lost. The slide results depend on this assumption.
  • domain assumption The aggregated annotator labels are a correct gold standard
    Section 4 states that disagreements are retained as parallel annotations rather than adjudicated. The F1 scores are computed against this private gold standard, so its correctness is load-bearing.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Increasing the Accessibility of Causal Domain Knowledge via Causal Information Extraction Methods: A Case Study in the Semiconductor Manufacturing Industry." pith.science (2026). https://pith.science/paper/RX2FIDON

@misc{pith2026241110172,
  author       = {Pith},
  title        = {Pith review of: Increasing the Accessibility of Causal Domain Knowledge via Causal Information Extraction Methods: A Case Study in the Semiconductor Manufacturing Industry},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RX2FIDON}},
  note         = {Machine review of arXiv:2411.10172}
}
read the original abstract

The extraction of causal information from textual data is crucial in the industry for identifying and mitigating potential failures, enhancing process efficiency, prompting quality improvements, and addressing various operational challenges. This paper presents a study on the development of automated methods for causal information extraction from actual industrial documents in the semiconductor manufacturing industry. The study proposes two types of causal information extraction methods, single-stage sequence tagging (SST) and multi-stage sequence tagging (MST), and evaluates their performance using existing documents from a semiconductor manufacturing company, including presentation slides and FMEA (Failure Mode and Effects Analysis) documents. The study also investigates the effect of representation learning on downstream tasks. The presented case study showcases that the proposed MST methods for extracting causal information from industrial documents are suitable for practical applications, especially for semi structured documents such as FMEAs, with a 93\% F1 score. Additionally, MST achieves a 73\% F1 score on texts extracted from presentation slides. Finally, the study highlights the importance of choosing a language model that is more aligned with the domain and in-domain fine-tuning.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

53 extracted references · 36 canonical work pages

  1. [1]

    write newline

    " write newline " cite write " FUNCTION editor.postfix editor num.names #1 > "( )" "( )" if FUNCTION editor.trans.postfix editor num.names #1 > "( )" "( )" if FUNCTION trans.postfix translator num.names #1 > "( )" "( )" if FUNCTION authors.editors.reflist.apa5 'field := 'dot := field num.names 'numnames := numnames 'format.num.names := format.num.names na...

  2. [2]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year eprint archive archivePrefix primaryClass adsurl adsnote version label INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.sta...

  3. [3]

    write newline

    " write newline "" before.all 'output.state := FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap duplicate "7" = swap duplicate "8" = swap "9" = or or or or or or or or or FUNCTION n.separate 't := "" #0 'numnames := t empty not t #-1 #1 subs...

  4. [4]

    , Bell , D.A

    bchapter Anand , S.S. , Bell , D.A. , Hughes , J.G. : The role of domain knowledge in data mining . In: Proceedings of the Fourth International Conference on Information and Knowledge Management , pp. 37 -- 43 ( 1995 ) bchapter

  5. [5]

    , Moens , M.-F

    barticle Akkasi , A. , Moens , M.-F. : Causal relationship extraction from biomedical text using deep neural models: A comprehensive survey . Journal of biomedical informatics 119 , 103820 ( 2021 ) barticle

  6. [6]

    , Zhang , S

    barticle Aerts , W. , Zhang , S. : Management’s causal reasoning on performance and earnings management . European Management Journal 32 ( 5 ), 770 -- 783 ( 2014 ) barticle

  7. [7]

    , Chang , M.-W

    botherref Devlin , J. , Chang , M.-W. , Lee , K. , Toutanova , K. : Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018) botherref

  8. [8]

    , Levin , L

    bchapter Dunietz , J. , Levin , L. , Carbonell , J. : Annotating causal language using corpus lexicography of constructions . In: Proceedings of the 9th Linguistic Annotation Workshop , pp. 188 -- 196 . Association for Computational Linguistics , Denver, Colorado, USA ( 2015 ). 10.3115/v1/W15-1622 . https://aclanthology.org/W15-1622 bchapter

Show all 53 references
  1. [9]

    , Levin , L

    bchapter Dunietz , J. , Levin , L. , Carbonell , J. : The BEC au SE corpus 2.0: Annotating causality and overlapping relations . In: Proceedings of the 11th Linguistic Annotation Workshop , pp. 95 -- 104 . Association for Computational Linguistics , Valencia, Spain ( 2017 ). 1...

  2. [10]

    , Chen , V.Z

    botherref Gopalakrishnan , S. , Chen , V.Z. , Dou , W. , Hahn-Powell , G. , Nedunuri , S. , Zadrozny , W. : Text to causal knowledge graph: A framework to synthesize knowledge from unstructured business texts into causal graphs. Information 14(7) (2023) 10.3390/info14070367 botherref

  3. [11]

    : Automatic detection of causal relations for question answering

    bchapter Girju , R. : Automatic detection of causal relations for question answering . In: Proceedings of the ACL 2003 Workshop on Multilingual Summarization and Question Answering , pp. 76 -- 83 ( 2003 ) bchapter

  4. [12]

    , Zhang , K

    barticle Glymour , C. , Zhang , K. , Spirtes , P. : Review of causal discovery methods based on graphical models . Frontiers in genetics 10 , 524 ( 2019 ) barticle

  5. [13]

    : Causal Relationship Extraction from Historical Texts using BERT

    botherref Gärber , D. : Causal Relationship Extraction from Historical Texts using BERT . Master's thesis, Graz University of Technology (2022) botherref

  6. [14]

    , Nanba , H

    bchapter Hayama , T. , Nanba , H. , Kunifuji , S. : Structure extraction from presentation slide information . In: PRICAI 2008: Trends in Artificial Intelligence: 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15-19, 2008. Procee...

  7. [15]

    , Zhang , X

    barticle Hu , Y. , Zhang , X. , Ngai , E. , Cai , R. , Liu , M. : Software project risk analysis using bayesian networks with causality constraints . Decision Support Systems 56 , 439 -- 449 ( 2013 ) barticle

  8. [16]

    , Li , R

    botherref Kong , M. , Li , R. , Wang , J. , Li , X. , Jin , S. , Xie , W. , Hou , M. , Cao , C. : Cftnet: A robust credit card fraud detection model enhanced by counterfactual data augmentation. Available at SSRN 4516310 botherref

  9. [17]

    , Ramnani , R

    botherref Khetan , V. , Ramnani , R. , Anand , M. , Sengupta , S. , Fano , A.E. : Causal bert: Language models for causality detection between events expressed in text. arXiv preprint arXiv:2012.05453 (2020) botherref

  10. [18]

    , Rizvi , M.I.H

    botherref Khetan , V. , Rizvi , M.I.H. , Huber , J. , Bartusiak , P. , Sacaleanu , B. , Fano , A. : Mimicause: Representation and automatic extraction of causal relation types from clinical notes. arXiv preprint arXiv:2110.07090 (2021) botherref

  11. [19]

    , Lenz , B

    botherref Levine , Y. , Lenz , B. , Lieber , O. , Abend , O. , Leyton-Brown , K. , Tennenholtz , M. , Shoham , Y. : Pmi-masking: Principled masking of correlated spans. arXiv preprint arXiv:2010.01825 (2020) botherref

  12. [20]

    , Pham , L.H

    bchapter Lee , J. , Pham , L.H. , Uzuner , O. : Mnlp at fincausal2022: Nested ner with a generative model . In: Proceedings of the 4th Financial Narrative Processing Workshop@ LREC2022 , pp. 135 -- 138 ( 2022 ) bchapter

  13. [21]

    , Salhofer , E

    botherref Liu , X.L. , Salhofer , E. , Andreu , A.S. , Kern , R. : S2orc-semicause: Annotating and analysing causality in the semiconductor domain, (2022) botherref

  14. [22]

    , Yoon , W

    barticle Lee , J. , Yoon , W. , Kim , S. , Kim , D. , Kim , S. , So , C.H. , Kang , J. : Biobert: a pre-trained biomedical language representation model for biomedical text mining . Bioinformatics 36 ( 4 ), 1234 -- 1240 ( 2020 ) barticle

  15. [23]

    , Abi Akl , H

    bchapter Mariko , D. , Abi Akl , H. , Trottier , K. , El-Haj , M. : The financial causality extraction shared task (fincausal 2022) . In: Proceedings of the 4th Financial Narrative Processing Workshop@ LREC2022 , pp. 105 -- 107 ( 2022 ) bchapter

  16. [24]

    GitHub (2021) botherref

    botherref Mindee : docTR: Document Text Recognition. GitHub (2021) botherref

  17. [25]

    , Labidurie , E

    botherref Mariko , D. , Labidurie , E. , Ozturk , Y. , Akl , H.A. , Mazancourt , H. : Data processing and annotation schemes for fincausal shared task. CoRR abs/2012.02498 (2020) https://arxiv.org/abs/2012.02498 2012.02498 botherref

  18. [26]

    , Pavuri , A

    barticle Negi , K. , Pavuri , A. , Patel , L. , Jain , C. : A novel method for drug-adverse event extraction using machine learning . Informatics in Medicine Unlocked 17 , 100190 ( 2019 ) barticle

  19. [27]

    , Seong , N

    barticle Nam , K. , Seong , N. : Financial news-based stock movement prediction using causality analysis of influence in the korean stock market . Decision Support Systems 117 , 100 -- 112 ( 2019 ) barticle

  20. [28]

    , Girju , R

    bchapter Riaz , M. , Girju , R. : Another look at causality: Discovering scenario-specific contingency relationships with no supervision . In: 2010 IEEE Fourth International Conference on Semantic Computing , pp. 361 -- 368 ( 2010 ). IEEE bchapter

  21. [29]

    , Grover , S

    bchapter Richie , R. , Grover , S. , Tsui , F.R. : Inter-annotator agreement is not the ceiling of machine learning performance: Evidence from a comprehensive set of simulations . In: Proceedings of the 21st Workshop on Biomedical Language Processing , pp. 275 -- 284 ( 2022 ) bchapter

  22. [30]

    , Kern , R

    barticle Razouk , H. , Kern , R. : Improving the consistency of the failure mode effect analysis (fmea) documents in semiconductor manufacturing . Applied Sciences 12 ( 4 ), 1840 ( 2022 ) barticle

  23. [31]

    , Liu , X.L

    barticle Razouk , H. , Liu , X.L. , Kern , R. : Improving fmea comprehensibility via common-sense knowledge graph completion techniques . IEEE Access 11 , 127974 -- 127986 ( 2023 ) 10.1109/ACCESS.2023.3331585 barticle

  24. [32]

    , Mero \ n o-Pe \ n uela , A

    bchapter Reklos , I. , Mero \ n o-Pe \ n uela , A. : Medicause: Causal relation modelling and extraction from medical publications . In: Proceedings of the 1st International Workshop on Knowledge Graph Generation From Text Co-located with 19th Extended Semantic Conference (ESW...

  25. [33]

    , Riedel , T

    bchapter Ravivanpong , P. , Riedel , T. , Stock , P. : Towards extracting causal graph structures from tradedata and smart financial portfolio risk management. In: EDBT/ICDT Workshops ( 2022 ) bchapter

  26. [34]

    , Burmer , C

    bchapter Safont-Andreu , A. , Burmer , C. , Schekotihin , K. : Using ontologies in failure analysis . In: ISTFA 2021 , pp. 23 -- 28 ( 2021 ). ASM International bchapter

  27. [35]

    , Hoi , S.C

    bchapter Saha , A. , Hoi , S.C. : Mining root cause knowledge from cloud service incident investigations for aiops . In: Proceedings of the 44th International Conference on Software Engineering: Software Engineering in Practice , pp. 197 -- 206 ( 2022 ) bchapter

  28. [36]

    , Jo , S.-H

    bchapter Seol , J.-W. , Jo , S.-H. , Yi , W. , Choi , J. , Lee , K.-S. : A problem-action relation extraction based on causality patterns of clinical events in discharge summaries . In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowl...

  29. [37]

    , Ni , J

    bchapter Saha , A. , Ni , J. , Hassanzadeh , O. , Gittens , A. , Srinivas , K. , Yener , B. : Spock at fincausal 2022: Causal information extraction using span-based and sequence tagging models . In: Proceedings of the 4th Financial Narrative Processing Workshop@ LREC2022 , pp...

  30. [38]

    , Pyysalo , S

    bchapter Stenetorp , P. , Pyysalo , S. , Topi\' c , G. , Ohta , T. , Ananiadou , S. , Tsujii , J. : brat : a web-based tool for NLP -assisted text annotation . In: Proceedings of the Demonstrations Session at EACL 2012 . Association for Computational Linguistics , Avignon, Fra...

  31. [39]

    : Improving fmea consistency in semiconductor manufacturing through text classification

    botherref Tosone , D. : Improving fmea consistency in semiconductor manufacturing through text classification. Master's thesis, University of Udine, Alpen-Adria-Universität Klagenfurt (2022) botherref

  32. [40]

    , Xiong , J.J

    barticle Tang , Y. , Xiong , J.J. , Luo , Y. , Zhang , Y.-C. : How do the global stock markets influence one another? evidence from finance big data and granger causality directed network . International Journal of Electronic Commerce 23 ( 1 ), 85 -- 109 ( 2019 ) barticle

  33. [41]

    , Trewartha , A

    botherref Walker , N. , Trewartha , A. , Huo , H. , Lee , S. , Cruse , K. , Dagdelen , J. , Dunn , A. , Persson , K. , Ceder , G. , Jain , A. : The impact of domain-specific pre-training on named entity recognition tasks in materials science. Available at SSRN 3950755 (2021) botherref

  34. [42]

    , Yu , L.-C

    barticle Wu , J.-L. , Yu , L.-C. , Chang , P.-C. : Detecting causality from online psychiatric texts using inter-sentential language patterns . BMC medical informatics and decision making 12 , 1 -- 10 ( 2012 ) barticle

  35. [43]

    , Chen , K

    botherref Yuan , X. , Chen , K. , Zuo , W. , Zhang , Y. : Tc-gat: Graph attention network for temporal causality discovery. arXiv preprint arXiv:2304.10706 (2023) botherref

  36. [44]

    , Han , S.C

    barticle Yang , J. , Han , S.C. , Poon , J. : A survey on extraction of causal relations from natural language text . Knowledge and Information Systems 64 ( 5 ), 1161 -- 1186 ( 2022 ) barticle

  37. [45]

    , " * write output.state after.block = add.period write newline

    ENTRY address archive author booktitle chapter doi edition editor eid eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year archivePrefix primaryClass adsurl adsnote version label extra.labe...

  38. [46]

    write newline

    " write newline "" before.all 'output.state := FUNCTION add.period duplicate empty 'skip "." * add.blank if FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap dupl...

  39. [47]

    write newline

    " write newline "" before.all 'output.state := FUNCTION output.doi doi empty skip "doi:" doi * "" * output if FUNCTION format.archive archivePrefix empty "" archivePrefix ":" * if FUNCTION format.primaryClass primaryClass empty "" " [" primaryClass * "] " * if FUNCTION format....

  40. [48]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTI...

  41. [49]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTI...

  42. [50]

    , " * write output.state after.block = add.period write newline

    ENTRY address archive author booktitle chapter edition editor eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url doi volume year archivePrefix primaryClass eid adsurl adsnote version label INTEGERS o...

  43. [51]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  44. [52]

    Available from:

    ENTRY address assignee author booktitle chapter cartographer day edition editor howpublished institution inventor journal key keywords month note number organization pages part publisher school series title type volume word year eprint doi url lastchecked updated archive archi...

  45. [53]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.