Text Retrieval Techniques for Searching Documents: Counting Occurrences, Searching Single Words and Phrases

Data Structure

Contents
Introduction................................................................................................................................2
Count The Number of Occurrence Word...................................................................................2
Searching for a Single Word :....................................................................................................2
Searching the Prefix Word.........................................................................................................2
Search for a Phrase, is Sequence of Words that are Comtigous................................................3
Output Screenshots.....................................................................................................................3
Conclusion................................................................................................................................10
References................................................................................................................................11

Introduction
The main aim of this project that has been developed on the Techniques of text retrievals for
searching the document or a collection of full text search database. The searching on the word
are remotely accessible for that the program let you do the Searching is a common process of
many applications with the textual searches being a very common type of search of the
keyword searches for the information on the document. There are several types of the
searching keywords like searches may cover title of documents, and each word of the
document, and each paragraph of the searching on the documents. The each word is should
be search of the document using the Search tag box. The textual application of the words in
which involves of the number of documents to the large word searching is the potentially, or
the quality of searching word of the index search page. The textual application of the data
structure that has been used for the full text searching is divided into two tasks: indexing and
Searching. The indexing stage of the all document it will be scan the text, and the list of
search items to be builder (often called an index, but more correctly named a concordance).In
the searching of the indexing stage will be performing on the original document of the text it
will index of refer of the referenced rather than the text of the word in specific query of the
database structure in the document information.
Count The Number of Occurrence Word
The count the number of occurance words that can used for the strings you are given a
string and a word your task is that count the number of the occurrence of the given word in
the string and print the number of occurrence of the word [8].To add or remove word count
from the Status Bar, right click on the Status Bar and either check or uncheck the box next to
Word Count [5]. This word count is the total number of words in the entire document.Count
Of A Specific Word. To count the number of occurrences of a specific word in your
document, you have to get sneaky. Press ctrl-F to open up the navigation pane and then type
the word or phrase you want to count. Not only will Word find all occurrences of the word or
phrase, it will diaply the count, too of the textual application.
Searching for a Single Word :
The searching for a single word works that can be developed in the simplest search in
a single word that you think appears in the document your are looking for the application
textual file of the document. The searching of the single word it will searches for the set of

whole document of the textual application.The searching of the word in which invloved in the
two word or connected to the intermidator word of the phrases. The searching for the sigle
word of the whole document in which contain the to find the word in enter the search box
then locate the index pages. if the word is available of the document is successful to display
of the index page. for example, The instance of the word to searching for the whole document
"twin" in an article of the file doucment it should be reading in the single word file of the
whole database system.
Searching the Prefix Word
The prefix search is used for the note that the The keyword of the prefix search in
which used for the nots on the before word base on the whole textual application. The
morephemes in linguistics, that can used for the root word on the meaning of the each word.
its what's left after you remove all the prefixes like "un-" or "anti-" to searching the words of
the textual application of the file system. A prefix word it should contains the group of whole
document letters that are placed before the root of the searching word. for example of the
keyword on prefix is likewise, "happy" that contains the root word of the document and
"unhappy" that means "not happy" given set of word its displayed on the textual application.
In this searching the word does not contain a prefix that means 'not' as virtually every
participant knew. Rather, the prefix denotes 'in, within, inside'. This word has an assimilated
form of in- (in this case, im-) which might account for the 38 incorrect responses [3].Find all
the words that start with the same prefix o the whole document of the textual application.
Search for a Phrase, is Sequence of Words that are Comtigous
The text file is to be able to incroporate word of the sequence of information in which
contains the document if of the searching keywords that are refers to the matrix of the data
structre in the algorithm identify the multi phases abd the summarise test of the vertices in the
top of the keywords appear as adjacent in the text in the words are tokenized and annotated
with the parts if speech tags. The document in which include the set of whole word and the
searching the given word it will be matches on the whole word and if the word is avaiable of
the contains the specified phrase of the textual application file system. Let us for example
documents that are likewise, shakespare ti write the text file to searching the each words of