1 |
Calculating the optimal step of arc-eager parsing for non-projective trees
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Transition-based dependency parsing as latent-variable constituent parsing
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Count-based state merging for probabilistic regular tree grammars
|
|
|
|
BASE
|
|
Show details
|
|
11 |
Computation of infix probabilities for probabilistic context-free grammars
|
|
|
|
BASE
|
|
Show details
|
|
12 |
Splittability of bilexical context-free grammars is undecidable
|
|
|
|
BASE
|
|
Show details
|
|
13 |
Prefix probabilities for linear context-free rewriting systems
|
|
|
|
BASE
|
|
Show details
|
|
14 |
Tree parsing with synchronous tree-adjoining grammars
|
|
|
|
Abstract:
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous tree adjoining grammars, partial solutions to this problem have been described, some being restricted to the unweighted case, some to the monolingual case. We introduce a formulation of this class of grammars which is effectively closed under input and output restrictions to regular tree languages, i.e., the restricted translations can again be represented by grammars. Moreover, we present an algorithm that constructs these grammars for input and output restriction, which is inspired by Earley’s algorithm. ; Postprint
|
|
Keyword:
Natural language processing; Parsing algorithms; QA75; QA75 Electronic computers. Computer science
|
|
URL: http://hdl.handle.net/10023/2438 http://aclweb.org/anthology/W/W11/W11-2903.pdf
|
|
BASE
|
|
Hide details
|
|
15 |
Parsing of partially bracketed structures for parse selection
|
|
|
|
BASE
|
|
Show details
|
|
16 |
Automatic creation of interlinear text for philological purposes
|
|
|
|
BASE
|
|
Show details
|
|
|
|