view release on metacpan or search on metacpan
lib/Lingua/Deva.pm view on Meta::CPAN
say $d->to_latin('सरà¥à¤µà¤®à¥à¥¤'); # 'sarwam।', no warnings
=head1 DESCRIPTION
The C<Lingua::Deva> module provides facilities for converting Sanskrit in
various Latin transliterations to Devanagari and vice-versa. "Deva" is the
name for the Devanagari (I<devanÄgarÄ«>) script according to ISO 15924.
The facilities of this module are exposed through a simple interface in the
form of instances of the L<Lingua::Deva> class. A number of configuration
options can be passed to it during initialization.
view release on metacpan or search on metacpan
my $name = shift @names;
my $html = shift @html;
print "# $name\n";
print $html;
# skip the transliterations
shift @names;
shift @html;
print "#\n";
print $shavian->transliterate_html($html);
view release on metacpan or search on metacpan
Nums2Words.pm view on Meta::CPAN
my @CardinalToShortOrdinalMapping;
my $word_case = 'upper';
# At module load time, initialize our static, file-global variables.
# We use these file-global variables to increase performance when one
# needs to compute many iterations for numbers to words. The alternative
# would be to re-instantiate the never-changing variables over and over.
&init_mod_vars;
###############################################################################
###############################################################################
view release on metacpan or search on metacpan
lib/Lingua/EN/SENNA/third-party/senna/hash/words.lst view on Meta::CPAN
iteq
iter
iterate
iterated
iteration
iterations
iterative
iteratively
itesm
itf
ith
lib/Lingua/EN/SENNA/third-party/senna/hash/words.lst view on Meta::CPAN
translink
translit
translit.
transliterated
transliteration
transliterations
translocated
translocation
translucent
transmarco
transmark
view release on metacpan or search on metacpan
share/count_1w.txt view on Meta::CPAN
embarrassment 1242414
wiper 1242341
wrappers 1242242
giochi 1242118
spectators 1241932
iterations 1241775
svs 1241680
ntfs 1241647
namespaces 1241562
mismatch 1241513
fdic 1241397
share/count_1w.txt view on Meta::CPAN
modulos 42571
filespace 42571
wondeful 42570
targetname 42570
horngren 42570
transliterations 42569
resultsin 42569
paydays 42569
dwtn 42569
misbegotten 42568
atherectomy 42568
view release on metacpan or search on metacpan
examples/benchmark.pl view on Meta::CPAN
In my environment (Strawberry Perl 5.10.0.1 on Windows XP Professional with SP3,
AMD Opteron 252 @ 2.6GHz * 2, 2GB RAM):
----------------------------------------------------------------
Benchmark: timing 50000 iterations of Orthography->new, Supersignoj->nova...
Orthography->new: 3 wallclock secs ( 3.22 usr + 0.00 sys = 3.22 CPU) @ 15532.77/s (n=50000)
Supersignoj->nova: 5 wallclock secs ( 4.73 usr + 0.00 sys = 4.73 CPU) @ 10561.89/s (n=50000)
Rate Supersignoj->nova Orthography->new
Supersignoj->nova 10562/s -- -32%
Orthography->new 15533/s 47% --
----------------------------------------------------------------
Benchmark: timing 50000 iterations of Orthography->convert, Supersignoj->transkodigu...
Orthography->convert: 2 wallclock secs ( 1.90 usr + 0.00 sys = 1.90 CPU) @ 26246.72/s (n=50000)
Supersignoj->transkodigu: 10 wallclock secs ( 9.77 usr + 0.00 sys = 9.77 CPU) @ 5119.80/s (n=50000)
Rate Supersignoj->transkodigu Orthography->convert
Supersignoj->transkodigu 5120/s -- -80%
Orthography->convert 26247/s 413% --
view release on metacpan or search on metacpan
lib/Lingua/FreeLing3/Paragraph.pm view on Meta::CPAN
=head2 C<sentence>
Gets a sentence from a paragraph. Note that this method is extremely
slow, given that FreeLing paragraph is implemented as a
list. Therefore, retrieving the nth element of the list does n
iterations on a linked list.
=cut
sub sentence {
my ($self, $n) = @_;
view release on metacpan or search on metacpan
lib/Lingua/IT/Ita2heb.pm view on Meta::CPAN
=head1 BUGS AND LIMITATIONS
This program has several known limitations because Italian pronunciation is
sometimes unpredictable and because of the quirks of Hebrew spelling. Do
not assume that transliterations that this program makes are correct
and always check a reliable dictionary to be sure. Look out especially for
the following cases:
=over
view release on metacpan or search on metacpan
lib/Lingua/Interset/Tagset/FA/Conll.pm view on Meta::CPAN
}
);
# VERB FORM, MOOD, TENSE AND ASPECT ####################
# Here is a website that helps understand Persian verb forms: http://www.jahanshiri.ir/pvc/en/
# Some of the examples below are from the website, some from the PDF documentation of the treebank and some directly from the data.
# The transliterations of the three sources differ.
$atoms{tma} = $self->create_atom
(
'surfeature' => 'tma',
'decode_map' =>
{
view release on metacpan or search on metacpan
lib/Lingua/JA/FindDates.pod view on Meta::CPAN
A full set of Japanese eras.
=item L<Lingua::JA::Moji>
Japanese character transliterations, including wide ascii numerals.
=back
=head2 Online date converter
view release on metacpan or search on metacpan
lib/Lingua/Lexicon/IDP/Data/en_fr.txt view on Meta::CPAN
alligator alligator[Noun]
alligators alligators
alligators alligators[Noun]
alliteration allite/ration
alliteration allite/ration[Noun]
alliterations allite/rations
alliterations allite/rations[Noun]
allocate attribuer[Verb]
allocated attibue/, attribue/e[Adjective]
allocation attribution
allocation attribution[Noun]
allocations attibutions
view release on metacpan or search on metacpan
lib/Lingua/NATools.pm view on Meta::CPAN
This method invoques one of the three algorithms for Entropy
Maximization of the alignment matrix: C<nat-sampleA>, C<nat-sampleB>
and C<nat-ipfp>.
You should call the method with the name of the algorithm ("sampleA",
"sampleB" or "ipfp"), the number of iterations to be done, and the
chunk to be processed.
Returns the time used to run the command.
$pcorpus->run_generic_EM("ipfp", 5, 3);
view release on metacpan or search on metacpan
lib/Lingua/Norms/SUBTLEX.pm view on Meta::CPAN
L<Text::CSV::Hashify|Text::CSV::Hashify> : reads in the specs file
L<Text::CSV::Separator|Text::CSV::Separator> : for determining the field delimiter within the datafiles
L<Text::Unidecode|Text::Unidecode> : for plain ASCII transliterations of Unicode text
=head1 REFERENCES
Brysbaert, M., Buchmeier, M., Conrad, M., Jacobs, A.M., Boelte, J., & Boehl, A. (2011). The word frequency effect: A review of recent developments and implications for the choice of frequency estimates in German. I<Experimental Psychology>, I<58>, 41...
view release on metacpan or search on metacpan
lib/Lingua/Translit.pm view on Meta::CPAN
system.
Therefore it is an important and necessary information, which scheme will be
or has been used to transliterate a text, to work integrative and be able to
reconstruct the original data.
Reconstruction is a problem though for non-unique transliterations, if no
language specific knowledge is available as the resulting clusters of
letters may be ambiguous.
For example, the Greek character "PSI" maps to "ps", but "ps" could also
result from the sequence "PI", "SIGMA" since "PI" maps to "p" and "SIGMA"
maps to s.
view release on metacpan or search on metacpan
HanConvert.pm view on Meta::CPAN
a traditional character has two or more corresponding simplified forms,
but this happens much more rarely.
=head1 BUGS, LIMITATIONS
B<There may be mistakes in the transliterations>. A number of data sources
were used to build the transliteration tables, including dictionaries and
the Unicode consortium's Unihan database, but some mappings may be
incorrect or missing.
Some characters which are simplified forms are also traditional forms. For
view release on metacpan or search on metacpan
cppjieba/deps/gtest/src/gtest.cc view on Meta::CPAN
failed = true;
}
// Restores the original test order after the iteration. This
// allows the user to quickly repro a failure that happens in the
// N-th iteration without repeating the first (N - 1) iterations.
// This is not enclosed in "if (GTEST_FLAG(shuffle)) { ... }", in
// case the user somehow changes the value of the flag somewhere
// (it's always safe to unshuffle the tests).
UnshuffleTests();
view release on metacpan or search on metacpan
clib/libmpeg2/motion_comp_mmx.c view on Meta::CPAN
static mmx_t round4 = {0x0002000200020002LL};
/*
* This code should probably be compiled with loop unrolling
* (ie, -funroll-loops in gcc)becuase some of the loops
* use a small static number of iterations. This was written
* with the assumption the compiler knows best about when
* unrolling will help
*/
static inline void mmx_zero_reg (void)
view release on metacpan or search on metacpan
clib/libmpeg2/motion_comp_mmx.c view on Meta::CPAN
static mmx_t round4 = {0x0002000200020002LL};
/*
* This code should probably be compiled with loop unrolling
* (ie, -funroll-loops in gcc)becuase some of the loops
* use a small static number of iterations. This was written
* with the assumption the compiler knows best about when
* unrolling will help
*/
static inline void mmx_zero_reg (void)
view release on metacpan or search on metacpan
xt/benchmark.t view on Meta::CPAN
my $mean = $result->raw_number;
my $sigma = $result->raw_error->[0];
my $name = $instance->_name_prefix;
diag(
sprintf(
"%sRan %u iterations (%u outliers).\n",
$name,
scalar( @{ $instance->timings } ),
scalar( @{ $instance->timings } ) - $result->nsamples
)
);
view release on metacpan or search on metacpan
libseccomp/build-aux/ltmain.sh view on Meta::CPAN
# Relative path, prepend $cwd.
func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath
;;
esac
# Cancel out all the simple stuff to save iterations. We also want
# the path to end with a slash for ease of parsing, so make sure
# there is one (and only one) here.
func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \
-e "$_G_removedotparts" -e "$_G_collapseslashes" -e "$_G_finalslash"`
while :; do
view release on metacpan or search on metacpan
examples/mand2.pl view on Meta::CPAN
use Linux::Svgalib;
use vars qw($P @Q $col $row @colours );
my (
$max_iterations,
$max_size ) = (512,4);
my $screen = Linux::Svgalib->new();
$screen->init();
examples/mand2.pl view on Meta::CPAN
{
my ($X,$Y,$XSquare,$YSquare) = (0,0,0,0);
my $colour = 1;
while (( $colour < $max_iterations ) &&
(($XSquare + $YSquare ) < $max_size ))
{
$XSquare = $X * $X;
$YSquare = $Y * $Y;
view release on metacpan or search on metacpan
-npro
-nsfs
--blank-lines-before-packages=0
--opening-hash-brace-right
--no-outdent-long-comments
--iterations=2
-wbb="% + - * / x != == >= <= =~ !~ < > | & >= < = **= += *= &= <<= &&= -= /= |= >>= ||= .= %= ^= x="
view release on metacpan or search on metacpan
lib/List/BinarySearch/XS.pm view on Meta::CPAN
for inserts. Binary Searches are best when the data set is already ordered, or
will be searched enough times to justify the cost of an initial sort.
There are cases where a binary search may be an excellent choice. Finding the
first matching element in a list of 1,000,000 items with a linear search would
have a worst-case of 1,000,000 iterations, whereas the worst case for a binary
search of 1,000,000 elements is about 20 iterations. In fact, if many lookups
will be performed on a seldom-changed list, the savings of O(log n) lookups may
outweigh the cost of sorting or performing occasional linear time inserts.
=head1 EXPORT
view release on metacpan or search on metacpan
lib/List/BinarySearch.pm view on Meta::CPAN
for inserts. Binary Searches are best when the data set is already ordered, or
will be searched enough times to justify the cost of an initial sort.
There are cases where a binary search may be an excellent choice. Finding the
first matching element in a list of 1,000,000 items with a linear search would
have a worst-case of 1,000,000 iterations, whereas the worst case for a binary
search of 1,000,000 elements is about 20 iterations. In fact, if many lookups
will be performed on a seldom-changed list, the savings of O(log n) lookups may
outweigh the cost of sorting or performing occasional linear time inserts.
=head1 EXPORT
view release on metacpan or search on metacpan
lib/List/Gen.pm view on Meta::CPAN
curse {
FETCH => sub {
my $i = $_[1];
while ($i > $#list) {
$iter++ >= $size
and croak "too many iterations requested: ".
"$iter. index $i out of bounds [0 .. @{[$size - 1]}]";
local *_ = $from ? $list[-1] :
$source ? \$source->(undef, scalar @list) :
\scalar @list;
eval {push @list, map {ref eq 'List::Gen::Thunk' ? \$$_->() : \$_} $code->(); 1}
lib/List/Gen.pm view on Meta::CPAN
curse {
FETCH => sub {
my $i = $_[1];
$i < $pos and croak "non-monotone access of iterate multi stream, idx($i) < pos($pos)";
while ($i >= $pos) {
$pos >= $size and croak "too many iterations requested: ".
"$pos. index $i out of bounds [0 .. @{[$size - 1]}]";
if ($i == $pos and @last) {
$pos++;
last
}
view release on metacpan or search on metacpan
lib/List/Helpers/XS.pm view on Meta::CPAN
=head1 Benchmarks
Benchmarks of C<random_slice> method in comparison with C<List::MoreUtils::samples> and
C<List::Util::sample> showed that current version of C<random_slice> is very similar to
the first ones in some cases. But in case of huge amount of iterations it starts to slow
down due to some performance degradation.
So, the usage of C<List::MoreUtils::samples> (it's the fastest now) and C<List::Util::sample> is more preferable.
I'll keep C<random_slice> for backward compatibility.
view release on metacpan or search on metacpan
lib/List/Pairwise.pod view on Meta::CPAN
statement
my $i;
firstp {
print "$a: $b\n";
++$i==5 # last after 5 iterations
} %hash;
=item lastp BLOCK LIST
=item last_pairwise BLOCK LIST
view release on metacpan or search on metacpan
-npro
-nsfs
--blank-lines-before-packages=0
--opening-hash-brace-right
--no-outdent-long-comments
--iterations=2
-wbb="% + - * / x != == >= <= =~ !~ < > | & >= < = **= += *= &= <<= &&= -= /= |= >>= ||= .= %= ^= x="
view release on metacpan or search on metacpan
-npro
-nsfs
--blank-lines-before-packages=0
--opening-hash-brace-right
--no-outdent-long-comments
--iterations=2
-wbb="% + - * / x != == >= <= =~ !~ < > | & >= < = **= += *= &= <<= &&= -= /= |= >>= ||= .= %= ^= x="
view release on metacpan or search on metacpan
etc/bench/bench.pl view on Meta::CPAN
bmzy ovt anya bclp aijn dmmr
ok 1 - same order
ok 2 - same contents, list-u-det-order
ok 3 - same contents, hash ordered
1..3
(warning: too few iterations for a reliable count)
Rate lbs lmu lho ldd baseline
lbs 9.73e-002/s -- -8% -94% -97% -100%
lmu 0.105/s 8% -- -94% -97% -100%
lho 1.62/s 1570% 1444% -- -53% -96%
ldd 3.48/s 3476% 3207% 114% -- -92%