**Báo cáo khoa học: "An Improved Heuristic for Ellipsis Processing*" ppt**

Báo cáo khoa học: "An Improved Heuristic for Ellipsis **Processing*" ppt**

... An Improved Heuristic for Ellipsis Processing* Ralph M. Welschedel Department of Computer & Information Sciences University of Delaware Newark, ... will be formally equivalent in predictive power to a grammar for ellipti- cal forms. Though the heuristic is independent of the individual grammar, designating expansion paths and transformations ... Hendrix et al., 1978; Kwasny and Sondheimer, 1979) include heuristics for replacement and repetition ellipsis, but not expansion ellipsis. One general strategy has been to substitute fragments...

Tài liệu Báo cáo khoa học: "An Improved Parser for Data-Oriented Lexical-Functional Analysis" doc

... An Improved Parser for Data-Oriented Lexical-Functional AnalysisRens BodInformatics Research Institute, University of Leeds, Leeds LS2 9JT, UK, &Institute for Logic, Language ... frag-ment size is confirmed for LFG-DOP; (3) LFG-DOP's relative frequency estimator performsworse than a discounted frequency estimator; and(4) LFG-DOP significantly outperforms Tree-DOP if evaluated ... if larger fragments are taken into account(Bod 1998), is confirmed for LFG-DOP. Wereport on an improved search technique for estimating the most probable analysis. While aMonte Carlo search...

Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspeciﬁed Representations" pdf

... 1 for the entire graph G. Afterthis deletion, the splits for G with root fragments2 and 3 are still eliminable; so we can e.g. deletethe split for 3. At this point, only one split is left for ... by checking each split for eliminability before it is added to the chart.We compare the performance of this algorithm tothe baseline of computing the complete chart. For comparison, we have ... ACL, pages 409–416,Sydney, July 2006.c2006 Association for Computational LinguisticsAn Improved Redundancy Elimination Algorithm for Underspeciﬁed RepresentationsAlexander Koller and Stefan...

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

... fea- tures are designed to be general and, for the most part, grammar and domain independent. For each parse, the heuristic computes a penalty score for each of the fea- tures. The penalties ... recent work on de- veloping an integrated heuristic scheme for selecting the parse that is deemed "best" from such a collection. We describe the heuristic measures used and their combi- ... AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION Alon Lavie School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh, PA 15213...

Báo cáo khoa học: "An Improved Extraction Pattern Representation Model for Automatic IE Pattern Acquisition" ppt

... approaches have been described for the automatic unsupervised acquisi-tion of patterns for information extraction.Each approach is based on a particularmodel for the patterns to be acquired, ... theproposed Subtree model outperforms the previousmodels.Section 2 describes the Subtree model for extrac-tion pattern representation. Section 3 shows themethod for automatic acquisition. Section ... to a given scenario. Therefore, for high value, (triggered (explosion-OBJ)( C-DATE -ADV)) is ranked higher than (triggered ( C-DATE -ADV)) in the terrorism scenario, for example. Fig-ure 2 shows...

Báo cáo khoa học: "An Improved Error Model for Noisy Channel Spelling Correction" ppt

... Èg tÈs uÈu aÈa lÈlTo allow for richer contextualinformation, we expand each nonmatchsubstitution to incorporate up to N additionaladjacent edits. For example, for the firstnonmatch edit ... that assigns uniformprobability to all words in the dictionary. InTable 1 we show K-best results for differentmaximum context window sizes, withoutusing positional information. For instance,the ... channel model for spelling correction. This paperdescribes a new channel model for spelling correction, based on genericstring to string edits. Using this modelgives significant performanceimprovements...

Tài liệu Báo cáo khoa học: "An Unsupervised Model for Joint Phrase Alignment and Extraction" ppt

... method.636Figure 3: The phrase, block, and word alignments usedin heuristic phrase extraction.5.1 Heuristic Phrase ExtractionThe traditional method for heuristic phrase extrac-tion from word alignments exhaustively ... generates wordalignments. It should be noted that forcing align-ments smaller than the model suggests is only used for generating alignments for use in heuristic extrac-tion, and does not affect ... also be seen that combining phrase tablesfrom multiple samples improved the BLEU score for HLEN, but not for HIER. This suggests that for HIER, most of the useful phrase pairs discovered bythe...

Tài liệu Báo cáo khoa học: "An Ensemble Method for Selection of High Quality Parses" pdf

... clutter, for the ﬁlter f-score measure we use the maximumrecall (MR) baseline rather than the minimum length(ML) baseline, since the former outperforms the lat-ter. Thus, ML is only shown for the ... fromdifferent domains. For a test setting used byprevious work, we show an error reductionof 31% as opposed to their 20%.1 IntroductionMany algorithms for major NLP applications suchas information extraction ... normalizing oversentence lengths is less of a factor. For this reason,in this paper we present detailed graphs for the aver-age f-score. For completeness, Table 4 also providessome of the results...

Tài liệu Báo cáo khoa học: "An Approximate Approach for Training Polynomial Kernel SVMs in Linear Time" doc

... Association for Computational LinguisticsAn Approximate Approach for Training Polynomial Kernel SVMs in Linear Time Yu-Chieh Wu Jie-Chi Yang Yue-Shi Lee Dept. of Computer Science and Information ... methods, for example support vector machines (SVM) (Vapnik, 1995) are successfully applied to many natural language processing (NLP) problems. They yielded very competitive and satisfactory performance ... feature conjunctions. However, the training and testing time costs for polynomial kernel SVM is far slow than the linear kernel. For example, it took one day to train the CoNLL-2000 task with...

Tài liệu Báo cáo khoa học: "An Integrated Environment for Computational Linguistics Experimentation" pot

... that the LinguaStream platformpromotes the combination of purely declarativeformalisms (when GATE is mostly based on theJAPE language and NOOJ focuses on a uniqueformalism), and allows processing ... analy-sis models and methodological concerns. Finally,when other platforms usually enforce the use of adedicated document format, LinguaStream is ableto process any XML document. On the other ... (they provide a formalrepresentation for a linguistic phenomenon) andoperative (they can be considered as instructionsto drive a computational process).Moreover, the platform takes advantage...

Xem thêm