Parse CreateXMLDoc

Tài liệu Báo cáo khoa học: "Cross-lingual Parse Disambiguation based on Semantic Correspondence" pptx

Tài liệu Báo cáo khoa học:
... versa, which allows for disambiguation of phenomena which are ambiguous in only one of the languages We use the above observations for cross-lingual parse disambiguation We experimented with ... and optimize the parameters such as disambiguation precision vs amount of disambiguation As no language-specific assumptions are hard coded in our disambiguation system, it would be very interesting ... relations (corresponding to quantifiers), or a predicateargument structure which is composed of several relations During alignment, we only consider nonatomic EPs, as quantifiers should be considered...
  • 5
  • 118
  • 0

Tài liệu Báo cáo khoa học: "Convolution Kernel over Packed Parse Forest" pdf

Tài liệu Báo cáo khoa học:
... discussion on the covered feature space, fractional count, feature value and the forest kernel function itself 3.1 Packed forest of parse trees Informally, a packed parse forest, or (packed) forest ... Convolution Kernel over Parse Tree Convolution kernel was proposed as a concept of kernels for discrete structures by Haussler (1999) and related but independently conceived ideas on string kernels ... single parse tree and data sparseness In this paper, we present a convolution kernel over Convolution Kernel over Forest In this section, we first illustrate the concept of packed forest and then...
  • 11
  • 135
  • 0

Tài liệu Báo cáo khoa học: "A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles" ppt

Tài liệu Báo cáo khoa học:
... encodings of parse tree paths based on two constituency parsers and a dependency parser Despite our expectations that the semantic richness of dependency parses would yield paths that outperformed ... Alternative Parse Tree Paths Parse tree paths were introduced by Gildea & Jurafsky (2002) as descriptive features of the syntactic relationship between predicates and arguments in the parse tree ... single node in the parse tree A parse tree path can be described as a sequence of transitions up and down a parse tree from the Figure An example dependency parse, with a parse tree path from the...
  • 8
  • 115
  • 0

Tài liệu Báo cáo khoa học: "Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches" pptx

Tài liệu Báo cáo khoa học:
... only original sentences are parsed, and the parse trees of compressed sentences are extracted from the original parse trees An example of this method is shown in Figure The original sentence is ... goal sentence length for summaries In the first experiment, the system was given only a sentence and no sentence length information The sentence compression problem without the length information ... Noisy-Channel Model for Sentence Compression B D Knight and Marcu proposed a sentence compression method using a noisy-channel model (Knight and Marcu, 2000) This model assumes that a long sentence was...
  • 8
  • 62
  • 0

Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx

Tài liệu Báo cáo khoa học:
... our full integrated heuristic scheme for selecting the best parse out-performs the simple heuristic, that considers only the number of words skipped With the simple heuristic, good/close parses ... optimization techniques for this task The fragmentation of the parse analysis The statistical score of the disambiguated parse tree The Parse Quality Heuristic The penalty scheme for skipped words ... would follow the parser, we have attempted to partially handle this problem using a simple filtering scheme The filtering scheme' s task is to classify the parse chosen as best by the parser into one...
  • 3
  • 110
  • 0

Tài liệu Báo cáo khoa học: "Learning Parse and Translation Decisions From Examples With Rich Context" pdf

Tài liệu Báo cáo khoa học:
... parser, we also added a version that let our system start with the correct parse, effectively just testing the transfer and generation module The resulting translations, in randomized order and ... enters parse action commands by either confirming what the system proposes or overruling it by providing the proper action As the corpus of parse examples grows and the system is trained on more and ... 'process verb', or 'adjective', with more depth used only in concept areas more relevant for making parse and translation decisions, such as temporal, spatial and animate concepts A subcategorization...
  • 8
  • 213
  • 0

Báo cáo khoa học: "Creating a Corpus of Parse-Annotated Questions" docx

Báo cáo khoa học:
... 498 Algorithm Induce a parse-annotated treebank from raw data repeat Parse a new section of raw data Manually correct errors in the parser output Add the corrected data to the training set Extract ... a new grammar for the parser until All the data has been processed were being produced at an average rate of 40 trees per day During the later stages of the project this had changed dramatically ... question material is described in Judge et al (2005) The research established that even a small amount of additional training data can give a substantial improvement in question analysis in terms of...
  • 8
  • 146
  • 0

Báo cáo khoa học: "The utility of parse-derived features for automatic discourse segmentation" doc

Báo cáo khoa học:
... algorithm, since this forms the basis of our features The SPADE features are based on productions extracted from full syntactic parses of the given sentence The primary feature for a discourse boundary ... the RST-DT not correspond to a well-formed subtree in the human annotated discourse parse for that document Therefore, to perform accurate and efficient parsing of the RST-DT at the paragraph level, ... context-free derived features We investigate the impact on discourse segmentation performance when one feature set is used versus another, in such a way establishing the utility of features derived...
  • 8
  • 119
  • 0

