... describes anefficientparallel system for processing TypedFeatureStructures (TFSs) on shared-memory parallel machines. We call the system ParallelSubstratefor TFS (PSTFS}. PSTFS is designed for ... AnEfficientParallelSubstrateforTypedFeatureStructures on Shared Memory Parallel Machines NINOMIYA Takashi t, TORISAWA Kentaro t and TSUJII Jun'ichi t$ tDepartment of Information ... a substrateforparallel processing of typedfeature structures. PSTFS serves as anefficient programming environment for implementing parallel NLP systems. We have shown the feasibility and...
... 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:...
... those feature values must have. In Figure 1,1 for example, allhead -typed TFSs must have bool -typed values for the features MOD and PRD, and no values for anyother feature. Relative to data structures ... based on typed feature structures, as it significantlyreduces the overhead of memory manage-ment and reference-pointer-chasing dur-ing unification.1 MotivationThe logic of typedfeaturestructures ... arrays or logicalterms, typedfeaturestructures (TFSs) can be re-garded as an expressive refinement in two differentways. First, they are typed, and the type system al-lows for subtyping chains...
... describe the algorithm for pack- ing feature structures, and then the algorithm for unification of packed feature structures. 2.2 Algorithm for Packing The procedure pack _feature_ structures in ... the algorithm for packing two packed feature structures, denoted by (S',:D') and (,9", D"). ,9' and S" denote sets of seg- ments, and 7)' and 7)" denote ... method can correctly unify fea- ture structures with reentrancies. For example, Figure 8 shows the intermediate data structure after unifying A4, and the process currently reached A7 and E]"...
... Halliday: System and Function in Language. Oxford University Press, London, England, 1976. [4] Kaplan, R. and J. Bresnan. Lexical Func- tional Grammar: A Formal System for Grammatical Representation. ... LOGICAL SEMANTICS FORFEATURESTRUCTURES Robert T. Kasper and William C. Rounds Electrical Engineering and Computer Science Department University of Michigan Ann Arbor, Michigan 48109 Abstract ... transition graphs for a special type of deterministic finite automaton. This semantics forfeaturestructures extends the ideas of Pereira and Shieber [11], by providing an interpretation for...
... nese translations appear in the aligned Chinese sentence. For example, foran English occurrence channel, both “频道” (sense 1 translation) and “途径” (sense 5 translation) happen to ... lists seven senses for the noun channel. Two senses are lumped together if they are translated in the same way in Chinese. For example, sense 1 and 7 of channel are both translated as “频道” in ... learning approach for WSD (Florian and Yarowsky, 2002; Lee and Ng, 2002; Mihalcea and Moldovan, 2001; Yarowsky et al., 2001). In this paper, we used the WSD program reported in (Lee and Ng, 2002)....
... on Banksand Other Financial Organizations; the Law on Bank Rehabilitation, Bankruptcy andLiquidation; and the Law on the Agency for Deposit Insurance and BankRehabilitation, Bankruptcy and ... Valjevska banka, JIK banka,Pozarevacka banka, Sabacka banka, Beogradska banka, Beobanka, Jugobanka, andInvestbanka. Later, two more banks were added to this list - Dafiment banka andBanka privatne ... these banks were transferred to the newlyformed National Savings Bank (more details in Section 3). Two other banks (Jubankaa.d. and Kosovska banka a.d.) that survived the changes of banking...
... structures show multiple contactsbetween kinase and substrates; in particular, two residues undergo confor-mational changes and by mutation are found to be important for substrate binding and ... Rodolfo M,Daniotti M, Scarpa A, van Tilborg AA, Leenstra S,Zanon C & Bardelli A (2007) Novel somatic and germ-line mutations in cancer candidate genes in glioblas-toma, melanoma, and pancreatic ... peptide substrate FEBS Journal 276 (2009) 4395–4404 Journal compilation ª 2009 FEBS. No claim to original US government works 4397Canadian Institutes for Health Research, the CanadianFoundation for...
... identical to transforming a constraint into an equivalent and satisfiable constraint. CU unifies feature structures by transforming the constraints on them. The basic idea of CU is to transform constraints ... inference sys- tem. Therefore, it is expected to play an impor- tant role in synthesizing linguistic analyses such as parsing and semantic analysis, and linguistic and non-linguistic inferences. ... which abandons information irrelevant to the mother structures. His method, however, fails to check the inconsistency of the abandoned information. Furthermore, it abandons irrelevant information...
... but intro- duces another problem: A query treegram may not appear in the treegram index as it is. Therefore, VENONA expands all query treegram structures at runtime; for a given query ... tree; an integer encod- ing g's structure completes this represen- tation: Structure is at least as essential for tree retrieval as label information. 1Due to lack of space, we cannot ... greater degree, it will be transformed automati- cally to a d-ary tree. 2 (3) For describing a single treegram g, VENONA takes each of g's hashed labels and combines it with the position...