Báo cáo khoa học: "An Open-Source Package for Recognizing Textual Entailment" pdf

Tài liệu Báo cáo khoa học: "An Unsupervised Approach to Recognizing Discourse Relations" pdf

Tài liệu Báo cáo khoa học: "An Unsupervised Approach to Recognizing Discourse Relations" pdf

... Unsupervised Approach to Recognizing Discourse Relations Daniel Marcu and Abdessamad Echihabi Information Sciences Institute and Department of Computer Science University of Southern California 4676 Admiralty ... to a U.N. embargo. b. But states like Rwanda before its present crisis would still be able to legally buy arms. (1) a. South Africa can afford to forgo sales of guns and grenades b...
Ngày tải lên : 20/02/2014, 21:20
  • 8
  • 595
  • 0
Tài liệu Báo cáo khoa học: "An Unsupervised Model for Joint Phrase Alignment and Extraction" ppt

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

... framework for spec- ifying compositional nonparametric Bayesian models. Advances in Neural Information Processing Systems, 19:641. Philipp Koehn et al. 2007. Moses: Open source toolkit for statistical ... (θ|E, F). (1) If θ takes the form of a scored phrase table, we can use traditional methods for phrase-based SMT to find P (e|f , θ) and concentrate on creating a model for P (θ|E,...
Ngày tải lên : 20/02/2014, 04:20
  • 10
  • 641
  • 0
Tài liệu Báo cáo khoa học: "An Ensemble Method for Selection of High Quality Parses" pdf

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

... clutter, for the filter f-score measure we use the maximum recall (MR) baseline rather than the minimum length (ML) baseline, since the former outperforms the lat- ter. Thus, ML is only shown for the ... from different domains. For a test setting used by previous work, we show an error reduction of 31% as opposed to their 20%. 1 Introduction Many algorithms for major NLP applications s...
Ngày tải lên : 20/02/2014, 12:20
  • 8
  • 462
  • 0
Tài liệu Báo cáo khoa học: "An Approximate Approach for Training Polynomial Kernel SVMs in Linear Time" doc

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 Linguistics An 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 s...
Ngày tải lên : 20/02/2014, 12:20
  • 4
  • 416
  • 0
Tài liệu Báo cáo khoa học: "An Improved Parser for Data-Oriented Lexical-Functional Analysis" doc

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 Analysis Rens Bod Informatics Research Institute, University of Leeds, Leeds LS2 9JT, UK, & Institute for Logic, Language and ... frag- ment size is confirmed for LFG-DOP; (3) LFG- DOP's relative frequency estimator performs worse than a discounted frequency estimator; and (4) LFG-DOP significantly outperforms Tree- DOP if...
Ngày tải lên : 20/02/2014, 18:20
  • 8
  • 408
  • 0
Tài liệu Báo cáo khoa học: "An Integrated Environment for Computational Linguistics Experimentation" pot

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

... that the LinguaStream platform promotes the combination of purely declarative formalisms (when GATE is mostly based on the JAPE language and NOOJ focuses on a unique formalism), and allows processing ... analy- sis models and methodological concerns. Finally, when other platforms usually enforce the use of a dedicated document format, LinguaStream is able to process any XML document. On the o...
Ngày tải lên : 22/02/2014, 02:20
  • 4
  • 325
  • 0
Tài liệu Báo cáo khoa học: "An expressive formalism for describing tree-based grammars" docx

Tài liệu Báo cáo khoa học: "An expressive formalism for describing tree-based grammars" docx

... tree description and/or of semantic formu- las. The XMG formalism furthermore supports the sharing of identifiers across dimension hence al- lowing for a straightforward encoding of the syn- tax/semantics ... frame- work for the processing of linguistic meta- descriptions. 1 Introduction It is well known that grammar engineering is a complex task and that factorizing grammar in- formation...
Ngày tải lên : 22/02/2014, 02:20
  • 4
  • 328
  • 0
Tài liệu Báo cáo khoa học: "An annotation scheme for discourse-level argumentation in research articles" doc

Tài liệu Báo cáo khoa học: "An annotation scheme for discourse-level argumentation in research articles" doc

... work as basis of or support for own work? Figure 2: Decision tree for annotation Our materials consist of 48 computational lin- guistics papers (22 for Study I, 26 for Study II), taken from ... to make the scheme applicable to reliable an- notation for several non-discourse analysts (and for potential automatic annotation). For the development of our scheme, we used compu...
Ngày tải lên : 22/02/2014, 03:20
  • 8
  • 396
  • 0
Tài liệu Báo cáo khoa học: "AN INDEXING TECHNIQUE FOR IMPLEMENTING COMMAND RELATIONS" ppt

Tài liệu Báo cáo khoa học: "AN INDEXING TECHNIQUE FOR IMPLEMENTING COMMAND RELATIONS" ppt

... requierments for the formalism used. Hence, the indexing technique has a wide spectrum of applications for testing command relations in syntactic analysis. Futhermore, this method can also be used for ... special cases of definitions 1.1 and 1.2 for the property of being a set of maximal projections. Before I formulate the general command definition in a formal way, I will now...
Ngày tải lên : 22/02/2014, 10:20
  • 6
  • 456
  • 0
Báo cáo khoa học: " An Input Device for the Harvard Automatic Dictionary" pot

Báo cáo khoa học: " An Input Device for the Harvard Automatic Dictionary" pot

... token for the semi-colon. Therefore, since the output equipment has not been modi- fied, Cyrillic material in the ranked code still would print in cryptographic form, e.g., "56EU" for ... by Andrew Kahr for converting ranked code into a standard transliteration code has proved satisfactory for experimental purposes. It yields, for example, "DEN'" for...
Ngày tải lên : 07/03/2014, 18:20
  • 6
  • 332
  • 0

Xem thêm