Samples of WordScope Service

Currently, there are three services term retrieval services: prefix, match, and distance and one subsequence service. See below for descriptions.

Two Test Areas are provided below to demonstrate using the WordScope RESTful services.

The samples use a dictionary of nouns extracted from WordNet.

Words for Prefix

The first sample demonstrates the retrieval of a set of terms with a common prefix. All terms within the dictionary beginning with the prefix will be returned.

Choose Prefix in the Word Search Type drop down to use this service.

Matching Terms

The second sample demonstrates the retrieval of a set of terms matching the pattern entered. The pattern is a mix of fixed and/or wildcard (~) characters.

Similar / Distance

The third sample demonstrates the retrieval of a set of terms similar to the term entered. Similar is defined by the edit distance between the edit term and candidate terms. Terms will be returned with an edit distance less than or equal to the Max Edit Distance. Edit distance is the the number of edits required to convert one term into another.

Word Retrieval Test Area
Instructions

Choose the desired search type and enter the term into the Pattern area. After two characters have been entered, the query will be executed as the pattern changes. Results will be displayed to the right as the query executes.

As the result set may be large, it is limited to a window size of 100 terms. To page through the results, change the Offset value in the Window subsection. The window size can be set to a size smaller than 100, but any size greater than 100 will be ignored.

Similar Word Search has an additional query parameter: Max Edit Distance. The larger the value, the more results will be returned as this allows for a larger number of edits between the query term and all candidates.

Word Search Type:
Pattern:
Total Result Count:
Returned Count:
Window:
Offset:
Size:
Similar Word List Options:
Max Edit Distance:
Subsequence Test Area
Instructions

Enter two sequences and select the Find LCS button to find a Longest Common Subsequence (LCS) between the two sequences.

Sequence 1:
Sequence 2: