IP Library Granted Patent US 12,288,038
Granted Patent B2
US 12,288,038 · App. 17/728,460 · Granted Apr 29, 2025

Matching service requester with service providers

Inventors: Robert Etches (Vejle, DK); Jaromir Dzialo (Cracow, PL)
Assignee: IQVIA Inc.
G06F40/51G06F18/22G06F40/279G06F40/47G06F40/58
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,288,038
App. No.
17/728,460
Granted
Apr 29, 2025
Kind
B2
Abstract

Systems, methods, devices, and non-transitory, computer-readable storage media are disclosed for matching a service requester with a service provider via a taxonomy based directed graph. The method includes: receiving a keyword associated with a service; accessing a directed graph including a root node and nodes connected by edges, each node having a title; identifying a second node of the directed graph for each of service providers, each second node having a title matching a skill of a respective service provider; determining a distance between the first node and each second node along the directed graph; and ranking the service providers based at least in part on the distance between the first node and each second node. Systems, methods, devices, and non-transitory, computer-readable storage media are further disclosed for determining and storing a quality score for the revised linguistic content.

Claims (31)

1. A method comprising:

receiving, by one or more processors, a linguistic document comprising a keyword associated with a translation service;

identifying, by the one or more processors, a first node of a directed graph, the directed graph including a root node and nodes connected by edges, each node having a title,

wherein the directed graph includes semantic paths, each semantic path being from the root node to a node having a title that at least partially matches the keyword, and

wherein the first node has a title matching the keyword associated with the translation service;

identifying, by the one or more processors, a second node of the directed graph for each of a plurality of service providers, each second node having a title matching a skill of a respective service provider,

wherein each second node is connected to a third node of the directed graph, the third node having a title indicating an identification (ID) of the respective service provider, and wherein the third node is connected to the second node corresponding to the respective service provider by an edge having a title indicating a language pair for the translation service;

determining, by the one or more processors, a distance between the first node and each second node along a particular semantic path in the directed graph, wherein the distance indicates a number of nodes connected by edges between the first node and each second node along the particular semantic path;

ranking, by the one or more processors, the plurality of service providers based at least in part on the distance between the first node and each second node;

performing, by the one or more processors, a machine translation of the linguistic document using a machine translation engine to generate a translated linguistic document; and

providing, by the one or more processors, the translated linguistic document to a particular service provider for enhancement, the particular service provider having been selected based on the ranking.

2. The method of claim 1 , comprising generating the directed graph.

3. The method of claim 2 , wherein generating the directed graph comprises:

in a main directed graph that includes a main root node and main nodes connected by main edges, identifying one or more of the main nodes that each has a title that at least partially matches the keyword;

determining a distance along the main directed graph from the main root node to each of the identified main nodes;

selecting one or more of the identified main nodes based on the distance from the main root node to each identified main node; and

generating the directed graph, wherein the selected main nodes are a plurality of nodes of the directed graph, each of the plurality of nodes having a title that at least partially matches the keyword.

4. The method of claim 3 , comprising selecting a predefined number of the identified main nodes.

5. The method of claim 3 , comprising generating the main directed graph based on a hierarchical classification of skills.

6. The method of claim 3 , comprising updating the main directed graph based on an update to a hierarchical classification of skills.

7. The method of claim 3 , comprising:

identifying the one or more of the main nodes using regular expressions.

8. The method of claim 1 , comprising ranking the plurality of service providers based at least in part on an indication of a capability of each service provider to provide the translation service from a first language to a second language.

9. The method of claim 1 , comprising ranking the plurality of service providers based in part on a quality metric for each service provider.

10. The method of claim 9 , comprising determining the quality metric for each service provider, wherein the quality metric for each service provider is based on a record for the service provider that is stored in a blockchain.

11. The method of claim 1 , further comprising anonymizing or redacting the linguistic document prior to performing the machine translation using the machine translation engine.

12. The method of claim 1 , wherein at least some of the plurality of service providers are linguistic content enhancers.

13. A system, comprising:

at least one processor; and

a memory storing instructions thereon that, when executed by the at least one processor, cause the at least one processor to perform the method of claim 1 .

14. A non-transitory, computer-readable storage medium having instructions stored thereon, that when executed by at least one processor, cause the at least one processor to perform the method of claim 1 .

