D-Net
/
openaire-graph-docs
6
1
Fork 5
Code Issues 5 Pull Requests 2 Packages Projects Releases 69 Wiki Activity

[Orcid Enrichment] fixing typos

This commit is contained in:
Miriam Baglioni 2024-07-26 12:29:22 +02:00
parent f187b1aafb
commit 891c66a9db
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
docs/graph-production-workflow/enrichment-by-pid/orcid-enrichment.md
View File

@ -72,7 +72,7 @@ Then the *Exact reverse fullname match* strategy is applied on the graph and orc
- Orcid List: James Carl Miller-Jones, Kong Albert - Orcid List: James Carl Miller-Jones, Kong Albert
The process is similar to step one, but the ORCID fullname is constructed by reversing the order of given name and family name. The process is similar to step one, but the ORCID fullname is constructed by reversing the order of given name and family name.
This step accomodates variation in name formatting. As before if an exact match is found, the ORCID identifier is used to update the metadata of the This step accommodates variation in name formatting. As before if an exact match is found, the ORCID identifier is used to update the metadata of the
graph author, and the ORCID author is removed from the list for subsequent comparisons. With this strategy we can find a match for graph author, and the ORCID author is removed from the list for subsequent comparisons. With this strategy we can find a match for
Albert Kong. Albert Kong.
@ -84,7 +84,7 @@ The tokens from the two lists are pairwise compared. The outcome of each compari
- Short Match: A short match happens when both tokens begin with the same character, but one token consists solely of that character. - Short Match: A short match happens when both tokens begin with the same character, but one token consists solely of that character.
- Long Match: Exact correspondence between the two compared words - Long Match: Exact correspondence between the two compared words
When a no match is encountered due to different initial characters the starting character, the algorithm proceeds When a no match is encountered due to different initial characters, the algorithm proceeds
to compare the next token in the list with the lexicographically lower preceding token. This allows to be tolerant with missing to compare the next token in the list with the lexicographically lower preceding token. This allows to be tolerant with missing
words in one of the two names. words in one of the two names.
@ -104,7 +104,7 @@ Let us consider directly the names that can be matched by this strategy:
graph name = James C. A. Miller-Jones graph name = James C. A. Miller-Jones
orcid name = Carl James Miller-Jones orcid name = Carl James Miller-Jones
So the two names are broken down into individual words or token that sorted alphabetically to standardize the comparison process. So the two names are broken down into individual words or token and sorted alphabetically to standardize the comparison process.
graph = A C James Miller-Jones graph = A C James Miller-Jones
orcid = Carl James Miller-Jones orcid = Carl James Miller-Jones
@ -130,5 +130,5 @@ Example:
graph = Mario Enrico Rossi, Mario Rossi graph = Mario Enrico Rossi, Mario Rossi
ORCID = Mario Rossi ORCID = Mario Rossi
As you can see applying only the third strategy, we would associate Mario Rossi's ORCID to Mario Fabrizio Rossi if this one would have been first in teh author list. As you can see applying only the third strategy, we would associate Mario Rossi's ORCID to Mario Fabrizio Rossi if this one was first in the author list.