[PDF] Top 20 Efficient Parsing for Transducer Grammars
Has 10000 "Efficient Parsing for Transducer Grammars" found on our website. Below are the top 20 most common "Efficient Parsing for Transducer Grammars".
Efficient Parsing for Transducer Grammars
... these grammars into Chomsky normal form, which CKY ...cause transducer rules are very flat and contain spe- cific lexical items, binarization introduces a large number of intermediate grammar ...affect ... See full document
9
Efficient Parsing of Highly Ambiguous Context Free Grammars with Bit Vectors
... Viterbi parsing involves four steps. About 15 % of the parse time is needed for building the chart, 28 % for filtering, and 57 % for the computation of the Viterbi probabilities. The time required for the ex- ... See full document
7
Transforming trees into hedges and parsing with “hedgebank” grammars
... hedge parsing as an approach to recover- ing constituents of length up to some max- imum span ...for efficient segmentation strategies prior to ...shallow parsing methods, hedge parsing yields ... See full document
6
Parsing with Compositional Vector Grammars
... language parsing has typically been done with small sets of discrete cat- egories such as NP and VP, but this rep- resentation does not capture the full syn- tactic nor semantic richness of linguistic phrases, and ... See full document
11
Wide Coverage Neural A* Parsing for Minimalist Grammars
... realistic parsing tasks (see M¨uller 2016 for ...Minimalist Grammars (MG) formalism, which is a rigorously formal, computationally oriented and polynomi- ally parseable interpretation of mainstream MP that ... See full document
20
A Tree Transducer Model for Synchronous Tree Adjoining Grammars
... Obviously, our characterization can be applied in a toolkit for extended tree transducers (or STSG) such as T IBURON by May and Knight (2006) to simulate STAG. The existing infrastructure (input- output, derivation ... See full document
10
Graph parsing with s graph grammars
... graph parsing algorithms (top- down and bottom-up) for s-graph ...graph grammars are equivalent to HRGs, but em- ploy a more fine-grained perspective on graph- combining ...the parsing algorithms, ... See full document
10
Tree Parsing with Synchronous Tree Adjoining Grammars
... context-free grammars (SCFG) that derive pairs of translationally equivalent ...tree-adjoining grammars (STAGs) (Abeille et ...tree-substitution grammars (STSGs) and synchronous tree-insertion ... See full document
12
Guaranteeing Parsing Termination of Unification Grammars
... In this paper we compare several variants of the OLP constraint for the first time. We give sketches of proofs of undecidability of three OLP conditions, full proofs along with undecidability proofs of other conditions ... See full document
7
An Efficient Parsing Algorithm for Tree Adjoining Grammars
... It is obvious that this invariant consisting of the nonterminal in a cell of the triangle matrix to represent the context-free invariant, the pointers to elementary trees, and the foot n[r] ... See full document
8
Nonparametric Bayesian Inference and Efficient Parsing for Tree adjoining Grammars
... and efficient, and prove its superiority against the local Gibbs sam- pling ...improved parsing performance. TAG achieves this by using more compact grammars than TSG and by providing the ability to ... See full document
7
Macro Grammars and Holistic Triggering for Efficient Semantic Parsing
... macro grammars to cache the abstract patterns of useful log- ical forms found thus far, and holistic trig- gering to efficiently retrieve the most rele- vant patterns based on sentence ... See full document
10
Efficient Parsing for Bilexical Context Free Grammars and Head Automaton Grammars
... For a common special case that was known to allow On 3 parsing Eisner, 1997, we present an On 3 algorithm with an improved grammar constant.. Lexicalized grammar formalisms are of both t[r] ... See full document
8
Modularizing Codescriptive Grammars for Efficient Parsing
... Modularizing Codescriptive Grammars for Efficient Parsing Modularizing Codescriptive Grammars for Efficient Parsing* W a l t e r K a s p e r a n d H a n s U l r i c h K r i e g e r G e r m a n R e s e[.] ... See full document
6
Two Recent Developments in Tree Adjoining Grammars: Semantics and Efficient Processing
... Two Recent Developments in Tree Adjoining Grammars Semantics and Efficient Processing Two Recent Developments in Tree Adjoining Grammars Semantics and Efficient Processing Yves Schabes Aravind K Joshi[.] ... See full document
6
Joshua 4 0: Packing, PRO, and Paraphrases
... Recently English-to-English text generation tasks have seen renewed interest in the NLP commu- nity. Paraphrases are a key component in large- scale state-of-the-art text-to-text generation systems. We present an ... See full document
9
Practical Parsing of Generalized Phrase Structure Grammars
... Note that, in any given grammar, the depth of the tree induced by a category valued feature is finite; further- more, the range o f possible values of a category valued feature is known [r] ... See full document
10
Polynomial Time Parsing of Combinatory Categorial Grammars
... Hence the shared forest representation we build is polynomial with respect to the length of the input, n, despite the fact that the number of derivations trees could be exponential... We[r] ... See full document
8
Dictionaries, Dictionary Grammars and Dictionary Entry Parsing
... Tokenization reaks the source character stream into a mixture of tokens and strings; the former embody the notational conventions employed by the printed dictionary, and are used by tlae[r] ... See full document
11
Restriction and Termination in Parsing with Feature Theoretic Grammars
... The class of grammars Shieber describes might be termed top-down path building gram- mars, because they are grammars in which the length of a path through the graph increases as one desc[r] ... See full document
12
Related subjects