an algorithm for finding best matches in logarithmic expected time

... been isolated in corre- sponding sentences of each language using finite- state recognizers. The algorithm is applicable for finding single or multiple word correspondences and can accommodate ... phrase is defined by its word sequence, excluding any leading determiners. Singular and plural forms of common nouns are thus distinct and assigned different positions in the index. For each ... applications for bilingual correspon- dence information have been suggested. They can be used in bilingual concordances, for automat- ically constructing bilingual lexicons, and proba- bilistically...

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

... raised. The standard UCG analysis of non-lexieal NPs is adequately handled using the above definitions, as the resulting semantic structure contains information introduced by the determiner. On ... 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 ... semantics of any containing expression be a further instantiation of one of its subexpressions. We introduce the algorithm on a case-by-case basis, at each stage extending its coverage and include...

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

Ngày tải lên: 08/07/2014, 17:06

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

... Before turning to 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 ... method for simul- taneously bracketing both halves of a paral- lel text and giving word alignments, assum- ing only a translation lexicon for the language pair. We introduce inversion-invariant ... pmbabilistic tagging. In Proceed- ings of ROCLING-92, 85-96. MAGERMAN, DAVID M. & ~ L p. MARCUS. 1990. Parsing a natural language using mutual information statistics. In Proceedings of AAAI-90,...

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

... cognation decisions are bettered by a trained linguist using more information only in cases of wordllsts sharing less than 40% cognates and involving complex, mu]tlple sound correspondences. ... the best results. This is not surprlsing, since there is Do significant difference in the degrees of certainty corresponding to z scores of 4 and beyond. The last improvement in the performance ... 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...

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

... Artificial Intelligence, 26:1-33. Doug Appelt. 1985b. Some Pragmatic Issues in the Planning of Definite and Indefinite Referring Expressions. In 23rd Annual Meeting of the Association for Computational ... gration of the algorithm in the generation process as a whole and finding adequate concepts for dealing with negation and sets. References Doug Appelt. 1985a. Planning English Referring Expressions. ... presen- tation by explaining the pseudo code, thereby pointing to the corresponding parts in the schematic overview. In companion with the variables and functions explained in separated tables,...

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

... guarantees the optimality which can- not be attained in approximate algorithms. In terms of k -best parsing, Huang and Chiang (2005) proposed an efficient algorithm which is sim- ilar to the k -best ... itera- tive A* algorithms for 1 -best sequential decoding in this paper. In addition, we proposed A* and iterative Viterbi A* algorithm for k -best sequential decoding. K -best Iterative A* algorithm can be ... Experimental setting We apply 1 -best and k -best sequential decoding al- gorithms to five NLP tagging tasks: Penn TreeBank (PTB) POS tagging, CoNLL2000 joint POS tag- ging and chunking, CoNLL 2003 joint POS...

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

... transliteration mining algorithm and an al- gorithm which computes a stopping criterion for the mining algorithm. Section 4 describes the evaluation of our mining method through both gold standard evaluation ... iterative filtering algorithm (Algorithm 1) and then the algorithm for the stop- ping criterion (Algorithm 2). In practice, we first run Algorithm 2 for 100 iterations to determine the best number ... tasks. 6 For the En- glish/Arabic task, the transliteration mining system of Noeman and Madkour (2010) was best. They normalize the English and Arabic characters in the training data which increases...

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

... act-type (and containing information derived from rl). Rather than continuing with an independent explanation for r2, the algorithm attempts to combine the information 5The function cover_interval ... 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 ... 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 hypothetical and only...

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

... number of instances in the training corpora, including errors due to long distance phenomena. 3 http://maxent.sourceforge.net 4 Conclusion In this paper we have described an approach for automatic ... Sudeshna Sarkar, Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India 721302 {sandipan,sudeshna,anupam.basu}@cse.iitkgp.ernet .in Abstract ... 2007. c 2007 Association for Computational Linguistics Automatic Part-of-Speech Tagging for Bengali: An Approach for Morphologically Rich Languages in a Poor Resource Scenario Sandipan Dandapat, Sudeshna...

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

... difficult, since the language of the input forms does not distinguish between relative clauses and other kinds of NP modifiers. In general, any working scoping algorithm should meet as many linguistic ... complexity for scoping algorithms is a function of both the number of quan- tifiers in the input, and of the structure of the input. The highest number of scopings is obtained when the input contains ... redundant scopings: If the surrounding quantifier had a scope- commutative determiner, quantifiers with the same determiner and which precede the surrounding quantifier in the default ordering...

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

... Self-Adaptive Routing Algorithm for Wireless Sensor Networks in Home Automation Xiao Hui Li, 1 Seung Ho Hong, 2 and Kang Ling Fang 1 1 College of Information Science and Engineering, Engineering Research ... Chen and J. Ma, “Simulation study of AODV performance over IEEE 802.15.4 MAC in WSN with mobile sinks,” in Proceedings of the 21st International Conference on Advanced Information Networking and ... per- formance metrics for WSNHA-LBAR, LAR, and AODVjr in different scenarios. The performance for overhead of WSNHA-LBAR and LAR was better than that of AODVjr when WSNHA-LBAR and LAR maintained...

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

... 2009. 19 F. E. Browder, “Convergence of approximants to fixed points of nonexpansive non-linear mappings in Banach spaces,” Archive for Rational Mechanics and Analysis, vol. 24, pp. 82–90, 1967. 20 ... Fixed Point Theory and Applications 19 14 V. Colao, G. Marino, and H K. Xu, An iterative method for finding common solutions of equilibrium and fixed point problems,” Journal of Mathematical Analysis ... A be an α-inverse strongly monotone mapping of C into H, ii B a β-inverse strongly monotone mapping of C into H, iiiT n  n∈N and V n  n∈N two sequences of firlmy nonexpansive mappings...

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

... descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings,” in Inherently Parallel Algorithms in Feasibility and Optimization and Their ... the fixed-point set of T i ,thatis,FT i  : {x ∈ C : T i x  x}.Findingan optimal point in the intersection ∩ N i1 FT i  of the fixed-point sets of a family of nonexpansive mappings is a task ... Takahashi 18, Marino and Xu 8, Qin et al. 28, S. Takahashi and W. Takahashi 6, Wittmann 30,and many others. We will need the following result concerning the W-mapping W n . Lemma 2.1...

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

... Gong, “A blind time- parameters estimation scheme for OFDM in multi-path chan- nel,” in Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing (WCNM ’05), ... broadcasting (DVB) framing structure, channel coding and modulation for digital terrestrial televi- sion,” November 2004. [19] R. A. Davis and P. J. Brockwell, Time Series: Theory and Meth- ods, Springer ... an opportunist terminal can set a communication in a DVB-T band only if no DVB-T signal is present with an SNR higher than −10 dB. This threshold gives us an estimate of the required performances...

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

... Although such binary expression is very simple, it can retain meaningful biological information con- tained in the real continuous-domain gene expression pro- files. For instance, it can be applied ... be useful for designing algorithms for finding steady states in other models and for theoretical analysis of such algorithms. For instance, Mochizuki performed theoretical analysis on the number ... proved in 1998 that finding a singleton attractor is NP-hard [24]. Independently, Milano and Roli showed in 2000 that the satisfiability problem can be transformed into the problem of finding a singleton...

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

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

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

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