Báo cáo khoa học: "Data-Defined Kernels for Parse Reranking Derived from Probabilistic Models" docx

Báo cáo khoa học:
... accuracy of the probabilistic model alone Kernels Derived from Probabilistic Models In recent years, several methods have been proposed for constructing kernels from trained probabilistic models ... is then derived from this trained model in such a way as to maximize its usefulness for reranking We performed experiments on parse reranking using a neural network based statistical parser as ... paper proposes a method for deriving a kernel for reranking from a probabilistic model, and demonstrates state-of-the-art accuracy when this method is applied to parse reranking Contrary to most...
  • 8
  • 116
  • 0

Báo cáo khoa học: "Boosting-based parse reranking with subtree features" docx

Báo cáo khoa học:
... it can use the all-subtrees representation without loss of efciency RankBoost with subtree features A simple question related to kernel-based parse reranking asks whether all subtrees are really ... extremely sparse solution and automatically eliminates redundant subtrees With the DOP methods, (Bod, 2001) also employs constraints (e.g., depth of subtrees) to ả We ran these tests on a Linux PC with ... distinct parses The log probability from the CRFs shallow parser was incorporated into the reranking Following (Collins, 2000), the training set was split into portions, and the CRFs shallow parser...
  • 8
  • 108
  • 0

Báo cáo khoa học: "Structural Correspondence Learning for Parse Disambiguation" pot

Báo cáo khoa học:
... the first parse for each sentence; oracle represents the accuracy achieved by a model that always selects the best parse from the set of potential parses (within the coverage of the parser) In ... layer of abstraction, which, we hypothesize, aligns well with the task of parse disambiguation: we first parse the unlabeled data In this way we obtain full parses for given sentences as produced ... scenario Therefore, the direction we explore in this study is semi-supervised domain adaptation for parse disambiguation We examine the effectiveness of Structural Correspondence Learning (SCL)...
  • 9
  • 123
  • 0

Báo cáo khoa học: "Computing Confidence Scores for All Sub Parse Trees" pot

Báo cáo khoa học:
... in the hypothesis parse trees Finally, we extract parse sub- trees from these hypothesis parse trees Based on the gold parse trees, a parse sub- tree is labeled with (correct), if it has all the ... dependency relations for all the levels of a given sub- tree For example, given the sub- tree in Figure 3, (NCOMP, N, NMOD, N, NMOD, N, POBJ, ADV, NMOD, N) is the ML-JHD feature for the top node (marked ... categories from the parse sub- trees Among all the parse trees in the test data, 82.84% (first two rows) have a length equal to or shorter than 10 words We converted the original parse sub- trees from...
  • 4
  • 58
  • 0

Báo cáo khoa học: "A Lazy Way to Chart-Parse with Categorial Grammars" ppt

Báo cáo khoa học:
... brackets to def'me sets, and we notate features as [label value] We refer to variables with symbols starting with capital letters, and to labels and constants with symbols starting with lower-case ... John, (18), with loves, (14), to obtain John loves, (19), and has then applied that to Mary, (12), to obtain John loves Mary (22), ignoring the other analysis If the parser rams out to need the ... generator of the S Note that Reducing would potentially have allowed a third new active edge corresponding to loves Mary to be added by Reducing the new active NP edge corresponding to Mary with...
  • 8
  • 83
  • 0

Báo cáo khoa học: "Rich bitext projection features for parse reranking" potx

Báo cáo khoa học:
... word alignment of the bitext, the system performs the following steps for each English sentence to be parsed: (i) run BitPar trained on English to generate 100best parses for the English sentence ... constituent (XP1 POSParents and get a value of 0.27 for parse CC XP2) in English that is projected to a German and 0.11 for parse The lower value for parse coordination, we expect the English and German ... German parse the compound noun is POS-tagged as an NNS and the parent is an NP The probabilities considered for the two English parses are p(NP|NNS, NP) for “fruit” in both parses, p(VP|NNS, NP) for...
  • 9
  • 117
  • 0

Báo cáo khoa học: "How to Parse Gaps in Spoken Utterances" docx

Báo cáo khoa học:
... island parsing schemes-(e.g Woods 1976) In order to process defective input data, the parser must be able to start its operation at any point within the chart In general, our main parsing direction ... proceeding in the usual way from left to right, this information is already attached to their corresponding active edges ScanTasks, which are seeking to the left of the island, access information ... well known by investigations on During parsing, GLP assigns scores to phrases We are currently developing an explicit focussing strategy which is similar to Woods' (1982) Shortfall Scoring method...
  • 3
  • 79
  • 0

Xem thêm

Nạp tiền Tải lên
Đăng ký
Đăng nhập