Granted Patent B2

US 12,625,870 · App. 18/955,028 · Granted May 12, 2026

Inventors: Lu Zhang (Bellevue, WA); Nichole Haas (Monroe, WA); Joshua Manoj (Bellevue, WA); Sri Raja Harshini Koka (Bellevue, WA)

Assignee: SAP SE

G06F16/24558G06F16/2379

Abstract

Claims (58)

1 . A method, comprising:

loading first data entries from an expense report database and an itinerary database into a data entry store;

converting, by a tokenizer module of a computing device, the first data entries in the data entry store into one or more first-entry tokens;

assigning, by a weighting engine executed by the computing device, a weight to each of the one or more first-entry tokens based on a frequency of the of the first-entry tokens;

filtering, by a filtering component of the computing device, the first data entries to remove the first data entries in expense reports that are not associated with a travel segment expense;

converting, by the tokenizer, each of one or more character fields of each of a plurality of second entries in a second database into a respective one or more second-entry tokens and weighting the second-entry tokens based on a frequency of the second-entry tokens;

comparing, by a comparison engine of the computing device, the first-entry tokens to the second-entry tokens;

determining, by the computing device, whether the first data entries matches one of the second entries based on the comparing and weights of the first-entry tokens and the second-entry tokens, wherein determining that the first data entries matches one of the plurality of second entries is further in response to:

each of a first plurality of character fields of the first data entries exactly matching a respective character field of the one of the plurality of second entries; and

each of at least two of a second plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries;

associating, by the computing device, a first data entry with one of the second entries in response to determining that the first data entry matches the one of the second entries; and

determining that the first data entry matches one of the plurality of second entries.

2 . The method of claim 1 wherein the filtering removes first data entries that have been submitted but have not been approved.

3 . The method of claim 1 wherein the filtering removes first data entries that have not been submitted for approval.

4 . The method of claim 1 wherein the filtering removes first data entries that are already associated with a travel segment entry in the itinerary database.

5 . The method of claim 1 wherein converting each of one or more character fields of each of the plurality of second entries in the second database into a respective one or more second-entry tokens includes converting each of the one or more character fields into a respective plurality of overlapping second-entry tokens.

6 . The method of claim 1 , wherein determining that the first data entries match one of the plurality of second entries is further in response to:

each of a first plurality of character fields of the first data entries exactly matching a respective character field of the one of the plurality of second entries;

each of at least one of a second plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries; and

each of at least one of a third plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries.

7 . A system, comprising:

one or more processors; and

a non-transitory machine-readable medium storing a program executable by the one or more processors, the program comprising sets of instructions for:

loading first data entries from an expense report database and an itinerary database into a data entry store;

converting, by a tokenizer module, the first data entries in the data entry store into one or more first-entry tokens;

assigning, by a weighting engine, a weight to each of the one or more first-entry tokens based on a frequency of the of the first-entry tokens;

filtering, by a filtering component, the first data entries to remove the first data entries in expense reports that are not associated with a travel segment expense;

converting, by the tokenizer, each of one or more character fields of each of a plurality of second entries in a second database into a respective one or more second-entry tokens and weighting the second-entry tokens based on a frequency of the second-entry tokens;

comparing, by a comparison engine using the one or more processors, the first-entry tokens to the second-entry tokens;

determining, by the one or more processors, whether the first data entries matches one of the second entries based on the comparing and weights of the first-entry tokens and the second-entry tokens wherein determining that the first data entries matches one of the plurality of second entries is further in response to:

each of a first plurality of character fields of the first data entries exactly matching a respective character field of the one of the plurality of second entries; and

each of at least two of a second plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries;

associating, by the one or more processors, a first data entry with one of the second entries in response to determining that the first data entry matches the one of the second entries; and

determining, by the one or more processors, that the first data entry matches one of the plurality of second entries.

8 . The system of claim 7 wherein the filtering removes first data entries that have been submitted but have not been approved.

9 . The system of claim 7 wherein the filtering removes first data entries that have not been submitted for approval.

10 . The system of claim 7 wherein the filtering removes first data entries that are already associated with a travel segment entry in the itinerary database.

11 . The system of claim 7 wherein converting each of one or more character fields of each of the plurality of second entries in the second database into a respective one or more second-entry tokens includes converting each of the one or more character fields into a respective plurality of overlapping second-entry tokens.

12 . The system of claim 7 , wherein determining that the first data matches entries match one of the plurality of second entries is further in response to:

each of a first plurality of character fields of the first data entries exactly matching a respective character field of the one of the plurality of second entries;

each of at least one of a second plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries; and

each of at least one of a third plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries.

13 . A non-transitory machine-readable medium storing a program executable by at least one processor of a computer, the program comprising sets of instructions for:

loading first data entries from an expense report database and an itinerary database into a data entry store;

converting, by a tokenizer module of the computer, the first data entries in the data entry store into one or more first-entry tokens;

assigning, by a weighting engine, a weight to each of the one or more first-entry tokens based on a frequency of the of the first-entry tokens;

filtering, by a filtering component the first data entries to remove the first data entries in expense reports that are not associated with a travel segment expense;

converting, by the tokenizer of the computer, each of one or more character fields of each of a plurality of second entries in a second database into a respective one or more second-entry tokens and weighting the second-entry tokens based on a frequency of the second-entry tokens;

comparing, by the computer, the first-entry tokens to the second-entry tokens;

determining, by the computer, whether the first data entries matches one of the second entries based on the comparing and weights of the first-entry tokens and the second-entry tokens, wherein determining that the first data entries matches one of the plurality of second entries is further in response to:

each of a first plurality of character fields of the first data entries exactly matching a respective character field of the one of the plurality of second entries; and

each of at least two of a second plurality of character fields of the first data entries at least partially matching a respective character field of the one of the plurality of second entries;

associating, by the computer, a first data entry with one of the second entries in response to determining that the first data entry matches the one of the second entries; and

determining, but the computer, that the first data entry matches one of the plurality of second entries.

14 . The non-transitory machine-readable medium of claim 13 wherein the filtering removes first data entries that have been submitted but have not been approved.

15 . The non-transitory machine-readable medium of claim 13 wherein the filtering removes first data entries that have not been submitted for approval.

16 . The non-transitory machine-readable medium of claim 13 wherein the filtering removes first data entries that are already associated with a travel segment entry in the itinerary database.

17 . The non-transitory machine-readable medium of claim 13 wherein converting each of one or more character fields of each of the plurality of second entries in the second database into a respective one or more second-entry tokens includes converting each of the one or more character fields into a respective plurality of overlapping second-entry tokens.

Assignments (1)

Continuity (3)

References Cited (22)