Name
Abstract | ||
|---|---|---|
Sentence compression is a task of generating a grammatical short sentence from an original sentence, retaining the most important information. The existing methods of removing the constituents in the parse tree of an original sentence cannot deal with recursive structures which appear in the parse tree. This paper proposes a method to remove such structure and generate a grammatical short sentence. Compression experiments have shown the method to provide an ability to sentence compression comparable to the existing methods and generate good compressed sentences for sentences including recursive structures, which the previous methods failed to compress. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89197-0_14 | PRICAI |
Keywords | Field | DocType |
grammatical short sentence,removing recursive structure,existing method,compression experiment,recursive structure,previous method,parse tree,sentence compression,important information,original sentence,text summarization | Parse tree,Computer science,Balanced sentence,Sentence compression,Phrase structure rules,Natural language processing,Artificial intelligence,Recursion,Automatic summarization,Pattern recognition,Speech recognition,Sentence,Fold (higher-order function) | Conference |
Volume | ISSN | Citations |
5351 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seiji Egawa | 1 | 1 | 1.04 |
| Yoshihide Kato | 2 | 22 | 8.15 |
| Shigeki Matsubara | 3 | 179 | 43.41 |