Báo cáo khoa học: "An Efficient Method for Determining Bilingual Word Classes" doc

... Proceedings of EACL '99 An Efficient Method for Determining Bilingual Word Classes Franz Josef Och Lehrstuhl ffir Informatik VI RWTH Aachen - University of Technology ... problem. An efficient optimization algorithm for LP1 is described in section 4. 3 Bilingual Word Clustering In bilingual word clustering we are interested in classes ~" and C which...

Ngày tải lên: 31/03/2014, 21: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 ... which is the case for major web applications such as in- formation retrieval and question answering. In this paper we present a Sample Ensem- ble Parse Assessment (SEPA) algorithm for...

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

... Evaluation Methods In the following, we elaborate on the evaluation methods for each experiment. Exp-1: An experiment for Points 2 and 3 based on Kazawa’s method We evaluated Kazawa’s method ... automatic method using multiple evaluation results from a manual method. First, n summaries for each document, m, were prepared. A summarization system generated summaries from...

Ngày tải lên: 17/03/2014, 04:20

... Hough transform. This paper describes a new program, PlotAlign that produces a word- level bitext map for noisy or non-literal bitext, based on these techniques. Keywords: alignment, bilingual ... (SMT) can be understood as a word- by -word model consisting of two sub-models: a language model for generating a source text segment S and a translation model for mapping S to...

Ngày tải lên: 17/03/2014, 23:20

... a method to estimate information that users might need in order to analysis login data on a WWW search engine. By Ohkubo method, it is confirmed that, word groups connected with search words ... classes. The words belong to each class is called: increasing-words, relatively constant-words, and decreasing-words respectively. Table 1 shows a sample of some classified words accord...

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

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

... poten- tial word form is morphologically analyzed. For each token, its lexical information (list of valid read- ings including stem, part-of-speech and inflection information) is computed using a fullform ... information, while the multi-level chart contains positional and abstraction-based in- formation, e.g., feature structures representing NLP entities in a uniform, linguistically motiv...

Ngày tải lên: 08/03/2014, 07:20

... of subtrees to a compact grammar. While Goodman's method does still not allow for an efficient computation of the most probable parse in DOP1, it does efficiently compute the "maximum constituents ... for n=1, SL-DOP is equal to the PCFG-reduction of Bod (2001) (which we also called Likelihood-DOP) while LS-DOP is equal to Simplicity-DOP. Table 2 shows the results for sent...

Ngày tải lên: 31/03/2014, 20:20

... an efficient parallel system for processing Typed Feature Structures (TFSs) on shared-memory parallel machines. We call the system Parallel Substrate for TFS (PSTFS}. PSTFS is designed for ... i := O; forall z E F do create uarae-concat¢~atoT'-Rmb age~| J~f i; N, ~= s*lve(x); i := i + 1; forellend for j := 0 to i do R := R U (Wait-lor-result(J~fj)); forend re...

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

... it is well-formed or ill-formed. • maximal iff it is well-formed and its parent (if it has one) is ill-formed. In other words, a maxi- mal TNCB is a largest well-formed component of a TNCB. ... An Efficient Generation Algorithm for Lexicalist MT Victor Poznafiski, John L. Beaven &: Pete Whitelock * SHARP Laboratories of Europe Ltd. Oxford Science Park, Oxford OX4 4GA ... well...

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