Google is updating its iPhone search application with a new voice search feature, according to the New York Times. The update is expected to be available in the iTunes app store sometime today.

Users will be able to speak their questions into the phone. The speech is recorded and sent to Google servers which will try to understand the recording and find the answer via Google’s search engine.

One of the cool parts of the app is that it will use the iPhone accelerometer to know when a user has raised the phone to their ear. For the iPhone-less, the accelerometer senses motion. There’s a bunch of games that use this feature for their apps. So if you ever see an iPhone user making weird motions, that’s why.

The update wasn’t yet available in my iTunes, but I’m looking forward to checking it out when it is.

Oh, I should mention that Google isn’t the first to bring voice search to mobile. Microsoft and Yahoo already have brought voice search to some devices. But a search in the iTunes store didn’t reveal anything else that was a solid voice search app (not that Apple’s iTunes search is the best).

Related Reading:
Google Updates Search Results for iPhone
Google’s My Location Now with WiFi
Google Prepares iPhone Ad Options

The Interactive Advertising Bureau has announced new initiatives aimed at improving workflows and best practices.

Here they are:

• E- Business Interactive Standards, a beta release of an XML-based solution for automating the transfer of business order information between advertising agencies and media companies. Beta testing partners will be implementing and refining this solution throughout 2009.
• Interactive Advertising Workflow Best Practices, a document that provides comprehensive process recommendations to agencies and publishers for improved communications and efficient operations throughout the entire lifecycle of an advertising campaign. The document’s best practices focus on how to improve the management of advertising accounts by decreasing discrepancies, campaign set-up errors and billing cycles between advertising agencies and publishers. www.iab.net/workflow
• Digital Video Ad Serving Template (VAST), an XML-based solution designed to standardize communication between digital video players and servers. VAST allows publishers to increase digital video yield by utilizing ad networks to sell unsold inventory and reduce friction with buyers by allowing third-party ad tags
• Ad Load Performance Best Practices, a document that details how agencies and publishers should develop and serve digital advertising campaigns to reduce load time for ads and improve their performance. www.iab.net/adload
• Best Practices for Rich Media Ads in Asynchronous Ad Environments, a solution that establishes a standard set of rich media implementation rules for rich media ad vendors, creative development teams, and publishers when serving ads into dynamic environments.

“These initiatives will revolutionize our industry by improving efficiencies in the interactive business—which means growth for publishers, for agencies and for marketers who will now reach their customers even more effectively,” said Randall Rothenberg, President and CEO of the IAB.

What do you think of these initiatives? Let us know in the comments.

Related Reading:
Internet Advertising Up 15.2% for the First Half of 2008
Online Publishers Turning to Ad Networks to Sell Unused Inventory

ü They search the Internet - or select pieces of the Internet - based on important words,

ü They keep an index of the words they find, and where they find them, and

ü They allow users to look for words or combinations of words found in that index.

Early Search Engines held an index of a few hundred thousand pages and documents, and received maybe one or two thousand inquiries each day. Today, a top Search Engine will index hundreds of millions of pages, and respond to tens of millions of queries per day.

Before a Search Engine can tell you where a file or document is, it must be found. To find information on the hundreds of millions of Web pages that exist, a Search Engine employs special software robots, called spiders, to build lists of the words found on Web sites.

When a spider is building its lists, the process is called web crawling.

In order to build and maintain a useful list of words, a Search Engine’s spiders have to look at a lot of pages. How does any spider start its travels over the Web? The usual starting points are lists of heavily used servers and very popular pages. The spider will begin with a popular site, indexing the words on its pages and following every link found within the site. In this way, the spidering system quickly begins to travel, spreading out across the most widely used portions of the Web.

Once the spiders have completed the task of finding information on Web pages, the Search Engine must store the information in a way that makes it useful. There are two key components involved in making the gathered data accessible to users:

ü The information stored with the data, and

ü The method by which the information is indexed.

In the simplest case, a Search Engine could just store the word and the URL where it was found. In reality, this would make for an engine of limited use, since there would be no way of telling whether the word was used in an important or a trivial way on the page, whether the word was used once or many times or whether the page contained links to other pages containing the word. In other words, there would be no way of building the ranking list that tries to present the most useful pages at the top of the list of search results.

To make for more useful results, most Search Engines store more than just the word and URL. A Search Engine might store the number of times that the word appears on a page. The engine might assign a weight to each entry, with increasing values assigned to words as they appear near the top of the document, in sub-headings, in links, in the META tags or in the title of the page. Each commercial Search Engine has a different formula for assigning weight to the words in its index. This is one of the reasons that a search for the same word on different Search Engines will produce different lists, with the pages presented in different orders.

An index has a single purpose: it allows information to be found as quickly as possible. There are quite a few ways for an index to be built, but one of the most effective ways is to build a hash table. In hashing, a formula is applied to attach a numerical value to each word.

The formula is designed to evenly distribute the entries across a predetermined number of divisions. This numerical distribution is different from the distribution of words across the alphabet, and that is the key to a hash table’s effectiveness.

When a person requests a search on a keyword or phrase, the Search Engine software searches the index for relevant information. The software then provides a report back to the searcher with the most relevant web pages listed first.