an algorithm for finding nearest neighbours in approximately constant average time
Báo cáo khoa học: "AN ALGORITHM FOR FINDING NOUN PHRASE CORRESPONDENCES IN BILINGUAL CORPORA" pptx
Ngày tải lên :
31/03/2014, 06:20
... 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...
- 6
- 327
- 0
Báo cáo khoa học: "AN ALGORITHM FOR GENERATION IN UNIFICATION CATEGORIAL GRAMMAR" pdf
Ngày tải lên :
09/03/2014, 01:20
... 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 ...
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 ...
Proceedings of the 11th
International Conference on Computational
Linguistics and the 24th Annual Meeting of the
Association for Computatinoal Linguistics,
Institut fur Kommunikationsforschung...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words" ppt
Ngày tải lên :
20/02/2014, 22:20
...
lexicon contains an English 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 ...
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...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES" pptx
Ngày tải lên :
21/02/2014, 20: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. ... 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 of
the algorithm to ...
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...
- 4
- 422
- 0
Báo cáo khoa học: "An Algorithm For Generating Referential Descriptions With Flexible Interfaces" pdf
Ngày tải lên :
08/03/2014, 21: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. ... result of
replacing every occurrence of the constant r in p by
variable v (for an algorithm to maintain consistency see
AC-3 (Mackworth, 1977), as used in (Haddock, 1991)).
According to our desiderata,...
- 8
- 325
- 0
Báo cáo khoa học: "An Algorithm for Unsupervised Transliteration Mining with an Application to Word Alignment" ppt
Ngày tải lên :
23/03/2014, 16: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 ... given a fixed source and target string and
return the probability of this sequence.
For the mining process, we trained g2p on
lists containing both transliteration pairs and non-
transliteration pairs.
2.2 ... Val-
letta, Malta.
Qin Gao and Stephan Vogel. 2008. Parallel implemen-
tations of word alignment tool. In Software Engineer-
ing, Testing, and Quality Assurance for Natural Lan-
guage Processing, Columbus,...
- 10
- 320
- 0
Báo cáo khoa học: "AN ALGORITHM FOR PLAN RECOGNITION COLLABORATIVE DISCOURSE*" pot
Ngày tải lên :
23/03/2014, 20: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...
- 6
- 293
- 0
Báo cáo khoa học: "Automatic Part-of-Speech Tagging for Bengali: An Approach for Morphologically Rich Languages in a Poor Resource Scenario" pdf
Ngày tải lên :
31/03/2014, 01: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...
- 4
- 455
- 0
Báo cáo khoa học: "AN ALGORITHM FOR GENERATING NON-REDUNDANT QUANTIFIER SCOPINGS" pptx
Ngày tải lên :
01/04/2014, 00: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...
- 6
- 315
- 0
Báo cáo hóa học: " Research Article Location-Based Self-Adaptive Routing Algorithm for Wireless Sensor Networks in Home Automation" doc
Ngày tải lên :
21/06/2014, 05: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 ... 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 ... performance for packetaverage
delay of LAR and AODVjr was better than that of WSNHA-
LBAR because automatic self-learning in WSNHA-LBAR
is exchanged by the decrease of performance for packet
average...
- 15
- 434
- 0
Báo cáo hóa học: " Research Article A Hybrid Projection Algorithm for Finding Solutions of Mixed Equilibrium Problem and Variational Inequality Problem" pptx
Ngày tải lên :
21/06/2014, 20: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,
iiiT
n
n∈N
and V
n
n∈N
two sequences of firlmy nonexpansive mappings...
- 19
- 451
- 0
Báo cáo hóa học: " Research Article Strong Convergence of a Modified Iterative Algorithm for Mixed-Equilibrium Problems in Hilbert Spaces" pdf
Ngày tải lên :
22/06/2014, 03: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,FT
i
: {x ∈ C : T
i
x x}.Findingan
optimal point in the intersection ∩
N
i1
FT
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...
- 23
- 284
- 0
Báo cáo hóa học: " Research Article An Algorithm for Detection of DVB-T Signals Based on Their Second-Order Statistics" doc
Ngày tải lên :
22/06/2014, 06: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), ... occupancy report for
new york city during the republican convention August-
September, 2004,” in ICC, 2006.
[4] P. Kolodzy, “Spectrum policy task force: findings and recom-
mendations,” in Proceedings ... 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...
- 9
- 254
- 0
Báo cáo hóa học: " Research Article Algorithms for Finding Small Attractors in Boolean Networks" potx
Ngày tải lên :
22/06/2014, 19: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...
- 13
- 318
- 0
Báo cáo hóa học: " ZSBT: A Novel Algorithm for Tracing DoS Attackers in MANETs" pot
Ngày tải lên :
22/06/2014, 22:20
... packets, it can reconstruct the path using the infor-
mation in those packets. Then the remaining problem is that
what information should be recorded and how to record the
information in each packet. ... challenging task to trace a remote attacker in MANETs. In this paper, we proposed a
zone sampling-based traceback (ZSBT) algorithm for tracing DoS attackers in MANETs. In our algorithm, when a node forwards
a ... Xidian
University, China, in 1982, and his M.S. and Ph.D. degrees in en-
gineering from Tohoku University, Japan, in 1989. He worked as a
Visiting Scientist of the Institute of Computer Science at MIT in
1995.
Yi...
- 9
- 657
- 0
