Evidence map›Paper›PMID 37057055›Full record

ArticleApplied AI letters2021

Adapting natural language processing for technical text.

Alden Dima, Sarah Lukens, Melinda Hodkiewicz, Rachael Sexton, Michael P Brundage

Abstract read
In one paragraph

Article in Applied AI letters, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Keyphrase Extraction for Technical Language Processing.Journal of research of the National Institute of Standards and Technology · 2021
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Alden DimaInformation Technology Laboratory, National Institute of Standards and Technology, Maryland, USA.
Sarah LukensGE Digital, California, USA.
Melinda HodkiewiczFaculty of Engineering and Mathematical Sciences, The University of Western Australia, Western Australia, Australia.
Rachael SextonEngineering Laboratory, National Institute of Standards and Technology, Maryland, USA.
Michael P BrundageEngineering Laboratory, National Institute of Standards and Technology, Maryland, USA.

Funding

Intramural NIST DOC 9999-NIST
6 · The paper itself

Abstract

Despite recent dramatic successes, Natural Language Processing (NLP) is not ready to address a variety of real-world problems. Its reliance on large standard corpora, a training and evaluation paradigm that favors the learning of shallow heuristics, and large computational resource requirements, makes domain-specific application of even the most successful NLP techniques difficult. This paper proposes Technical Language Processing (TLP) which brings engineering principles and practices to NLP specifically for the purpose of extracting actionable information from language generated by experts in their technical tasks, systems, and processes. TLP envisages NLP as a socio-technical system rather than as an algorithmic pipeline. We describe how the TLP approach to meaning and generalization differs from that of NLP, how data quantity and quality can be addressed in engineering technical domains, and the potential risks of not adapting NLP for technical use cases. Engineering problems can benefit immensely from the inclusion of knowledge from unstructured data, currently unavailable due to issues with out of the box NLP packages. We illustrate the TLP approach by focusing on maintenance in industrial organizations as a case-study.

Indexed as

domain adaptationmaintenance recordsnatural language processingtechnical datatechnical language processing

Identifiers

PMID37057055
PMCPMC10091306

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.