EXHIBIT D

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 1 of 37
US8311805 Nokia 3.1 (“The accused product”)

1. A method, performed in a 

character entry system, for 

interrelating character strings 

so that an incomplete input 

character string can be 

completed by selection of a 

presented character string, the 

method comprising:

The accused product practices a method, performed in a character entry system (e.g., predictive text 

system of the accused product), for interrelating character strings so that an incomplete input 

character string can be completed by selection of a presented character string (e.g., selection of 

suggested selectable words).

https://www.nokia.com/phones/en_us/nokia-3-1

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 2 of 37
https://www.nokia.com/phones/en_us/nokia-3-1

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 3 of 37
https://www.att.com/device-support/article/wireless/KM1340564/Nokia/NokiaTA1140

computing relationship scores 

for individual character strings 

in the system from documents 

stored in memory of the 

character entry system, the 

relationship scores consisting 

of a function consisting of cooccurrence scores between 

pairs of distinct character 

strings stored in a single matrix 

created from the character 

strings in the stored documents;

The accused product practices computing relationship scores for individual character strings in the 

system from documents (e.g., Notes, message mail, etc.) stored in memory (e.g., memory of the 

accused product) of the character entry system (e.g., predictive text system of the accused product), 

the relationship scores consisting of a function consisting of co-occurrence scores between pairs of 

distinct character strings stored in a single matrix created from the character strings in the stored 

documents.

As shown below, various character strings are associated with each other based on their mutual cooccurrence with adjacency. For instance, when a couple of paragraphs, hereinafter referred to as 

“The Combined Essay” with phrase “James Maxwell”, “James Maxima”, and "James Michener" 

are typed, and therefore input to the predictive text system of the accused product, the predictive 

text system of the accused product, based on the frequency of mutual co-occurrence of the string 

“James” with “Maxwell”, “Maxima”, and “Michener”, in the given order, start providing selectable 

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 4 of 37
character strings when “James m” is typed. The two selectable character strings, among others, are: 

Maxwell, and Maxima. For the reliability of the demonstration, The combined Essay is typed five 

times. The frequency of occurrence of “James Maxwell”, “James “Maxima”, and “James Michener” 

is 105, 50, and 20 respectively calculated over The Combined Essay repeated for five times. 

As shown below, since pairs of strings, for example, “James” and “Maxwell” has adjacently 

appeared for the most number of times, 105 to be precise, in comparison to the other pairs of strings 

with “James” as one of the strings, Maxwell appears as a selectable option followed by “Maxima”, 

since the number of adjunct appearances of “James” with “Maxima” is 50.

Shown below is a Matrix depicting association of character string “James” with character strings 

“Maxwell”, “Maxima”, and “Michener”. 

Character String Matrix Vis a Vis the paragraphs

Character 

String-1

Character 

String-2

Number of co-occurrence of the Character String-1 and Character 

String-2, with both being adjacent to each other in that order 

 (Per 5 entry of “The Combined Essay”)

James Maxima 50 (10 James Maxima) 

James Maxwell 105 (21 James Maxwell)

James Michener 4 (20 James Michener)

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 5 of 37
The Combined Essay, Part-1

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 6 of 37
The Combined Essay, Part-2

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 7 of 37
The Combined Essay, Part-3

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 8 of 37
The Combined Essay, Part-4

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 9 of 37
The Combined Essay, Part-5

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 10 of 37
The Combined Essay, Part-6

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 11 of 37
in response to inputting of a 

string of individual characters 

that exceeds a specified 

threshold, identifying at least 

one selectable character string 

from among contextual 

associations that can complete 

the input character string in 

context based upon an overall 

ranking score computed as a 

function of a relationship score 

and at least one other score; and

The accused product practices in response to inputting of a string of individual characters that 

exceeds a specified threshold (e.g., inputting a starting character of a word), identifying at least one 

selectable character string (e.g., predicting selectable words for user selection) from among 

contextual associations that can complete the input character string in context based upon an overall 

ranking score computed as a function of a relationship score and at least one other score.

As shown below, since pairs of strings, for example, “James” and “Maxwell” has adjacently 

appeared for the most number of times, 105 to be precise, in comparison to the other pairs of strings 

with “James” as one of the strings, Maxwell appears as a selectable option followed by “Maxima”, 

since the number of adjacent appearances of “James” with “Maxima” is 50 and which is greater than 

