Tài liệu Báo cáo khoa học: "AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES" pptx

... AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian ... memory. The algorithm is given no information whatsoever about the phonemic transcription .used, and even though cognate identification is carried out on the basis of a context-free one -for- one ... linguist using more information only in ca...

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

... constraints; for example, tac- tics employing mutual information have been applied to tagged text (Magerumn & Marcus 1990). Algorithms for word alignment attempt to find the matching words between ... serve as generative models for parallel bilingual sentences with weak order constraints. Focusing on Wans- duction grammars for bracketing, we formu- late a normal form, an...

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

... getPage(word) for retrieving Wikipedia articles titled word or getRelatedness(word1,word2), for com- puting the relatedness between word1 and word2, and display(path) for displaying a path found between ... Hirst (2006) for an ex- tensive review). For instance, Rada et al. (1989) traverse MeSH, a term hierarchy for indexing ar- ticles in Medline, and compute semantic related-...

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

... Rules for diagnosing problems in the circuit | IND led-2 COND[ STATE on [ FORM <sta~(O IND FORM), (t STATE FORM))> CNCL [ DEV tr~i,~torol7 t FORM <s~u.¢((, DEV), fa~ed)> t FORM ... separated, with only the former being performed by a trained knowledge engineer. The problem of building a large collec- tion of knowledge-based troubleshooters for electronic instru-...

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

... in. put form of (almos0 any format and returns a set of scoped formulas: scopings(form) = [ build-main(form) }, if form is quantifier free [ build-quant(q,r,s) I q ~ get-quants(form), r ... quantified formulas are 4- part objects. I will occasionally use a simple lan- guage of generalized quantifiers, where the formula format is DET(x,~(x ),¥(x )) for determiners DET and formula...

Ngày tải lên: 01/04/2014, 00:20

... elimination algorithm: REDUNDANCY-ELIMINATION(Ch, R) 1 for each split S in Ch 2 do if S is eliminable with respect to R 3 then remove S from Ch Prop. 3 shows that the algorithm is a correct algorithm for ... reduc- tion factor for an individual USR is 666.240. We also measured the ratio of USRs for which the algorithm achieves complete reduction (Fig. 6): The algorithm is co...

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

... incorrectness have been given before by Kinyon (1997). There seems to be no straightforward way to correct the algorithm. We therefore developed an alternative to the algorithm from Schabes and ... alternative LR algorithm for TAGs Mark-Jan Nederhof DFKI Stuhlsatzenhausweg 3 D-66123 Saarbr/icken, Germany E-marl: nederhof@dfki.de Abstract We present a new LR algorithm for...

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

... 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 United Kingdom ... Shake-and-Bake generation algorithm of (Whitelock, 1992) is NP- complete. We present a polynomial time algorithm for lexicalist MT generation pro- vided that sufficient information...

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

... an algorithm trained on the same data and with no possibilities for fine-tuning; therefore the comparison should be fair. The comparison show that performance-wise, the monolink algorithm is between ... similar algorithm can be found for the max- product BP. 3.3 Experimental Results We evaluated the monolink algorithm with two languages pairs: French-English and Japanese- English...

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

... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics ... tsuneko@grice.cogsci.uiuc.edu ABSTRACT This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories durin...

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