Andere Kunden interessierten sich auch für
![Multiple pattern multiple (2^n) shaft parallel string matching]( "Multiple pattern multiple (2^n) shaft parallel string matching")
Multiple pattern multiple (2^n) shaft parallel string matching42,99 €![Python Programming]( "Python Programming")
Python Programming51,99 €![Using Roget¿s Thesaurus to Determine the Similarity of Texts]( "Using Roget¿s Thesaurus to Determine the Similarity of Texts")
Using Roget¿s Thesaurus to Determine the Similarity of Texts51,99 €![Similarity and Diversity: Two Sides of the Same Coin in Data Analysis]( "Similarity and Diversity: Two Sides of the Same Coin in Data Analysis")
Similarity and Diversity: Two Sides of the Same Coin in Data Analysis42,99 €![Parallel approach to string matching with n-folded mechanisms]( "Parallel approach to string matching with n-folded mechanisms")
Parallel approach to string matching with n-folded mechanisms42,99 €![A study on semantic similarity and its application to clustering]( "A study on semantic similarity and its application to clustering")
A study on semantic similarity and its application to clustering44,99 €![From Possibilistic Similarity Measures to Possibilistic Decision Trees]( "From Possibilistic Similarity Measures to Possibilistic Decision Trees")
From Possibilistic Similarity Measures to Possibilistic Decision Trees44,99 €
Revision with unchanged content. In times of worldwide globalisation the knowledge of useful information is becoming increasingly important. Parallel to genetic engineering, the expansion of the Internet produces similar volumes of data - frequently saved in text files. One of the most relevant intersection is the usage of approximate string matching in large text data. The Internet has to face the challenge of not only to concentrating on request times but also finding more context-relevant information. Associated with this aim, further steps in this field have to take into consideration that documents can include mistakes in orthography or words being abbreviated. Other areas of information are substituted with their acronyms or are less important and can be ignored. All of these tasks are united in the fields of computational linguistics. This master thesis shows stepwise the tokenising of real text, the homogenisation of words, and the storage in a specific index structure for subsequent approximate string matching - in consideration of secondary storage. A prototype programmed in Java completes the current work.