This demo shows Celatro's ability to quickly process text to deliver similarity measures using sophisticated inexact-matching algorithms (including Proximity, Levenshtein, Damerau, Episode Distance, Soundex, Hamming, and Wildcard).

Instructions

To use this demo, first choose a language from the drop-down menu provided below, then use the following controls to specify the text you wish to see searched and the algorithm you wish to use:

• Use Demo File: Select a demo file from a drop-down list offering three great works of the current language’s literature.
• Upload File: Specify a URL or browse to a specific folder and file (text, xml, html or rtf files only; must be smaller than 2 MB).
• Specify an URL: Specify any document you can locate using an URL.
• Write Some Text: Type or paste text to be tokenized.
• Pattern: Type or paste a search pattern, and then use the adjacent drop-down menu to select the desired algorithm.
• Select Encoding: Depending on your previous choices, you might also need to select the encoding you wish applied from a drop-down list: UTF-8 or UTF-16.

After configuring your search and clicking Submit, scroll down to view the results page, which will show the outcome of the inexact match search: a) the found text, b) its relevancy (a number indicating the similarity between the original search pattern and the text), c) the count of occurrences in the file, and d) a View link that will redirect your browser to a page that shows the context for the found text.