[PDF] Top 20 Features for Phrase Structure Reranking from Dependency Parses
Has 10000 "Features for Phrase Structure Reranking from Dependency Parses" found on our website. Below are the top 20 most common "Features for Phrase Structure Reranking from Dependency Parses".
Features for Phrase Structure Reranking from Dependency Parses
... parse from the set of possible parses ...millions features) (Collins, 2000; Charniak and Johnson, ...non-local features as well because they decide at the sentence-level (Charniak and Johnson, ... See full document
6
A Method to Generate Simplified Systemic Functional Parses from Dependency Parses
... their features based on constituent position and lexico-grammatical re- ...Stanford Dependency Parser (SDP) offers a suitable backbone for bootstrapping mood ... See full document
10
Semantic Role Labeling Using Different Syntactic Views
... new features including fea- tures extracted from dependency parses, ii) performing feature selection and cali- bration and iii) combining parses obtained from semantic parsers ... See full document
8
Stacking of Dependency and Phrase Structure Parsers
... Phrase structure parsers use a PCFG to extract possible ...possible parses cannot be iterated through in practice, and they are usually pruned as a ...best parses according to the PCFG ... See full document
18
Learning to Map Dependency Parses to Abstract Meaning Representations
... the phrase of the head word node, and 2) the dependency node contains sufficient information for the extraction of rewrite ...the dependency parse side in ...noun phrase “Pierre Vinken, 61 ... See full document
6
ULISSE: an Unsupervised Algorithm for Detecting Reliable Dependency Parses
... follow from raw text features but rather from parse features, we evaluated the accuracy of parsed sentences that are not–shared by MST and DeSR top–lists selected by ...the parses is ... See full document
10
A Reranking Approach for Dependency Parsing with Variable-sized Subtree Features
... subtree features consider the preference of a node toward its dominated subtree—whether the subtree is likely to appear in a good ...the reranking framework, however, as we do not factorize a parse tree, we ... See full document
10
Automatic Detection and Classification of Social Events
... Apart from using kernels over de- pendency trees, Culotta and Jeffrey (2004) incorpo- rate features like words, part of speech (POS) tags, syntactic chunk tag, entity type, entity level, rela- tion argument ... See full document
11
Minimally Supervised Domain Adaptive Parse Reranking for Relation Extraction
... driven phrase structure grammar (HPSG) for ...best parses selected and ranked by a MaxEnt parse-ranking component, which had been trained on a more or less generic HPSG ...learned from the n ... See full document
11
Discriminative Reranking of Discourse Parses Using Tree Kernels
... Designing features capturing such global properties is however not trivial as it requires the selection of important DT ...patterns from an exponential fea- ture ...present reranking models for ... See full document
12
Phrase Dependency Machine Translation with Quasi Synchronous Tree to Tree Features
... result from an emphasis on generating the two ...alignment from nodes in the target tree to nodes in the source ...can phrase-based models like Moses (Koehn et al. 2007) and the phrase ... See full document
54
Improving Combinatory Categorial Grammar Parse Reranking with Dependency Grammar Features
... The oracle F-score (given a perfect reranker that always chooses the best n-best parse for a sentence) is used to measure the quality of n-best parses. Huang and Chiang (2005) describe efficient n-best parsing ... See full document
18
Online Large Margin Training of Dependency Parsers
... Our approach is related to those of Collins and Roark (2004) and Taskar et al. (2004) for phrase structure parsing. Collins and Roark (2004) pre- sented a linear parsing model trained with an aver- aged ... See full document
8
The Effect of Higher Order Dependency Features in Discriminative Phrase Structure Parsing
... possible parses, and outputs a forest, which is a set of rule production instances that can be used to make a parse for the given sentence, and which is significantly pruned compared to the entire space allowed by ... See full document
7
Generating Typed Dependency Parses from Phrase Structure Parses
... The dependency graph is a tree (a singly rooted di- rected acyclic graph with no ...typed dependency, which is then labeled with a name based on the word between the two dependencies (the word itself be- ... See full document
6
Dependency based empty category detection via phrase structure trees
... skeletal parses with reasonable accuracy with a simple pattern-matching algorithm in a postprocessing ...syntactic structure in the skeletal ...as features morpho- syntactic clues (passives, gerunds ... See full document
10
Realizing Universal Dependencies Structures
... R parses the orig- inal UD structure and builds the corresponding dependency tree which is then converted to a tree of constituents realized using JS R EAL B, 2 a web-based English and French ... See full document
9
Efficient Stacked Dependency Parsing by Forest Reranking
... and reranking systems comes from the correc- tion of coordination ...coordination structure are counted as ...non-local reranking is higher than that of local reranking, the results of ... See full document
12
Learning Reliability of Parses for Domain Adaptation of Dependency Parsing
... of dependency parsers exceeds 90% (for English), but it is still not sufficient for practical use in these NLP ...corpora. From this point of view, it is impor- tant to consider the following points to use a ... See full document
6
Automatic Translation of English Text to Indian Sign Language Synthetic Animations
... The input to the system is written English text which is parsed to get the phrase structure grammar representation of the sentence. The parsed sentence is then sent to the conversion module which reorders ... See full document
10
Related subjects