... ANALGORITHMFORIDENTIFYINGCOGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian National University GPO Box 4, Canberra 2601 AUSTRALIA ... 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. ... (Abramowitz and Stegun 1970). B. Vowel/Consonant Correspondences Disallowing correspondences between vowels and consonants vastly improved the performance of the algorltbm. No human intervention...
... 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 G' ... G' contains no productions of the form A ~ e/e. Lemma2 For any inversion-invariant transduction grammar G, there exists an equivalent inversion- invariant transduction gratrm~r G' where ... right-hand side of any production of G' contains either a single terminal- pair or a list of nonterminals. Lemma3 For any inversion-invariant transduction grammar G, there exists an equivalent...
... cases are not problematic, for instance, when two descriptors achieve unique identifi- cation and can be expressed by a simple noun phrase consisting of a head noun and an adjective. In more complex ... 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 ... p is prototypical for referent r and false otherwise yields the set of predicates entailed in N and holding for referent r yields properties which map onto the set of uninstantiated slots in...
... 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 a way that ... of an expression and generating the arguments to that functor. In the presentation of the basic algorithm below we will make the simplifying assumption that for any formula of the semantic ... of such algorithms is as fundamentally important as the corresponding work on parsing algorithms. We also discuss the properties of a semantic representation language (SRL) and the manner of...
... 7-15.Hmeidi, I., Kanaan, G. and M. Evens (1997) Designand Implementation of Automatic Indexing for Information Retrieval with Arabic Documents.Journal of the American Society for InformationScience, ... American Society for Information Science, 43/5, pp. 384-390.Porter, M.F. (1980) AnAlgorithmfor suffixstripping. Program, 14 /3, pp 130-137Stalls, B. and Knight, K. (1998) Translating namesand ... stems, and roots as Index terms in an Arabic Information Retrieval system. Journal of theAmerican Society for Information Science, 45/8,pp. 548-560Al-Najem, Salah R. (1998). An Explanation...
... non-transliteration pairs than transliter-ation pairs. We don’t want to maximize the like-lihood of the non-transliteration pairs. Instead wewant to optimize the transliteration performance for test ... filtering model and thetransliteration model. In section 3, we present ouriterative transliteration mining algorithm and an al-gorithm which computes a stopping criterion for themining algorithm. ... itsperformance is similar to or better than many of thesemi-supervised systems on three language pairs.We are only aware of one previous work whichuses transliteration information for word...
... several graph-based algorithms derived from his formal model of plan recognition. In Kautz's algorithms, an explanation foran observation is represented in the form of an explanation graph ... modelling this information and have provided an algorithmfor constructing and reasoning with it. The steps of the construction algorithm parallel the reasoning that an agent performs in determining ... recipe for lifting a piano THE SHAREDPLAN AUGMENTATION ALGORITHM A previous paper (Lochbaum et hi., 1990) describes an augmentation algorithm based on Grosz and Sid- ner's SharedPlan...
... 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 RA treatments, we performed ... 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 ... optimization of the algorithm would be desirable, but substantially more data would be required for this approach and for validation. Finally, as an additional opportunity to extend the algorithm in...
... Proceedings of COLING’02.K. van Deemter and S. Peters. 1996. Semantic Ambiguityand Underspecification. CSLI, Stanford.E. Vestre. 1991. Analgorithmfor generating non-redundantquantifier scopings. In ... semantics: An introduction. Journal ofLanguage and Computation. To appear.M. Egg, A. Koller, and J. Niehren. 2001. The ConstraintLanguage for Lambda Structures. Logic, Language, andInformation, ... rules. For instance, proper namesand pronouns (which the ERG analyses as scope-bearers, although they can be reduced to constantswithout scope) can be permuted with anything. In-definites and...
... for composing trees. Many modern types of TAG also allow tree substitution next to adjunc- tion. Our algorithm can be straightforwardly extended to handle tree substitution. The main changes ... CS(N), for each N; • (N, L) • CS(N), for each N such that N <~* l, and each L • Af*; • N • CS(N), for each N such that -~(N<~*l); and • for each N, children(N) = MI""Mm and ... to correct the algorithm. We therefore developed an alternative to the algorithm from Schabes and Vijay-Shanker (1990). This alternative is novel in presenta- tional aspects, and is fundamentally...
... wish to thank our colleagues Kerima Benkerimi, David Elworthy, Peter Gibbins, Inn Johnson, Andrew Kay and Antonio Sanfilippo at SLE, and our anonymous reviewers for useful feedback and discussions ... as translation coverage is extended and new lan- guage pairs are added. 5 Conclusion We have presented a polynomial complexity gener- ation algorithm which can form part of any Shake- and-Bake ... component has performed consistently better. References V. Allegranza, P. Bennett, J. Durand, F. van Eynde, L. Humphreys, P. Schmidt, and E. Steiner. 1991. Linguistics for Machine Translation:...
... pe,forms instanliation tit)ring parsing. Some details of the LR parsing algorithm are assumed from Aho and Ullman (1987) and Aho and Johnson (1974), and more formal definitions and notations ... Carl and Ivan A. Sag 1987. Information-Based Syntax and Semantics VoI.1. CSLI Lecture Notes 13. Stanford: CSLI. Shieber, S. 1985. "Using Restriction to Extend Parsing Algorithms for ... AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics...
... Parmentier, and Johannes Dellert. 2008. De-veloping an MCTAG for German with an RCG-based parser. In Proceedings of LREC-2008, Mar-rakech, Morocco.Wolfgang Maier and Anders Søgaard. 2008. Tree-banks ... to instantiate a clause of the grammar,we need to find ranges for all variables in theclause and for all occurrences of terminals. For convenience, we assume the variables in a clauseand the ... adjacentvariables can be concatenated), it is called an in-stantiated predicate and the result of applying φ toall predicates in c, if defined, is called an instanti-ated clause.We also introduce range...
... f(g)are called the rank and fan-out of p, respectively,written r(p) and f(p). The rank and fan-out of G,written r(G) and f(G), respectively, are the max-imum rank and fan-out among all of ... constituents. Many applications useLCFRSs where the fan-out (a measure ofthe discontinuity of phrases) is not allowedto be greater than 2. We present an ef-ficient algorithmfor transforming LCFRSwith ... thewhile loop can be executed in constant time.5 DiscussionWe have presented analgorithmfor the binariza-tion of a LCFRS with fan-out 2 that does not in-crease the fan-out, and have discussed...
... created a manually annotated gold standardusing an annotation tool based on NITE XML (Car-letta et al., 2003). We annotated two classes wherebyEnglish words and abbreviations that expand to En-glish ... semantics in both languages and representassimilated loans and cognates where the languageorigin is not always immediately apparent. Onlya small subgroup of them are clearly English loanwords ... 133–138,Ann Arbor, Michigan, June 2005.c2005 Association for Computational Linguistics An Unsupervised System forIdentifying English Inclusions in German TextBeatrice AlexSchool of InformaticsUniversity...