Prosecution Insights
Last updated: September 26, 2026
Application No. 18/870,950

PRIVACY-PRESERVING FUZZY STRING MATCHING

Non-Final OA §112
Filed
Dec 02, 2024
Priority
Jun 03, 2022 — EU 22177241.1 +1 more
Examiner
HUANG, KAYLEE J
Art Unit
2447
Tech Center
2400 — Computer Networks
Assignee
Roseman Group B V
OA Round
1 (Non-Final)
74%
Grant Probability
Favorable
1-2
OA Rounds
9m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 74% — above average
74%
Career Allowance Rate
272 granted / 365 resolved
+16.5% vs TC avg
Strong +49% interview lift
Without
With
+49.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
26 currently pending
Career history
393
Total Applications
across all art units

Statute-Specific Performance

§101
5.4%
-34.6% vs TC avg
§103
50.2%
+10.2% vs TC avg
§102
7.9%
-32.1% vs TC avg
§112
29.9%
-10.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 365 resolved cases

Office Action

§112
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This office action is in response to preliminary amendment filed on 12/02/2024. Applicant amended claims 1-15 in the preliminary amendment. Claims 1-15 present for examination. Priority Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55. Information Disclosure Statement It is hereby acknowledged that the following papers have been received and placed of record in the file: Information Disclosure Statement(s) as received on 12/2/2024 is/are considered by the Examiner. Claim Objections Claims 1, 7-9, and 11-15 are objected to because of the following informalities: Regarding Claims 1, 8, 9, 11-15, the claims include dashes and they are not a proper way to indicate indentations in the claims. (See 37 C.F.R. 175(i) and MPEP 608.01(m)); Regarding claim 1, line 15, “a first and second vector representation” should read “a first vector representation and a second vector representation”; Regarding claim 1, line 15, “a first and second input string” should read “a first input string and a second input string”; Regarding claim 7, line 2, “the input devices” should read “the multiple input devices”; Regarding claim 12, lines 8-9, “the cryptographic devices” should read “the multiple cryptographic devices”; Claim 14, line 6, “a first and second input string” should read “a first input string and a second input string”; Claim 14, lines 6-7, “a first and second vector representations” should read “a first vector representation and a second vector representation”; Regarding claim 15, line 12, “a first and second vector representation” should read “a first vector representation and a second vector representation”; Appropriate correction is required. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 1-15 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 1 recites the limitation "the first and second input strings" in line 19. There is insufficient antecedent basis for this limitation in the claim. Claim 3 recites the limitation of “compute same-string distances between calibration input strings and perturbations” in lines 3-4, which renders the claim and indefinite. It is unclear how to compute distance between input strings and perturbations. Claim 4 recites the limitation "the first and second vector representations" in line 3. There is insufficient antecedent basis for this limitation in the claim. Claim 6 recites the limitation "the first and second input strings" in line 19. There is insufficient antecedent basis for this limitation in the claim. Claim 7 recites the limitation "the respective check input strings" in line 4. There is insufficient antecedent basis for this limitation in the claim. Claim 10 recites the limitation "the shuffled candidate list" in line 4. There is insufficient antecedent basis for this limitation in the claim. Regarding claim 11, claim limitation recites “the input device” in lines 1-2, which renders the claim vague and indefinite. It is unclear whether “the input device” is referring to “an input device” in claim 1, line 5, or to “an input device” in claim 1, line 6, or to a different/distinct input device. Claim 11 recites the limitation "the resulting vector representations" in lines 5-6. There is insufficient antecedent basis for this limitation in the claim. Claim 14 recites the limitation "the first and second input strings" in line 12. There is insufficient antecedent basis for this limitation in the claim. Claim 15 recites the limitation "the first and second input strings" in line 16. There is insufficient antecedent basis for this limitation in the claim. All dependent claims are rejected as having the same deficiencies as the claims they depend from. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Xu et al. (US 2018/0336268 A1). Calculate a vector representation of a string corresponding to a named entity; determine proximity (i.e., distance) of one or more vectors to one or more other vectors ([0083]). Patinkin (US 8,010,466 B2). Create a feature vector, compare the feature vector against stored feature vector; compute difference between elements of two feature vectors, compare the difference to a threshold. Jin et al. (US 2022/0229980 A1). Receive a text string including raw data for a transaction, match the text string to a plurality of locations within a location corpus to extract location information from the text string; tokenize the text string to create a sequence of tokens, apply a masked language model to sequence of tokens to generate a sequence of vectors. Rywelska et al. (US 11,657,071 B1). Cosine similarity may be applied to vector outputs of the Word2Vec neural networks to calculate an angle between the string vectors. Gabrys (US 2017/0364603 A1). Decode respective encoded set of string vectors received to arrive at the symmetric difference; determine string vector differences between all elements. Thaine et al. (US 11,461,551 B1). Generate word string vectors for word strings in a document; calculate encrypted distances between the encrypted word string vectors and the encrypted search vector, obtain a decrypted distance by decrypting an encrypted distance, and use the decrypted distance, determine a semantic match between the search query and the document. Setlur et al. (US 11,030,207 B1). Compute a first word vector for a first word in a first phrase in the second set of one or more analytic phrases using a second neural network model; compute a second word vector for a first data attribute in the one or more data attributes using the second neural network model; and compute relatedness between the first word vector and the second word vector using a similarity metric. Bissell et al. (US 11,158,308 B1). Determine a first feature vector representing first text data, determine a second feature vector representing a first portion of the second text data corresponding to first user input, process the first feature vector and the second feature vector to determine similarity data; fuzzy string matching is technique of finding strings that match a pattern approximately. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KAYLEE J HUANG whose telephone number is (571)272-0080. The examiner can normally be reached Monday-Friday 9AM-5PM. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Joon H Hwang can be reached at 571-272-4036. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. Kaylee Huang 06/27/2026 /KAYLEE J HUANG/Primary Examiner, Art Unit 2447
Read full office action

Prosecution Timeline

Dec 02, 2024
Application Filed
Jul 01, 2026
Non-Final Rejection mailed — §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12732567
SYSTEMS AND METHODS FOR TRACKING USER ACCESS ACROSS WEB DOMAINS
3y 2m to grant Granted Sep 08, 2026
Patent 12732539
AI-BASED HONEYPOT TO MITIGATE SOCIAL ENGINEERING CYBERATTACK
3y 1m to grant Granted Sep 08, 2026
Patent 12732444
AGENT FUNCTIONALITY EVALUATION IN MANAGED ENDPOINTS
1y 9m to grant Granted Sep 08, 2026
Patent 12719893
DETECTION OF MALICIOUS OPERATIONS FOR DISTRIBUTED CACHE
4y 5m to grant Granted Aug 25, 2026
Patent 12719888
Distributed Cyber Threat Intelligence Platform
2y 4m to grant Granted Aug 25, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
74%
Grant Probability
99%
With Interview (+49.2%)
2y 7m (~9m remaining)
Median Time to Grant
Low
PTA Risk
Based on 365 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month