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

... XMG - An expressive formalism for describing tree-based grammars Yannick Parmentier INRIA / LORIA Universit´e Henri Poincar´e 615, ... 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 ... pieces of informa- tion (fragments), a...

Ngày tải lên: 22/02/2014, 02:20

... 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

... 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

... 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

... 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

... 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 ... annota- 96 tions. Available formalisms make it possible to ex- press constraints on these annotations by means of unification. Thereby, the platform promotes pro- gressive abstraction from s...

Ngày tải lên: 22/02/2014, 02:20

... 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

... translated manuals) where information necessary for an appropriate translation should be looked for in the previous sentence(s). Translation steps RUSLAN performs following steps to obtain ... part of the preprocessing. For the time being, a treatment of ellipsis is not provided for, but a modification of the analysis is being prepared to account for cases (not very frequen...

Ngày tải lên: 22/02/2014, 10:20

... 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 n...

Ngày tải lên: 22/02/2014, 10:20

... grouping of information, thus expressing the information in- terdependencies. The language which SUG pro- vides for specifying these descriptions allows par- tiality both in the information about ... of strings. Unlike most formalisms, SUG allows the specification of the structural relations to be equally partial. For example, if a description specifies children for a node, this...

Ngày tải lên: 20/02/2014, 21:20