Chandrasekar, R.; Srinivas, B.: Automatic induction of rules for text simplification (1997)
0.00
0.0018428253 = product of:
0.0036856506 = sum of:
0.0036856506 = product of:
0.0073713013 = sum of:
0.0073713013 = weight(_text_:a in 2873) [ClassicSimilarity], result of:
0.0073713013 = score(doc=2873,freq=6.0), product of:
0.04772363 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.041389145 = queryNorm
0.1544581 = fieldWeight in 2873, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=2873)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Explores methods to automatically transform sentences in order to make them simpler. These methods involve the use of a rule-based system, driven by the syntax of the text in the domain of interest. Hand-crafting rules for every domain is time-consuming and impractical. Describes an algorithm and an implementation by which generalized rules for simplification are automatically induced from annotated training materials using a novel partial parsing technique, which combines constituent structure and dependency information. The algorithm employs example-based generalisations on linguistically motivated structures
- Type
- a
