Hyperphrase Technologies, LLC v. Google, Inc.

580 F. Supp. 2d 797, 2008 U.S. Dist. LEXIS 76472, 2008 WL 4454245
CourtDistrict Court, W.D. Wisconsin
DecidedSeptember 30, 2008
Docket3:06-cr-00199
StatusPublished

This text of 580 F. Supp. 2d 797 (Hyperphrase Technologies, LLC v. Google, Inc.) is published on Counsel Stack Legal Research, covering District Court, W.D. Wisconsin primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
Hyperphrase Technologies, LLC v. Google, Inc., 580 F. Supp. 2d 797, 2008 U.S. Dist. LEXIS 76472, 2008 WL 4454245 (W.D. Wis. 2008).

Opinion

OPINION AND ORDER

BARBARA B. CRABB, District Judge.

Plaintiffs Hyperphrase Technologies, LLC and Hyperphrase, Inc. brought this patent infringement action alleging that defendant Google Inc.’s AutoLink and Ad-Sense products infringe plaintiffs’ United States Patents Nos. 5,903,889, (’889 patent) 6,434,567 (’567 patent), 6,526,321 (’321 patent) and 7,013,298 (’298 patent). On December 20, 2006, Judge Shabaz granted summary judgment to defendant, finding that neither product infringed any claim of the patents-in-suit, in light of his construction of the term “data reference.” On December 26, 2007, the Court of Appeals for the Federal Circuit held that Judge Shabaz’s construction of data reference was erroneous, but it affirmed the decision with respect to the claims of infringement against Ad Sense that Judge Shabaz had dismissed, reversed the judgment that Au-toLink did not infringe the '889 and '321 patents and remanded the case with the following instructions:

It is unclear from the record on appeal whether AutoLink meets all of the remaining elements of any of the asserted claims of [the '889 and '321] patents because the “data reference” limitation was the only limitation the district court discussed in its infringement analysis and the only limitation discussed in detail in the parties’ briefing on appeal. We thus cannot *801 determine if AutoLink does not infringe because it does not meet other limitations of the claims. Therefore, we must remand so the district court can evaluate whether AutoLink infringes the asserted claims of the '889 and '321 patents under the correct construction of “data reference.”

Hyperphrase Technologies, Inc. v. Google, Inc., 260 Fed.Appx. 274, 282 (Fed.Cir.2007) The remaining asserted claims are claims 1 and 7 of the '889 patent and claims 1, 24 and 86 of the '321 patent.

Defendant now renews its motions for summary judgment, arguing that Auto-Link does not infringe any of the asserted, claims, that the asserted claims are invalid as a matter of law, and that, if there is infringement, it is not willful. With Judge Shabaz out on medical leave, I am handling his cases, including this one. I conclude that AutoLink lacks at least one element of each of the remaining asserted claims. Therefore, defendant is entitled to summary judgment of non-infringement. Because I find no infringement, the issue of willful infringement is moot. Furthermore, because the parties do not suggest any ongoing controversy apart from the AutoLink product, I decline to address defendant’s counterclaims for a declaration of invalidity.

FACTS

The patents in suit are related to one another as continuations-in-part of prior applications and all are the inventions of Carlos de la Huerga. The preferred embodiments of the patented inventions involve storage and retrieval of electronic medical records.

A. The '889 patent

The '889 patent claims a system for retrieving, modifying and collecting data records on a computer network. The invention detects types, relationships and classification of data records and modifies them to support interactive hypertext-linked display and organized access to the records. Plaintiffs assert infringement of the following claims:

Claim 1:

A computer system with a plurality of data records on a plurality of databases, and a standardized format for addressing said data records, said computer system comprising:
(a) a user interface having an interactive display program for requesting one of said data records and displaying a plurality of interface supported data formats;
(b) means for receiving a reference to a first data record from said interactive display program;
(c) means for retrieving said first data record;
(d) means for parsing said first data record to identify a reference to a second data record;
(e) means for modifying said reference to said second data record to create an address, said address being operable to retrieve said second data record; and
(f) means for sending said modified first data record to said interactive display program.

Claim 7:

The computer system of claim 1, wherein said reference to said second data record comprises a keyword phrase.

The '889 specification, col. 2, In. 65 to col. 3, In. 9, provides the following summary of the invention:

It is an object of this invention to provide a means of processing and converting existing data records formatted, structured, and accessed according to a *802 multitude of disparate standards to common standards by which they may be accessed, controlled, and/or displayed through a single interactive display program. It is another object of this invention to provide conventions for exploring data records for references to contextually related records and modifying, generating, embedding and appending links and data-retrieving codes in and to said related data records, whereby to organize said related data records in a hypertext tree structure.

Figures 12A-12C of the '889 specification graphically depict the operation of the claimed system:

[[Image here]]

*803 [[Image here]]

*804 [[Image here]]

B. The '321 Patent

The '321 patent claims a method for automatically creating hyperlinks between records in a record set that both eliminates ambiguity when record references overlap and inserts tags to identify specific information within the records. Plaintiffs assert infringement of the following claims:

A method for identifying a referenced record referenced in a referencing record wherein the referenced record is referenced in the referencing record by at least a combination including a data reference (DR) and a modifier reference (MR), the method comprising the steps of:
(i) receiving the referencing record;
(ii) analyzing the referencing record to identify a DR, when a DR is identified:
(a) identifying an MR rule set (MRRS) specifying the relationship between an MR and the DR;
(b) analyzing the referencing record in accordance with the MRRS to identify the existence of the MR and, when the MR is identified;
(c) identifying the referenced record associated with the DR/MR combination.

Claim 24:

The method of claim 1 further including the step of linking the record reference to the referenced record.

Claim 86:

Free access — add to your briefcase to read the full text and ask questions with AI

Related

Cite This Page — Counsel Stack

Bluebook (online)
580 F. Supp. 2d 797, 2008 U.S. Dist. LEXIS 76472, 2008 WL 4454245, Counsel Stack Legal Research, https://law.counselstack.com/opinion/hyperphrase-technologies-llc-v-google-inc-wiwd-2008.