metaphone

Note that this approach will also produce suggestions of NathanHarrington. html for one-letter metaphone 404s like whoo. html.

The bulk of the Metaphone algorithm is a set of rules that map letter combinations into the consonant classes.

A frequency count is then created for each of these words, along with their associated metaphone keys.

The primary method for suggesting alternatives to typographical and spelling errors will be metaphone matching.

Metaphone matching is an algorithmic method for generating keys based on the phonetic pronunciation of words.

Metaphones, like Soundex and other algorithms, use a alphanumeric code to represent the verbal pronunciation of a word.

The loadMetaPhones subroutine is straightforward code that creates two hashes of metaphone keys and values.

It was this state of affairs that led Lawrence Phillips to find a replacement for the Soundex algorithm, called the Metaphone.

Despite these examples, most words in the Metaphone algorithm return a single key.

Unlike Soundex, however, metaphone codes are built to match the linguistic variabilities of pronunciation in the English language.

Each line in Listing 3 shows the actual link in the filesystem under the webserver root directory, default score, and metaphone code.

Use the metaphone-matching and regular-expression generator to create a suggestion link based on 404 hits to your Web site.

Use the program buildMetaphones. pl in Listing 10 to create your own metaphone databases.

Because the NathanHarrington. html metaphone contains an "H, " it will be added to the suggestion list.

The Metaphone algorithm uses 16 consonant classes represented by the following characters