... Estimating parameters for statistically-based machine translation [Brown et al., 1992]. The work described here makes use ofthe aligned Canadian Hansards [Gale and Church, 1991b] to obtain ... information is calculated between the instances and various single word candidates in aligned French sentences. The highest ranking candidates are then extended by another word and the procedure ... texts. In Proceedings ofthe Fourth DARPA Speech and Natural Language Work- shop, pages 152-157, Pacific Grove, CA., Febru- ary 1991. Morgan Kaufmann. [Gale and Church, 1991b] W. A. Gale and...
... Programmatic access to the encyclopedia makes also available ina straightfor-ward manner the large amount of structured text in Wikipedia (e.g. for building a language model), aswell as its rich internal ... word1 and word2,and display(path) for displaying a path foundbetween two Wikipedia articles inthe categorizationgraph. Examples of programmatic usage ofthe APIare presented in Figure 3. In addition, ... 24–26.Mihalcea, R., C. Corley & C. Strapparava (2006). Corpus-basedand knowledge-based measures of text semantic similarity. In Proc. of AAAI-06, pp. 775–780.Patwardhan, S., S. Banerjee &...
... same family (say Indo-European). Our bracketing method is based on a new formalism called an inversion.invariant transduction grammar. By their nature inversion-invariant transduction grammars ... remain similar across lan- guages, and tha! core arguments ofthe same frame will surface adjacently. The accuracy ofthe method on a particular language pair will therefore depend upon the ... Inversion-Invariant Transduction Grammars A Wansduction grammar is a bilingual model that gen- erates two output streams, one for each language. The usual view of transducers as having one input...
... PERFORMANCE OFTHEALGORITHM 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. ... ANALGORITHMFOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian National University GPO Box 4, Canberra 2601 AUSTRALIA ABSTRACT ... The algorithm takes as only input a llst of words, preferably but not necessarily in phonemic transcription, in any two putatively related languages, and sorts it into decreasing order of...
... used inthealgorithm 210 Major problems forthe future are an even tighter inte- gration ofthealgorithminthe generation process as a whole and finding adequate concepts for dealing with ... Proceedings ofthe Eighth Australian Joint Conference on Artificial Intelligence, Canberra, Australia. Barbara Grosz, and Candace Sidner. 1986. Attention, Intention, and the Structure of Discourse. ... should enable the reader to understand the functionality ofthe algorithm. Throughout processing, thealgorithm maintains a constraint network N which is a pair relating (a) a set of constraints,...
... particular, the only use of variables inthe language is in representing existentially quantified variables over individuals. Thus every appearance ofa variable can only be further instanfiated ... definitions, as the resulting semantic structure contains information introduced by the determiner. On the other hand, a lexical NP such as Harry will bind a variable inthe semantics ofan expression ... by a semantic individual constant and so the semantic representation after generation cannot be further instantiated in such a way that the denotation of that expression differs from that of...
... is the total number of partic-ipants inthe subtask, and “Rank” is the rank we wouldhave obtained if our system had participated.contain training data, seed data and reference data.We make ... Algorithm 2where n is the average length ofthe source and the target string. The training data contains mostly non-transliteration pairs and a few transliteration pairs.Therefore the training ... word pair such as the English-Hindi pair “change – badlao” may endup inthe training data and the related pair “changes– badlao” inthe held-out data. The Moses systemused for transliteration...
... corresponding to this act-type (and containing information derived from rl). Rather than continuing with an independent explanation for r2, thealgorithm attempts to combine the information 5The function ... construction algorithm parallel the reasoning that an agent performs in determining the relevance ofan activity. Thealgorithm does not re- quire that activities be discussed ina fixed order and allows ... cover_interval takes a set of time intervals as an argument and returns a time interval spanning the set (Balkanski, 1990). elling plan recognition in discourse must model rea- soning about...
... Johnson & Kay (90), adding such a mechanism seems to be quite easy, since the shuffling and application of quantifiers are handled in the: grammar rules. Inthe algorithm of Hobbs & Shieber ... is in Norwegian, I'm afraid. An English overview ofthe work is included in Fenstad, Langholm and Vestre (89), but the details ofthe seoping algorithm are not described there. Treating ... reasonable to assume that no other quantifiers than the existential quantifier may be extracted out ofa relative clause. The algorithm makes it easy to implement such a constraint. Since the...
... Journal of Mathematical Analysis and Applications, vol. 158, no. 2, pp. 407–413, 1991.8 H. K. Xu, “Inequalities in Banach spaces with applications,” Nonlinear Analysis: Theory, Methods &Applications, ... Point Theory and Applications 1914 V. Colao, G. Marino, and H K. Xu, An iterative method for finding common solutions of equilibriumand fixed point problems,” Journal of Mathematical Analysis ... Bulletin ofthe American Mathematical Society, vol. 73, pp. 591–597, 1967.21 W. Takahashi and M. Toyoda, “Weak convergence theorems for nonexpansive mappings andmonotone mappings,” Journal of...
... optimizationobjective. While the PER is a more relevant measure, the SINR is often preferred inthe literature due to the lack of a tractable analytical solution forthe PER fora wide range of different ... gains vary overtime, unless all the instantaneous link gains are frequentlymeasured and made available to the scheduler, resulting in much added overhead and complexity. In this work, we include ... referencescited therein, on three main points (a) Instead of allowing a smooth tuning of transmitter output powers, we impose an on-off constraint on transmitters. One ofthe main reasons isthat power...