Assignments (8)
SECURITY INTEREST Recorded Mar 12, 2026
From: IMS SOFTWARE SERVICES LTD.; IQVIA INC.; IQVIA RDS INC.; RULES-BASED MEDICINE, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 075047/0061 →
SECURITY INTEREST Recorded Jan 12, 2026
From: IQVIA INC.; RULES-BASED MEDICINE INC.
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 073436/0513 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 4, 2025
From: ETCHES, ROBERT; DZIALO, JAROMIR
To: EXFLUENCY GMBH
Reel/Frame 070396/0273 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 4, 2025
From: EXFLUENCY GMBH
To: IQVIA INC.
Reel/Frame 070396/0444 →
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTIES INADVERTENTLY NOT INCLUDED IN FILING PREVIOUSLY RECORDED AT REEL: 065709 FRAME: 618. ASSIGNOR(S) HEREBY CONFIRMS THE SECURITY AGREEMENT. Recorded Dec 6, 2023
From: IQVIA INC.; IQVIA RDS INC.; IMS SOFTWARE SERVICES LTD.; Q SQUARED SOLUTIONS HOLDINGS LLC
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 065790/0781 →
SECURITY INTEREST Recorded Nov 29, 2023
From: IQVIA INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 065709/0618 →
SECURITY INTEREST Recorded Nov 29, 2023
From: IQVIA INC.; IQVIA RDS INC.; IMS SOFTWARE SERVICES LTD.; Q SQUARED SOLUTIONS HOLDINGS LLC
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 065710/0253 →
SECURITY INTEREST Recorded May 24, 2023
From: IQVIA INC.; IQVIA RDS INC.; IMS SOFTWARE SERVICES LTD.; Q SQUARED SOLUTIONS HOLDINGS LLC
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION
Reel/Frame 063745/0279 →
Continuity (6)
Provisional Application 63178702 · Apr 23, 2021
Provisional Application 63178707 · Apr 23, 2021
Provisional Application 63178704 · Apr 23, 2021
Provisional Application 63178771 · Apr 23, 2021
Provisional Application 63178766 · Apr 23, 2021
Related Publication 20220343087A1 · Oct 27, 2022
References Cited (62)
US 6857022B1 · Scanlan · 2005 [cited by applicant]
US 9473437B1 · Jakobsson · 2016 [cited by applicant]
US 10331793B2 · Dotterer et al. · 2019 [cited by applicant]
US 10755177B1 · Dabney · 2020 [cited by examiner]
US 20020026308A1 · Osborne · 2002 [cited by examiner]
US 20060200339A1 · Satake et al. · 2006 [cited by applicant]
US 20070030528A1 · Quaeler et al. · 2007 [cited by applicant]
US 20070050182A1 · Sneddon et al. · 2007 [cited by applicant]
US 20070294076A1 · Shore et al. · 2007 [cited by applicant]
US 20080114564A1 · Ihara · 2008 [cited by examiner]
US 20090119091A1 · Sarig · 2009 [cited by applicant]
US 20110184722A1 · Sneddon et al. · 2011 [cited by applicant]
US 20130004075A1 · Avrahami et al. · 2013 [cited by applicant]
US 20130173247A1 · Hodson · 2013 [cited by applicant]
US 20140149363A1 · Leeds · 2014 [cited by applicant]
US 20140317078A1 · Gallagher · 2014 [cited by examiner]
US 20140358518A1 · Wu et al. · 2014 [cited by applicant]
US 20150193850A1 · Tamir · 2015 [cited by examiner]
US 20150317602A1 · Rao · 2015 [cited by examiner]
US 20160147738A1 · Geurts · 2016 [cited by examiner]
US 20160162478A1 · Blassin et al. · 2016 [cited by applicant]
US 20160232156A1 · Orsini et al. · 2016 [cited by applicant]
US 20170024461A1 · Mac an tSaoir · 2017 [cited by examiner]
US 20170076244A1 · Bastide · 2017 [cited by examiner]
US 20170329844A1 · Tacchi · 2017 [cited by examiner]
US 20180039622A1 · Bihani · 2018 [cited by examiner]
US 20180130019A1 · Kolb et al. · 2018 [cited by applicant]
US 20180268081A1 · Kearney · 2018 [cited by examiner]
US 20190236102A1 · Wade et al. · 2019 [cited by applicant]
US 20190354544A1 · Hertz · 2019 [cited by examiner]
US 20190384820A1 · Liu · 2019 [cited by examiner]
US 20200311683A1 · Chua · 2020 [cited by examiner]
US 20200394223A1 · Nishimura · 2020 [cited by examiner]
US 20210026859A1 · Vangala et al. · 2021 [cited by applicant]
US 20210089375A1 · Ghafourifar · 2021 [cited by examiner]
US 20210133612A1 · Sinha · 2021 [cited by examiner]
US 20210326537A1 · Liu et al. · 2021 [cited by applicant]
US 20210397897A1 · Shae · 2021 [cited by examiner]
US 20220027508A1 · Rao · 2022 [cited by applicant]
US 20220067305A1 · Shimizu · 2022 [cited by applicant]
US 20220207587A1 · Yang · 2022 [cited by examiner]
US 20220343085A1 · Etches et al. · 2022 [cited by applicant]
Taghavi, M., Bentahar, J., Otrok, H., & Bakhtiyari, K. (2019). A blockchain-based model for cloud service quality monitoring. IEEE Transactions on Services Computing, 13(2), 276-288. (Year: 2019). [cited by examiner]
Shvaiko, P., & Euzenat, J. (2005). A survey of schema-based matching approaches. In Journal on data semantics IV (pp. 146-171). Berlin, Heidelberg: Springer Berlin Heidelberg. (Year: 2005). [cited by examiner]
Paolucci, M., Kawamura, T., Payne, T. R., & Sycara, K. (2002). Semantic matching of web services capabilities. In The Semantic Web-ISWC 2002: First International Semantic Web Conference Sardinia, Italy, Jun. 9-12, 2002 … [cited by examiner]
International Search Report and Written Opinion in International Appln. No. PCT/US2022/71898, dated Jun. 30, 2022, 10 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/US2022/71901, mailed on Oct. 25, 2022, 10 pages. [cited by applicant]
[No Author Listed], “World Trade Statistical Review 2017,” World Trade Organization, 2017, 181 pages. [cited by applicant]
Coinmarketcap.com [online], “Monthly Volume Rankings (Currency),” available on or before Mar. 21, 2021, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210323005047/https://coinmarketcap.com/curr… [cited by applicant]
En.m.wikipedia.org [online], “File:Hash tree.png,” Dec. 20, 2010, retrieved on Mar. 15, 2024, retrieved from URL<https://en.m.wikipedia.org/wiki/File:Hash_tree.png>, 3 pages. [cited by applicant]
En.wikipedia.org [online], “Neural machine translation,” last edited on Feb. 18, 2024, available on or before Jun. 21, 2016, retrieved on Mar. 15, 2024, retrieved from URL<https://en.wikipedia.org/wiki/Neural_machine tr… [cited by applicant]
En.wikipedia.org [online], “Vitalik Buterin”, last edited on Mar. 3, 2024, available on or before Mar. 6, 2014, retrieved on Mar. 15, 2024, retrieved from URL<https://en.wikipedia.org/wiki/Vitalik_Buterin>, 10 pages. [cited by applicant]
etherscan.io/ [online], “The Ethereum Blockchain Explorer,” available on or before Mar. 26, 2021, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210326001554/https://etherscan.io/>, retrieved on… [cited by applicant]
ethplorer.io/ [online], “Ethereum Tokens Explorer,” available on or before Mar. 9, 2021, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210309005642/https://ethplorer.io/>, retrieved on Mar. 15,… [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2022/071898, mailed on Nov. 2, 2023, 8 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2022/071901, mailed on Nov. 2, 2023, 8 pages. [cited by applicant]
Manyika et al., “The Internet of Things: mapping the value beyond the hype,” McKinsey & Company, Jun. 2015, 24 pages. [cited by applicant]
Nimdzi.com [online], “THE 2021 NIMDZI 100: The Ranking of the Top 100 Largest Language Service Providers,” 2021, retrieved on Mar. 15, 2024, retrieved from URL<https://www.nimdzi.com/nimdzi-100-2021/>, 37 pages. [cited by applicant]
Pourmajidi et al., “Logchain: Blockchain-assisted Log Storage,” CoRR, submitted, May 22, 2018, arXivi:1805.08868V1, 5 pages. [cited by applicant]
Reuters.com [online], “Ethereum is top public blockchain, bitcoin No. 13 in China's new index,” available on or before Mar. 9, 2019, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20190209011122/h… [cited by applicant]
Schwartz et al., “Machine Translation and Monolingual Postediting: The AFRL WMT-14 System,” Proceedings of the Ninth Workshop on Statistical Machine Translation, Jun. 26-27, 2014, pp. 186-194. [cited by applicant]
Slator.com [online], “Tag: neural machine translation,” available on or before Mar. 6, 2021, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210306144146/https://slator.com/tag/neural-machine-tra… [cited by applicant]