Microsoft Technology Licensing, LLC

Lucent Technologies Inc.

At+t Corp.

At&t Intellectual Property I, LP

At&t Bell Laboratories

Other

Telephone and Telegraph Company, At&t Bell Laboratories

Kenneth Ward Church

Bo Thiesson

Oscar Ernesto Agazzi

Simon D Byers

Vaidyanathan Ramaswami

Duncan Kirkwood Sparrell

Glenn Stephen Fowler

Jonathan Isaac Helfman

William Arthur Gale

Robert L Rounthwaite

Ryen William White

Arnd Christian König

Timothy David Sharpe

Silviu-Petru Cucerzan

Robert J Ragno

David Dolan Lewis

Brenda Sue Baker

Scott Kirk Imig

Cecil H Coker

Edward Hart

Brian W Kernighan

Emily Blythe Pitler

Donald Caldwell

Martin Miroslavov Markov

Jean-Marie Larchevêque

Samuel D Paye, Jr

Qiaozhu Mei

Donald F Caldwell

Ping Li

David E Yarowsky

Ido Dagan

A method and apparatus for handling internet access telephone calls made via cable company telephone services. A head end data terminal receives cable signals and converts them into individual signals. An intelligent switch detects signals destined for an internet service provider and routes those signals on a separate path to the internet service provider. A central switch routes the other signals along a telephone network. A computer program can control the steps of receiving cable signals, converting them into voice band signals, routing the signals that are not for the intended recipient to a central switch, multiplexing the signals for the intended recipient together, and sending the multiplexed signals to the intended recipient.

Method and apparatus for routing data

A system that facilitates selecting advertisements that match a search query is described herein. The system includes a search query receiver component that receives a search query including keywords. The system also includes a match component that uses an associative data structure to identify in the associative data structure one or more data nodes that are associated in the associative data structure with respective unique keys corresponding to respective one or more hashes of combinations of the keywords in the search query. For each identified data node, the match component selects advertisements associated with bid phrases stored in the identified data node that respectively only include keywords included in the search query.

Contextual query suggestion in result pages

Query logs are accessed to obtain queries, user information that specifies a user from which the query was received, a long with a selected result that was selected by the specified user who authored the query. This query log information is used to identify classes of users that looked for a similar result given a similar query. Those classes can then be used by a search engine in order to rank or provide search results to a user in response to a query input by the user.

Personalized information retrieval search with backoff

Systems and methods that create a classification of sentences in a language, and further construct associated local versions of language models, based on geographical location and/or other demographic criteria&#x2014;wherein such local language models can be of different levels of granularity according to chosen demographic criteria. The subject innovation employs a classification encoder component that forms a classification (e.g. a tree structure) of sentences, and a local language models encoder component, which employs the classification of sentences in order to construct the localized language models. A decoder component can subsequently enable local word wheeling and/or local web search by blending k-best answers from local language models of varying demographic granularity that match users demographics. Hence, k-best matches for input data by users in one demographic locality can be different from k-best matches for the same input by other users in another locality.

Demographic based classification for local word wheeling/web search

The claimed subject matter provides systems and/or methods that expand input data. An interface can obtain input data and a wildcard insertion component can modify the input data to include at least one implicit wildcard inserted at an end of each intended word. Additionally, an expansion component can generate a candidate list of expanded data based at least in part on the input data including the at least one implicit wildcard utilizing a language model that provides likely expansions of wildcards. Further, the expansion component can evaluate the input data at a server side.

Server side search with multi-word word wheeling and wildcard expansion

An improved data compression method and apparatus is provided, particularly with regard to the compression of data in tabular form such as database records. The present invention achieves improved compression ratios by utilizing metadata to transform the data in a manner that optimizes known compression techniques. In one embodiment of the invention, a schema is generated which is utilized to reorder and partition the data into low entropy and high entropy portions which are separately compressed by conventional compression methods. The high entropy portion is further reordered and partitioned to take advantage of row and column dependencies in the data. The present invention enables not only much greater compression ratios but increased speed than is achieved by compressing the untransformed data.

Data compression method and apparatus

Systems and methods that enhance estimate(s) of features (e.g., word associations), via employing a sampling component (e.g., sketches) that facilitates computations of sample contingency tables, and designates occurrences (or absence) of features in data (e.g., words in document lists). The sampling component can further include a contingency table generator and an estimation that employs a likelihood argument (e.g., partial likelihood, maximum likelihood, and the like) to estimate features/word pair(s) associations in the contingency tables.

Contingency table estimation via sketches

System(s) and method(s) that facilitate utilizing pre-cached disk space. Pre-cached memory space within a storage device is identified, and a subset of the pre-cached memory space is pre-populated with data so that the data can be selectively and dynamically accessed. During use of a computer (e.g., in a web-browsing session) a subset of the pre-stored data can be dynamically and selectively exposed to the user as a function of user and/or computer application state. Pre-storage of the data on pre-cached memory of the computer mitigates delayed data access (e.g., due to insufficient transmission bandwidth) thereby enhancing user computing experience. The user can utilize the device without having to distinguish between pre-cached and free memory. In other words, the operating system can present the cached memory to the user so that it appears as free memory without the user having to direct the system to do so.

Pre-storage of data to pre-cached system memory

A list of integer values is generated from n-grams of a user input. The list of integer values is sorted. Differences between adjacent integer values in the list are calculated. Each calculated difference is encoded using a Golomb code. A Golomb compressed language model is accessed to identify likely matches.

Compressing language models with Golomb coding

A method of inputting text is provided in which a first portion of an input string is received from a user, the first portion of the input string including at least one keystroke representing a wildcard character of the input string. A second portion of the input string is then received, with the second portion including one or more keystrokes all representing non-wildcard characters of the input string.

Using language models to expand wildcards

A method downsamples characters in a document by font substitution when the characters in the document are identified with sufficient reliability. Otherwise, the characters are downsampled by decimation. The method also allows downsampling by applying characters to a two-dimensional nonlinear filter and decimating.

Method of downsampling documents

Growing community of inventors

Seattle, WA, United States of America

Kenneth Ward Church