Nomoto, T.: Discriminative sentence compression with conditional random fields (2007)
0.00
0.0027484642 = product of:
0.0054969285 = sum of:
0.0054969285 = product of:
0.010993857 = sum of:
0.010993857 = weight(_text_:d in 945) [ClassicSimilarity], result of:
0.010993857 = score(doc=945,freq=2.0), product of:
0.08729101 = queryWeight, product of:
1.899872 = idf(docFreq=17979, maxDocs=44218)
0.045945734 = queryNorm
0.1259449 = fieldWeight in 945, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.899872 = idf(docFreq=17979, maxDocs=44218)
0.046875 = fieldNorm(doc=945)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The paper focuses on a particular approach to automatic sentence compression which makes use of a discriminative sequence classifier known as Conditional Random Fields (CRF). We devise several features for CRF that allow it to incorporate information on nonlinear relations among words. Along with that, we address the issue of data paucity by collecting data from RSS feeds available on the Internet, and turning them into training data for use with CRF, drawing on techniques from biology and information retrieval. We also discuss a recursive application of CRF on the syntactic structure of a sentence as a way of improving the readability of the compression it generates. Experiments found that our approach works reasonably well compared to the state-of-the-art system [Knight, K., & Marcu, D. (2002). Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence 139, 91-107.].
