Sentence Compression as Tree Transduction
–Journal of Artificial Intelligence Research
This paper presents a tree-to-tree transduction method for sentence compression. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of the tree topology and can thus naturally capture structural mismatches. We describe an algorithm for decoding in this framework and show how the model can be trained discriminatively within a large margin framework. Experimental results on sentence compression bring significant improvements over a state-of-the-art model.
Journal of Artificial Intelligence Research
Apr-24-2009
- Country:
- Oceania > Australia
- New South Wales > Sydney (0.04)
- North America
- United States
- Washington > King County
- Seattle (0.04)
- Pennsylvania > Philadelphia County
- Philadelphia (0.14)
- New York > Monroe County
- Rochester (0.04)
- Michigan > Washtenaw County
- Ann Arbor (0.04)
- Massachusetts > Suffolk County
- Boston (0.04)
- Maryland > Montgomery County
- Gaithersburg (0.04)
- Colorado > Denver County
- Denver (0.04)
- California > San Diego County
- San Diego (0.04)
- Washington > King County
- Canada > Alberta
- United States
- Europe
- United Kingdom > England
- Greater Manchester > Manchester (0.04)
- Spain
- Canary Islands > Gran Canaria (0.04)
- Catalonia > Barcelona Province
- Barcelona (0.04)
- Norway > Western Norway
- Italy > Trentino-Alto Adige/Südtirol
- Trentino Province > Trento (0.04)
- Germany > North Rhine-Westphalia
- Cologne Region > Bonn (0.04)
- France > Occitanie
- Haute-Garonne > Toulouse (0.04)
- Finland > Uusimaa
- Helsinki (0.04)
- Denmark > Capital Region
- Copenhagen (0.04)
- United Kingdom > England
- Asia
- Oceania > Australia
- Genre:
- Research Report > New Finding (0.68)
- Industry:
- Education (0.46)
- Technology: