Sciweavers

58 search results - page 6 / 12
» Sentence compression by structural conversion of parse tree
Sort
View
ACL
2009
14 years 7 months ago
Topological Field Parsing of German
Freer-word-order languages such as German exhibit linguistic phenomena that present unique challenges to traditional CFG parsing. Such phenomena produce discontinuous constituents...
Jackie Chi Kit Cheung, Gerald Penn
61
Voted
COLING
2010
14 years 4 months ago
Automatic Treebank Conversion via Informed Decoding
In this paper, we focus on the challenge of automatically converting a constituency treebank (source treebank) to fit the standard of another constituency treebank (target treeban...
Muhua Zhu, Jingbo Zhu
IBPRIA
2003
Springer
15 years 2 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
84
Voted
ACL
2000
14 years 11 months ago
An Improved Parser for Data-Oriented Lexical-Functional Analysis
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...
Rens Bod
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...