Закрыт

auto-summarization tool

Abstract of the project

Auto-summarization is a technique used to generate summaries of electronic documents. This has some applications like summarizing the search-engine results, providing briefs of big documents that do not have an abstract etc. There are two categories of summarizers, linguistic and statistical. Linguistic summarizers use knowledge about the languange (syntax/semantics/usage etc) to summarize a document. Statistical ones operate by finding the important sentences using statistical methods (like frequency of a particular word etc). Statistical summarizers normally do not use any linguistic information.

In this project, an auto-summarization tool is developed using statistical techniques. The techniques involve finding the frequency of words, scoring the sentences, ranking the sentences etc. The summary is obtained by selecting a particular number of sentences (specified by the user) from the top of the list. It operates on a single document (but can be made to work on multiple documents by choosing proper algorithms for integration) and provides a summary of the document. The size of the summary can be specified by the user when invoking the tool. Pre-processing interfaces are there to handle the following document types: Plain Text, HTML, Word Document.

Keywords

Generic Technlogy keywords : Algorithm, Programming

Specific Technology keywords :C, C++, Java, C-Sharp

Project type keywords :Statistics, User Interface

Functional components of the project

Following is a list of the functional components of the tool.

1. Text pre-processor. This will work on the HTML or Word Documents and convert them to plain text for processing by the rest of the system.

2. Sentence separator. This goes through the document and separates the sentences based on some rules (like a sentence ending is determined by a dot and a space etc). Any other appropriate criteria might also be added to separate the sentences.

3. Word separator. This separates the words based on some criteria (like a space denotes the end of a word etc).

4. Stop-words eliminator. This eliminates the regular English words like ‘a, an, the, of, from..’ etc for further processing. These words are known as ‘stop-words’. A list of applicable stop-words for English is available on the Internet.

5. Word-frequency calculator. This calculates the number of times a word appears in the document (stop-words have been eliminated earlier itself and will not figure in this calculation) and also the number of sentences that word appears in the document. For example, the word ‘Unix’ may appear a total of 100 times in a document, and in 80 sentences. (Some sentences might have more than one occurrence of the word). Some min-max thresholds can be set for the frequencies (the thresholds to be determined by trial-and-error)

6. Scoring algorithm. This algorithm determines the score of each sentence. Several possibilities exist. The score can be made to be proportional to the sum of frequencies of the different words comprising the sentence (ie, if a sentence has 3 words A, B and C, then the score is proportional the sum of how many times A, B and C have occurred in the document). The score can also be made to be inversely proportional to the number of sentences in which the words in the sentence appear in the document. Likewise, many such heuristic rules can be applied to score the sentences.

7. Ranking. The sentences will be ranked according to the scores. Any other criteria like the position of a sentence in the document can be used to control the ranking. For example, even though the scores are high, we would not put consecutive sentences together.

8. Summarizing. Based on the user input on the size of the summary, the sentences will be picked from the ranked list and concatenated. The resulting summary file could be stored with a name like _summary.txt.

9. User Interface. The tool could use a GUI or a plain command-line interface. In either case, it should have

Квалификация: Программирование на С, Программирование на C++

Показать больше auto summarization tool, scoring algorithm auto summarization tool, auto summarization tool project, functional components auto summarization tool, sentence separator auto summarization tool java, project auto summarization, auto summarization tool html, statistical summarization auto summarization tool, functional components summarization tool, use case auto summarization tool, word search algorithms, use of algorithms in programming, use of algorithm in programming, use case types, use case components, types of search algorithms, types of algorithms in programming, types of algorithms, types of algorithm, type of algorithms, top statistics, top line applications, top algorithms, tool for programming, text search algorithms

О работодателе:
( 0 отзыв(-а, -ов) ) chennai, India

ID проекта: #1306206

3 фрилансеров(-а) в среднем готовы выполнить эту работу за $77

ruchir2504

Hi, I can get your work done in a matter of few hours. I will provide you with a quality code, rigorously tested. I'll provide you any further support required by you related to this project, anytime in future. Pleas Больше

$35 USD за 2 дней(-я)
(1 отзыв)
2.5
kevinorange27

HELLO SIR PLEASE CHECK PMB

$150 USD за 2 дней(-я)
(0 отзывов(-а))
0.0
eTechs

Hi, i can deliver you the required code. Plz see PMB for further details..

$45 USD за 1 день
(0 отзывов(-а))
2.5