By Topic

Solution for String Matching Problem of Indian Alphabetical Letters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Adnan I. Al Rabea ; Al-Balqa Appl. Univ., Al salt, Jordan ; Mohammd Jaber ; A. V. Senthil Kumar

Handling the problem of finding all of the occurrences of a string in a given text is solved through using string matching techniques where string matching represents one of the major problems that should be solved by computer technologies. With regards to information retrieval, pattern matching was widely implemented as well as Web search engine. There are major and important tasks executed by string matching among it the following jobs: signal processing, speech and pattern recognition, library systems and web search engines as well as information retrieval. This paper proposes a new implementation in string matching to improve the search technique which takes advantages from building a table consists of two columns, the first one is the words lengths exists in the text and the second one is the start positions of each word classified by the same length. The algorithm performs preprocessing for the pattern and for the text before beginning to search.

Published in:

Computer Technology and Development, 2009. ICCTD '09. International Conference on  (Volume:2 )

Date of Conference:

13-15 Nov. 2009