NIST tool helps Internet master top-level domains

May 16, 2008

At the request of a worldwide Internet organization, a computer scientist at the National Institute of Standards and Technology developed an algorithm that may guide applicants in proposing new “top-level domains”—the last part of an Internet address, such as .com, that people type in navigating the Web.

As new top-level domains are added to the familiar .com, .info and .net, the algorithm* checks whether the newly proposed name is confusingly similar to existing ones by looking for visual likenesses in its appearance. Having visually distinct top-level domain names may help avoid confusion in navigating the ever-expanding Internet and combat fraud, by reducing the potential to create malicious look-alikes: .C0M with a zero instead of .COM, for instance.

Later this year, the Internet Corporation for Assigned Names and Numbers (ICANN) plans to launch the process for proposing a new round of “generic” top-level domains (gTLDs), strings such as .net, .gov and .org meant to indicate organizations or interests. In preparing for newly proposed gTLDs, ICANN reached out to various algorithm developers, including NIST’s Paul E. Black, as among those engaged to “provide an open, objective, and predictable mechanism for assessing the degree of visual confusion” in gTLDs.

Black’s algorithm compares a proposed gTLD with other TLDs and generates a score based on their visual similarities. For example, the domain .C0M scores an 88 percent visual similarity with the familiar .COM. The resulting scores may help indicate whether the newly proposed domain name looks too much like existing ones.

To make its assessments, the algorithm rates the degree of similarity between pairs of alpha-numeric characters. Some pairs, such as the numeral “1” and its dead-ringer, the lowercase letter “l,” are assigned the highest scores for visual similarity while other pairs, such as “h” and “n”, are given lower scores. The algorithm takes other considerations into account, for example how certain pairs of letters, like “c” and “l,” can join to look like a third letter (“d”), as in the case of “close” and “dose.”

Employing these scores and considerations, the algorithm computes the “cost” of transforming one string of characters into another, such as “opel” into “apple.” Lower cost means higher visual similarity. The algorithm then adjusts for the relative lengths of the two strings (different lengths increase their distinctiveness) and converts the final cost into a percent similarity.

ICANN is considering future enhancements to the algorithm, such as having it check for visual confusion between existing domains and future planned Internet top-level domain names in scripts such as Cyrillic.

Source: National Institute of Standards and Technology

Explore further: Portable holographic microscope makes field diagnosis possible

Related Stories

300 neurons traced in extensive brain wiring map

October 30, 2017

A vast effort by a team of Janelia Research Campus scientists is rapidly increasing the number of fully-traced neurons in the mouse brain. Researchers everywhere can now browse and download the 3-D data.

New algorithms improve automated image labeling

March 30, 2007

A Google image search for "tiger" yields many tiger photos – but also returns images of a tiger pear cactus stuck in a tire, a racecar, Tiger Woods, the boxer Dick Tiger, Antarctica, and many others. Why? Today’s large ...

Recommended for you

Volvo to supply Uber with self-driving cars (Update)

November 20, 2017

Swedish carmaker Volvo Cars said Monday it has signed an agreement to supply "tens of thousands" of self-driving cars to Uber, as the ride-sharing company battles a number of different controversies.

New method analyzes corn kernel characteristics

November 17, 2017

An ear of corn averages about 800 kernels. A traditional field method to estimate the number of kernels on the ear is to manually count the number of rows and multiply by the number of kernels in one length of the ear. With ...

0 comments

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.