QuickUMLS is a tool for fast, unsupervised biomedical concept extraction from medical text
Project description
[NOTE: This is an updated fork of QuickUMLS for usage in medspacy to accelerate recent developments from the medspacy team to incorporate QuickUMLS into spacy pipelines.]
Release Note
From version 3.1, we start to isolate the unqlite dependency with our pre-compiled version medspacy-unqlite, because compiling from source code can be troublesome in certain environments especially on Government Furnished Equipments. Also, multiple spaCy versions are included in the continuous integration tests.
NEW: v.1.4 supports starting multiple QuickUMLS matchers concurrently! I've finally added support for unqlite as an alternative database for storage of CUIs and Semantic Types (see here for more details). unqlite-backed QuickUMLS installation support multiple matchers running at the same time. Other than better multi-processing support, unqlite should have better support for unicode.
QuickUMLS
QuickUMLS (Soldaini and Goharian, 2016) is a tool for fast, unsupervised biomedical concept extraction from medical text. It takes advantage of Simstring (Okazaki and Tsujii, 2010) for approximate string matching. For more details on how QuickUMLS works, we remand to our paper.
This project should be compatible with Python 3 (Python 2 is no longer supported) and run on any UNIX system (support for Windows is experimental, please report bugs!). If you find any bugs, please file an issue on GitHub or email the author at luca@ir.cs.georgetown.edu.
Installation
- Obtain a UMLS installation This tool requires you to have a valid UMLS installation on disk. To install UMLS, you must first obtain a license from the National Library of Medicine; then you should download all UMLS files from this page; finally, you can install UMLS using the MetamorphoSys tool as explained in this guide. The installation can be removed once the system has been initialized.
- Install QuickUMLS: You can do so by either running
pip install medspacy-quickumls
orpython setup.py install
. On macOS, using anaconda is strongly recommended†. - Create a QuickUMLS installation Initialize the system by running
python -m quickumls.install <umls_installation_path> <destination_path>
, where<umls_installation_path>
is where the installation files are (in particular, we needMRCONSO.RRF
andMRSTY.RRF
) and<destination_path>
is the directory where the QuickUmls data files should be installed. This process will take between 5 and 30 minutes depending how fast the CPU and the drive where UMLS and QuickUMLS files are stored are (on a system with a Intel i7 6700K CPU and a 7200 RPM hard drive, initialization takes 8.5 minutes).python -m quickumls.install
supports the following optional arguments:-L
/--lowercase
: if used, all concept terms are folded to lowercase before being processed. This option typically increases recall, but it might reduce precision;-U
/--normalize-unicode
: if used, expressions with non-ASCII characters are converted to the closest combination of ASCII characters.-E
/--language
: Specify the language to consider for UMLS concepts; by default, English is used. For a complete list of languages, please see this table provided by NLM.-d
/--database-backend
: Specify which database backend to use for QuickUMLS. The current option isunqlite
, but it may be expanded in the future. This backend supports multi-process reading and has better unicode compatibility, and it used as default.
APIs
A QuickUMLS object can be instantiated as follows:
from quickumls import QuickUMLS
matcher = QuickUMLS(quickumls_fp, overlapping_criteria, threshold,
similarity_name, window, accepted_semtypes)
Where:
quickumls_fp
is the directory where the QuickUMLS data files are installed.overlapping_criteria
(optional, default: "score") is the criteria used to deal with overlapping concepts; choose "score" if the matching score of the concepts should be consider first, "length" if the longest should be considered first instead.threshold
(optional, default: 0.7) is the minimum similarity value between strings.similarity_name
(optional, default: "jaccard") is the name of similarity to use. Choose between "dice", "jaccard", "cosine", or "overlap".window
(optional, default: 5) is the maximum number of tokens to consider for matching.accepted_semtypes
(optional, default: seeconstants.py
) is the set of UMLS semantic types concepts should belong to. Semantic types are identified by the letter "T" followed by three numbers (e.g., "T131", which identifies the type "Hazardous or Poisonous Substance"). See here for the full list.
To use the matcher, simply call
text = "The ulna has dislocated posteriorly from the trochlea of the humerus."
matcher.match(text, best_match=True, ignore_syntax=False)
Set best_match
to False
if you want to return overlapping candidates, ignore_syntax
to True
to disable all heuristics introduced in (Soldaini and Goharian, 2016).
If the matcher throws a warning during initialization, read this page to learn why and how to stop it from doing so.
spaCy pipeline component
QuickUMLS can be used for standalone processing but it can also be use as a component in a modular spaCy pipeline. This follows traditional spaCy handling of concepts to be entity objects added to the Document object. These entity objects contain the CUI, similarity score and Semantic Types in the spacy "underscore" object. Note that this implementation follows a known spacy convention that entity Spans cannot overlap on a single token. To prevent token overlap, matches are ranked according to the overlapping_criteria
supplied so that overlap of any tokens will be prioritized by this order.
Adding QuickUMLS as a component in a pipeline can be done as follows:
from quickumls.spacy_component import SpacyQuickUMLS
# common English pipeline
nlp = spacy.load('en_core_web_sm')
quickumls_component = SpacyQuickUMLS(nlp, 'PATH_TO_QUICKUMLS_DATA')
nlp.add_pipe(quickumls_component)
doc = nlp('Pt c/o shortness of breath, chest pain, nausea, vomiting, diarrrhea')
for ent in doc.ents:
print('Entity text : {}'.format(ent.text))
print('Label (UMLS CUI) : {}'.format(ent.label_))
print('Similarity : {}'.format(ent._.similarity))
print('Semtypes : {}'.format(ent._.semtypes))
Server / Client Support
Starting with v.1.2, QuickUMLS includes a support for being used in a client-server configuration. That is, you can start one QuickUMLS server, and query it from multiple scripts using a client.
To start the server, run python -m quickumls.server
:
python -m quickumls.server /path/to/quickumls/files {-P QuickUMLS port} {-H QuickUMLS host} {QuickUMLS options}
Host and port are optional; by default, QuickUMLS runs on localhost:4645
. You can also pass any QuickUMLS option mentioned above to the server. To obtain a list of options for the server, run python -m quickumls.server -h
.
To load the client, import get_quickumls_client
from quickumls
:
from quickumls import get_quickumls_client
matcher = get_quickumls_client()
text = "The ulna has dislocated posteriorly from the trochlea of the humerus."
matcher.match(text, best_match=True, ignore_syntax=False)
The API of the client is the same of a QuickUMLS object.
In case you wish to run the server in the background, you can do so as follows:
nohup python -m quickumls.server /path/to/QuickUMLS {server options} > /dev/null 2>&1 & echo $! > nohup.pid
When you are done, don't forget to stop the server by running.
kill -9 `cat nohup.pid`
rm nohup.pid
References
- Okazaki, Naoaki, and Jun'ichi Tsujii. "Simple and efficient algorithm for approximate dictionary matching." COLING 2010.
- Luca Soldaini and Nazli Goharian. "QuickUMLS: a fast, unsupervised approach for medical concept extraction." MedIR Workshop, SIGIR 2016.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file medspacy_quickumls-3.2.tar.gz
.
File metadata
- Download URL: medspacy_quickumls-3.2.tar.gz
- Upload date:
- Size: 69.9 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/5.0.0 CPython/3.8.16
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | eeea4c94f4e46529470b9de894bac3384fe883f843d321cd578a62f880439165 |
|
MD5 | 182f33bd95b63e7bc97565bb861dc657 |
|
BLAKE2b-256 | 91a62fbf9b7dd475a4797f636f6bec2af0077f1c6ae4c27ca667858cb6fd5ad5 |