an algorithm for finding intrinsic dimensionality of data

... from the English side of the corpus. In- stances of the English collocation are found and the mutual information is calculated between the instances and various single word candidates in aligned ... sentences of each language using finite- state recognizers. The algorithm is applicable for finding single or multiple word correspondences and can accommodate additional kinds of phrases. ... representation of the correspon- dences for efficient operation. An arbitrarily large corpus can be accommodated by segmenting it ap- propriately. The algorithm described here is an instance of a...

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

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

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

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

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

... computer and key- board in the English Wikipedia. provides multilingual support for the English, Ger- man, French and Italian Wikipedias and can be eas- ily extended to other languages 4 . 4 Software ... Devel- opment and application of a metric to semantic nets. IEEE Transactions on Systems, Man and Cybernetics, 19(1):17– 30. Resnik, P. (1995). Using information content to evaluate seman- tic similarity ... taxonomy. In Proc. of IJCAI-95, Vol. 1, pp. 448–453. Seco, N., T. Veale & J. Hayes (2004). An intrinsic information content metric for semantic similarity in WordNet. In Proc. of ECAI-04, pp....

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

... bracketing, we take note of three lemmas for IITGs (proofs omitted): Lemma l For any inversion-invariant transduction grammar G, there exists an equivalent inversion- invariant transduction grammar ... vocabulary of approximately 6,500 words and a Chinese vocabulary of approximately 5,500 words. The mapping is many-to-many, with an average of 2.25 Chinese translations per English word. The translation ... production of G' ; 2. otherwise G' contains no productions of the form A ~ e/e. Lemma2 For any inversion-invariant transduction grammar G, there exists an equivalent inversion- invariant...

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

... III PERFORMANCE OF THE ALGORITHM The algorithm as described has been implemented in Simula 67 on a DEC ELI091 and applied to a corpus of some 300 words in 75 languages and dialects of Vanuatu. ... consonants vastly improved the performance of the algorltbm. No human intervention is needed to identify vowels from consonants, an improved version of an algorithm described in Suhotln 1962 ... present. Thus for instance Sakao and Tolomako (Espirltu Santo, Vanuatu) were given as sharing 38.91~ cognates (cut-off cognation index: 1.28), as against a human estimate of 41% backed by...

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

... existing algorithms, namely the instant availability of all descrip- tors of a referent and the satisfactory expressibility of the chosen set of descriptors. They are responsible for three ... p and false otherwise Table 2: Functions used in the algorithm 210 Major problems for the future are an even tighter inte- gration of the algorithm in the generation process as a whole and ... Issues in the Planning of Definite and Indefinite Referring Expressions. In 23rd Annual Meeting of the Association for Computational Linguistics, pages 198-203. Asso- ciation for Computational...

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

... Thus every appearance of a variable can only be further instanfiated by a semantic individual constant and so the semantic representation after generation cannot be further instantiated in such ... important as the corresponding work on parsing algorithms. We also discuss the properties of a semantic representation language (SRL) and the manner of its construction which makes our algorithm ... stricter form of Shieber's (1988) property of semantic monotonicity. We not only require that the semantics introduced by all subconstituents of an expression appear within the semantics of...

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

... English/Russian than on other language pairs. Their best systems for En- glish/Russian are only trained on the seed data and the use of unlabelled data does not help the perfor- mance. Since our ... It is an extension of Algorithm 1. It runs the iterative process of Algorithm 1 on half of the list of word pairs (training data) for 100 itera- tions. For every iteration, it builds a transliteration system ... transliterations for most lan- guage pairs. The extracted set of word pairs will be called “list of word pairs” later on. We use the list of word pairs as the training data for Algorithm 1. Algorithm...

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

... modelling this information and have provided an algorithm for constructing and reasoning with it. The steps of the construction algorithm parallel the reasoning that an agent performs in determining ... tional participants must recognize the intentions be- hind those utterances. Thus, a model of intended plan recognition is an important component of a theory of discourse understanding. The ... by the algo- rithm and then discussing the type of plan recogni- tion necessary for the construction of a SharedPlan. Next, we present the algorithm itself, and discuss an initial implementation....

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

... significantly lower than the number of permutations of quantifiers. For sen~ tences which contain two argument NPs and the rest of the quantifiers nested inside each of these, the number of scopings ... simple lan- guage of generalized quantifiers, where the formula format is DET(x,~(x ),¥(x )) for determiners DET and formulas ~, ~. DET will be referred to as the determiner of the quantifier, ... Algebra. D. van Nostrand Comp. Ltd., New York. Johnson, M.:and Kay, M. (1990): Semantic Abstraction and Anaphora. Proceedings of COLING 90. Pereira, F.C.N. and Shieber, S.M. (1987): Prolog and Nat~al-language...

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

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

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

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

Ngày tải lên: 23/06/2014, 01:20

... made substantial contributions to conception and design, and to the analysis and interpretation of the data. TRM and GWC handled acquisition of data. All authors contributed to the manuscript ... visits; all other data used for the analysis were from the administrative claims data. To test the performance of the effectiveness algorithm and to see whether it was similar for non-biologic ... Because of similarities in both the descriptive characteristics of the study populations of biologic and non-biologic DMARD users and the performance characteristics of the effectiveness algorithm...

Ngày tải lên: 25/10/2012, 10:45

... is an elegant formalization of the augmented context-free grammars characteristic of most current NLP systems. It is more general than members of the family of unification-based grammar formalisms ... 1987a). Many systems based on Earley's algorithm have a clear division between the phases of syntactic and semantic analysis. Yellin (1988), for instance, uses a syntactic analysis phase ... Notation and Preliminaries We follow the usual notation and terminology for grammars and languages. A language is a set of strings o~,er a finite set T of symbols. A grammar is a formal...

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