1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
Description: Fix typos detected by lintian
Bug: https://rt.cpan.org/Ticket/Display.html?id=116572
Author: أحمد المحمودي (Ahmed El-Mahmoudy) <aelmahmoudy@users.sourceforge.net>
Reviewed-by: gregor herrmann <gregoa@debian.org>
Last-Update: 2016-07-29
--- a/lib/Encode/Arabic.pm
+++ b/lib/Encode/Arabic.pm
@@ -188,7 +188,7 @@
=back
There are generic aliases to these provided by L<Encode|Encode>. Case does not matter and all
-characters of the class C<[ _-]> are interchangable.
+characters of the class C<[ _-]> are interchangeable.
Note that the standard L<Encode|Encode> module already deals with several other single-byte encoding
schemes for Arabic popular with whichever operating system, be it *n*x, Windows, DOS or Macintosh.
--- a/bin/decode.pl
+++ b/bin/decode.pl
@@ -56,7 +56,7 @@
The L<Encode|Encode> library provides a unified interface for converting strings
from different encodings into a common representation, and vice versa.
-The L<encode|encode> and L<decode|decode> programs mimick the fuction calls to
+The L<encode|encode> and L<decode|decode> programs mimick the function calls to
the C<encode> and C<decode> methods, respectively.
For the list of supported encoding schemes, please refer to L<Encode|Encode> and
--- a/bin/encode.pl
+++ b/bin/encode.pl
@@ -56,7 +56,7 @@
The L<Encode|Encode> library provides a unified interface for converting strings
from different encodings into a common representation, and vice versa.
-The L<encode|encode> and L<decode|decode> programs mimick the fuction calls to
+The L<encode|encode> and L<decode|decode> programs mimick the function calls to
the C<encode> and C<decode> methods, respectively.
For the list of supported encoding schemes, please refer to L<Encode|Encode> and
--- a/lib/Encode/Mapper.pm
+++ b/lib/Encode/Mapper.pm
@@ -648,13 +648,13 @@
=head2 INTRO AND RULE TYPES
-The module's core is an algoritm which, from the rules given by the user, builds a finite-state
+The module's core is an algorithm which, from the rules given by the user, builds a finite-state
transducer, i.e. an engine performing greedy search in the input stream and producing output
data and side effects relevant to the results of the search. Transducers may be linked one with
another, thus forming multi-level devices suitable for nontrivial encoding/decoding tasks.
The rules declare which input sequences of L<bytes|bytes> to search for, and what to do upon their
-occurence. If the left-hand side (LHS) of a rule is the longest left-most string out of those
+occurrence. If the left-hand side (LHS) of a rule is the longest left-most string out of those
applicable on the input, the righ-hand side (RHS) of the rule is evaluated. The RHS defines the
corresponding output string, and possibly controls the engine as if the extra text were prepended
before the rest of the input:
--- a/lib/Encode/Arabic/Buckwalter.pm
+++ b/lib/Encode/Arabic/Buckwalter.pm
@@ -326,7 +326,7 @@
The module exports as if C<use Encode> also appeared in the package. The other C<import> options are
just delegated to L<Encode|Encode> and imports performed properly.
-The B<conversion modes> of this module allow to override the setting of the C<:xml> option, in addition to
+The B<conversion modes> of this module allow one to override the setting of the C<:xml> option, in addition to
filtering out diacritical marks and stripping off I<kashida>. The modes and aliases relate like this:
our %Encode::Arabic::Buckwalter::modemap = (
|