the adjacent appearance of “James” with “Michener” which stands at 20. 

Shown below is a Matrix depicting association of character string “James” with character strings 

“Maxwell”, “Maxima”, and “Michener”. 

Character String Matrix Vis a Vis the paragraphs

Character 

String-1

Character 

String-2

Number of co-occurrence of the Character String-1 and Character 

String-2, with both being adjacent to each other in that order 

 (Per 5 entry of “The Combined Essay”)

James Maxima 50 (10 James Maxima) 

James Maxwell 105 (21 James Maxwell)

James Michener 4 (20 James Michener)

When number of adjacently appearance of pairs of strings become same, the predictive text system 

suggests a word from the two based on some other relationship between them such as alphabetical 

order of the words or recently used word.

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 12 of 37
The Combined Essay, Part-1

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 13 of 37
The Combined Essay, Part-2

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 14 of 37
The Combined Essay, Part-3

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 15 of 37
The Combined Essay, Part-4

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 16 of 37
The Combined Essay, Part-5

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 17 of 37
The Combined Essay, Part-6

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 18 of 37
Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 19 of 37
providing the identified at least 

one selectable character string 

to a user for selection.

The accused product practices providing the identified at least one selectable character string (e.g., 

suggesting words for user selection) to a user for selection (e.g., user can select a desired word).

As shown below, since pairs of strings, for example, “James” and “Maxwell” has adjacently 

appeared for the most number of times, 105 to be precise, in comparison to the other pairs of strings 

with “James” as one of the strings, Maxwell appears as a selectable option followed by “Maxima”, 

since the number of adjacent appearances of “James” with “Maxima” is 50 and which is greater than 

the adjacent appearance of “James” with “Michener” which stands at 20. 

Shown below is a Matrix depicting association of character string “James” with character strings 

“Maxwell”, “Maxima”, and “Michener”. 

Character String Matrix Vis a Vis the paragraphs

Character 

String-1

Character 

String-2

Number of co-occurrence of the Character String-1 and Character 

String-2, with both being adjacent to each other in that order 

 (Per 5 entry of “The Combined Essay”)

James Maxima 50 (10 James Maxima) 

James Maxwell 105 (21 James Maxwell)

James Michener 4 (20 James Michner)

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 20 of 37
The Combined Essay, Part-1

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 21 of 37
The Combined Essay, Part-2

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 22 of 37
The Combined Essay, Part-3

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 23 of 37
The Combined Essay, Part-4

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 24 of 37
The Combined Essay, Part-5

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 25 of 37
The Combined Essay, Part-6

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 26 of 37
Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 27 of 37
Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 28 of 37
2. The method of claim 1, 

wherein each relationship score 

represents the contextual 

association between an 

individual character string and 

another character string based 

upon co-occurrence of 

character strings relative to 

each other.

The accused product practices such that each relationship score represents the contextual association 

between an individual character string and another character string based upon co-occurrence of 

character strings relative to each other.

As shown below, since pairs of strings, for example, “James” and “Maxwell” has adjacently 

appeared for the most number of times, 105 to be precise, in comparison to the other pairs of strings 

with “James” as one of the strings, Maxwell appears as a selectable option followed by “Maxima”, 

since the number of adjacent appearances of “James” with “Maxima” is 50 and which is greater than 

the adjacent appearance of “James” with “Michener” which stands at 20. 

Shown below is a Matrix depicting association of character string “James” with character strings 

“Maxwell”, “Maxima”, and “Michener”. 

Character String Matrix Vis a Vis the paragraphs

Character 

String-1

Character 

String-2

Number of co-occurrence of the Character String-1 and Character 

String-2, with both being adjacent to each other in that order 

 (Per 5 entry of “The Combined Essay”)

James Maxima 50 (10 James Maxima) 

James Maxwell 105 (21 James Maxwell)

James Michener 4 (20 James Michner)

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 29 of 37
The Combined Essay, Part-1

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 30 of 37
The Combined Essay, Part-2

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 31 of 37
The Combined Essay, Part-3

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 32 of 37
The Combined Essay, Part-4

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 33 of 37
The Combined Essay, Part-5

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 34 of 37
The Combined Essay, Part-6

Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 35 of 37
Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 36 of 37
Case 1:20-cv-23179-MGC Document 1-4 Entered on FLSD Docket 07/31/2020 Page 37 of 37