|
-
+
@@ -1258,7 +1258,7 @@
-
+
Section
diff --git a/data/schemata/bcf.rnc b/data/schemata/bcf.rnc
index 8192b5e3d..8c943793f 100644
--- a/data/schemata/bcf.rnc
+++ b/data/schemata/bcf.rnc
@@ -121,7 +121,7 @@ start =
# the option into on reading it
attribute backendin {xsd:string}?,
# Applies to ENTRY, NAMELIST and NAME scope
- # Determines whether biber will write the option to its ouput (e.g.
+ # Determines whether biber will write the option to its output (e.g.
# .bbl) because biblatex needs to know the value.
attribute backendout {xsd:boolean}?,
xsd:string
diff --git a/data/schemata/bcf.rng b/data/schemata/bcf.rng
index 5c24eaaed..fbe72d016 100644
--- a/data/schemata/bcf.rng
+++ b/data/schemata/bcf.rng
@@ -242,7 +242,7 @@
diff --git a/data/schemata/config.rnc b/data/schemata/config.rnc
index e22d62657..1a6b7fef2 100644
--- a/data/schemata/config.rnc
+++ b/data/schemata/config.rnc
@@ -10,7 +10,7 @@ start =
# the option into on reading it
attribute backendin {xsd:string}?,
# Applies to ENTRY, NAMELIST and NAME scope
- # Determines whether biber will write the option to its ouput (e.g.
+ # Determines whether biber will write the option to its output (e.g.
# .bbl) because biblatex needs to know the value.
attribute backendout {xsd:boolean}?,
xsd:string
diff --git a/data/schemata/config.rng b/data/schemata/config.rng
index cc5368260..0a783b9ef 100644
--- a/data/schemata/config.rng
+++ b/data/schemata/config.rng
@@ -38,7 +38,7 @@
diff --git a/doc/biber.tex b/doc/biber.tex
index 7db776f0c..ae44a72b7 100644
--- a/doc/biber.tex
+++ b/doc/biber.tex
@@ -98,7 +98,7 @@ \section{Important Changes}\label{special}
things like incompatible changes which users should be aware of.
\minisec{2.15}
-The BBLXML output format is deprected and will be removed in version 4. It
+The BBLXML output format is deprecated and will be removed in version 4. It
is rarely used and is not worth the overhead of test complications.
Datamodel override via the user configuration file has been made more
@@ -2431,7 +2431,7 @@ \subsection{The Data Model}\label{ref:datamodel}
datamodel changes in XML in the \biber config file. This is a matter of
choice and/or convenience since the datamodel \TeX\ macro interface simply
results in XML definitions in the \opt{.bcf} anyway and these latter are
-overriden by the XML definitions in the \biber config file. For example, to
+overridden by the XML definitions in the \biber config file. For example, to
add a new name list field \bibfield{DIRECTOR} to \bibfield{VIDEO} entry
types, you can either use the \biblatex macros \cmd{DeclareDatamodelFields}
and \cmd{DeclareDatamodelEntryfields} in your document or put the following
@@ -2463,7 +2463,7 @@ \subsection{Tool Mode}\label{ref:tool}
defaulting to a \bibtex file called «\file{\_bibertool.bib}» if
the options \opt{--output-file} and \opt{--output-format} are not specified.
-Tool mode is useful if you need to programatically change your datasource
+Tool mode is useful if you need to programmatically change your datasource
using the semantics provided by \biber or if you would like to convert your
data to a different format. For example, you could choose to reencode your
datasource by turning all UTF-8 characters into \latex\ macros:
@@ -2718,7 +2718,7 @@ \subsection{Tool Mode}\label{ref:tool}
\end{itemize}
Tool mode can also be used to convert between datasource
-formats. For example, if you wish to covert a \bibtex format data file to
+formats. For example, if you wish to convert a \bibtex format data file to
the experimental \texttt{biblatexml} XML format, you can do:
\begin{verbatim}
diff --git a/etc/definitions.bib b/etc/definitions.bib
index 003c6dd4b..486b9dbe5 100644
--- a/etc/definitions.bib
+++ b/etc/definitions.bib
@@ -43,7 +43,7 @@ @string{fundmath
@string{gc = "Graphs and Combinatorics"}
@string{ic = "Information and Control"}
@string{ic2 = "Information and Computation"}
-@string{ietc = "IEEE Transations on Computers"}
+@string{ietc = "IEEE Transactions on Computers"}
@string{ieeetc = "IEEE Transactions on Computers"}
@string{ieeetcs = "IEEE Transactions on Circuits and Systems"}
@string{ieeetct = "IEEE Transactions on Circuit Theory"}
@@ -546,7 +546,7 @@ @string{wg07
@string{wg08 = "Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008"}
@string{wg09 = "Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009"}
-% Stings for the names of Springer LNCS proceedings
+% Strings for the names of Springer LNCS proceedings
@string{lncs52 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 52"}
@string{lncs172 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 172"}
diff --git a/etc/papers.bib b/etc/papers.bib
index 31c1c675f..06d0dc86f 100644
--- a/etc/papers.bib
+++ b/etc/papers.bib
@@ -196,7 +196,7 @@ @incollection{AgrawalKR93
title = {Cutting down on fill using nested dissection: provably good elimination orderings},
booktitle = {Graph Theory and Sparse Matrix Computation},
editor = {A. George and J. Gilbert and J. W. H. Liu},
-series = {IMA Volumes in Mathematics and its Applicatins},
+series = {IMA Volumes in Mathematics and its Applications},
publisher = {Springer-Verlag}, year = 1993, volume = 56, pages = {31-55}}
%Ah
@@ -1085,7 +1085,7 @@ @inproceedings{BerryBC99
author = {A. Berry and J.-P. Bordat and O. Cogis},
title = {Generating all the minimal separators of a graph},
editor = {Peter Widmayer and Gabriele Neyer and Sephan Eidenbenz},
-booktitle = wg99, publsiher = lncs1665, year = 1999, pages = {167-172}}
+booktitle = wg99, publisher = lncs1665, year = 1999, pages = {167-172}}
%Berry 2000
@@ -2906,7 +2906,7 @@ @inproceedings{CanoM94
title = {Heuristic algorithms for the triangulation of graphs},
editor = {B. Bouchon-Meunier and R. R. Yager and I. A. Zadeh},
booktitle = {Advances in Intelligent Computing, Selected Papers from the 5th
-International Conference on Precessing and Management of Uncertainty in
+International Conference on Processing and Management of Uncertainty in
Knowledge-Based Systems IPMU94},
year = 1994, pages = {98-107},
publisher = lncs945}
@@ -4778,7 +4778,7 @@ @article{Djelloul09
@article{Djidjev82,
author = {Hristo N. Djidjev},
-title = {On the problem of partititioning planar graphs},
+title = {On the problem of partitioning planar graphs},
journal = sjadm, volume = 3, year = 1982, pages = {229-240}}
@inproceedings{Djidjev88,
@@ -5038,7 +5038,7 @@ @article{DowneyM07
@article{DowneyFMR08,
author = {Rodney G. Downey and Michael R. Fellows and Catherine McCartin and Frances A. Rosamond},
-title = {Paramterized approximation of dominating set problems},
+title = {Parameterized approximation of dominating set problems},
journal = ipl, volume = 109, year = 2008, pages = {68-70}}
%Dr
@@ -5975,7 +5975,7 @@ @article{FernandezBacaM93
@article{FernandezBacaS94,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
-title = {Parametic Problems on Graphs of Bounded Treewidth},
+title = {Parametric Problems on Graphs of Bounded Treewidth},
journal = ja, volume = 16, pages = {408-430}, year = 1994}
@inproceedings{FernandezBacaS94a,
@@ -6240,7 +6240,7 @@ @article{FominG00
@techreport{FominT02,
author = {F. V. Fomin and D. M. Thilikos},
title = {New upper bounds on the decomposability of planar graphs and fixed
-paramater algorithms},
+parameter algorithms},
year = 2002,
institution = {Universitat Polit\`ecnica de Catalunya},
number = {LSI-02-56-R},
@@ -6486,7 +6486,7 @@ @inproceedings{FortnowS08
author = {Lance Fortnow and Rahul Santhanam},
title = {Infeasibility of instance compression and succinct {PCPs} for {NP}},
booktitle = stoc08, year = 2008, pages = {133-142},
-publisher = {ACM Press}, addres = {New York}}
+publisher = {ACM Press}, address = {New York}}
@article{FortuneHW80,
author = {S. Fortune and J. E. Hopcroft and J. Wyllie},
@@ -8333,7 +8333,7 @@ @article{HeggernesL06
@inproceedings{HeggernesV06,
author = {Pinar Heggernes and Yngve Villanger},
title = {Simple and efficient modifications of elimination orderings},
-booktitle = {Proceedings of the 7th International Conference on Appied Parallel Computing, PARA 2004},
+booktitle = {Proceedings of the 7th International Conference on Applied Parallel Computing, PARA 2004},
year = 2006, publisher = lncs3732, pages = {788-797}}
%Heggernes 2008
@@ -9517,7 +9517,7 @@ @article{Kierstead00
@article{KiersteadT01,
author = {H. A. Kierstead and W. T. Trotter},
-title = {Competive colorings of oriented graphs},
+title = {Competitive colorings of oriented graphs},
journal = ejc, volume = 8, number = 2, year = 2001, pages={R12}}
%Kik
@@ -11549,7 +11549,7 @@ @inproceedings{Moehring90
author = {Rolf H. M{\"{o}}hring},
title = {Graph Problems Related to Gate Matrix Layout and {PLA}
Folding},
-booktitle = {Computational Graph Theory, Comuting Suppl. 7},
+booktitle = {Computational Graph Theory, Computing Suppl. 7},
editor = {E. Mayr and H. Noltemeier and M. Sys{\l}o},
publisher = {Springer Verlag}, pages = {17-51}, year = 1990}
@@ -12283,7 +12283,7 @@ @article{PawagiGR87
@book{Pearl88,
author = {J. Pearl},
-title = {Probablistic Reasoning in Intelligent Systems: Networks of Plausible
+title = {Probabilistic Reasoning in Intelligent Systems: Networks of Plausible
Inference},
publisher = {Morgan Kaufmann}, year = 1988, address = {Palo Alto}}
diff --git a/etc/tugboat.bib b/etc/tugboat.bib
index b06bbb685..00210989b 100644
--- a/etc/tugboat.bib
+++ b/etc/tugboat.bib
@@ -13031,7 +13031,7 @@ @Article{Anonymous:TB8-2-219
journal-URL = "http://www.tug.org/TUGboat/",
}
-@Article{Anonymou:TB8-2-220,
+@Article{Anonymous:TB8-2-220,
author = "Anonymous",
title = "{PROTEXT IV, Boston, Mass., 22--24 October 1987}",
journal = j-TUGboat,
diff --git a/lib/Biber.pm b/lib/Biber.pm
index b8f7e289f..123a321ce 100644
--- a/lib/Biber.pm
+++ b/lib/Biber.pm
@@ -859,7 +859,7 @@ sub parse_ctrlfile {
}
Biber::Config->setblxoption(undef, 'sortingtemplate', $sortingtemplates);
- # DATAMODEL schema (always global and is an array to accomodate multiple
+ # DATAMODEL schema (always global and is an array to accommodate multiple
# datamodels in tool mode)
# Because in tests, parse_ctrlfile() is called several times so we need to sanitise this here
@@ -4845,7 +4845,7 @@ sub get_dependents {
get_dependents($self, $new_deps, $keyswithdeps) if $new_deps->@*;
# Now remove any missing entries from various places in all entries we have flagged
- # as having dependendents. If we don't do this, many things fail later like clone creation
+ # as having dependents. If we don't do this, many things fail later like clone creation
# for related entries etc.
foreach my $keywithdeps ($keyswithdeps->@*) {
foreach my $missing_key ($missing->@*) {
diff --git a/lib/Biber/Config.pm b/lib/Biber/Config.pm
index 1935e0f89..f4f486ba8 100644
--- a/lib/Biber/Config.pm
+++ b/lib/Biber/Config.pm
@@ -161,7 +161,7 @@ sub _initopts {
# Command-line overrides everything else
foreach my $copt (keys $opts->%*) {
# This is a tricky option as we need to keep non-overriden defaults
- # If we don't we can get errors when contructing the sorting call to eval() later
+ # If we don't we can get errors when constructing the sorting call to eval() later
if (lc($copt) eq 'collate_options') {
my $collopts = Biber::Config->getoption('collate_options');
my $copt_h = eval "{ $opts->{$copt} }" or croak('Bad command-line collation options');
diff --git a/lib/Biber/DataModel.pm b/lib/Biber/DataModel.pm
index fff40e2f5..6d9b2d15b 100644
--- a/lib/Biber/DataModel.pm
+++ b/lib/Biber/DataModel.pm
@@ -721,7 +721,7 @@ sub field_is_skipout {
=head2 check_mandatory_constraints
Checks constraints of type "mandatory" on entry and
- returns an arry of warnings, if any
+ returns an array of warnings, if any
=cut
@@ -786,7 +786,7 @@ sub check_mandatory_constraints {
=head2 check_conditional_constraints
Checks constraints of type "conditional" on entry and
- returns an arry of warnings, if any
+ returns an array of warnings, if any
=cut
diff --git a/lib/Biber/Entry/Name.pm b/lib/Biber/Entry/Name.pm
index 33873ccfb..62490dd82 100644
--- a/lib/Biber/Entry/Name.pm
+++ b/lib/Biber/Entry/Name.pm
@@ -173,7 +173,7 @@ sub get_hashid {
sub get_namepart {
my ($self, $namepart) = @_;
- # prevent warnings when concating arbitrary nameparts
+ # prevent warnings when concatenating arbitrary nameparts
return $self->{nameparts}{$namepart}{string} || '';
}
diff --git a/lib/Biber/Input/file/biblatexml.pm b/lib/Biber/Input/file/biblatexml.pm
index 769ed06f4..59b2a5fc2 100644
--- a/lib/Biber/Input/file/biblatexml.pm
+++ b/lib/Biber/Input/file/biblatexml.pm
@@ -1438,7 +1438,7 @@ sub _changenode {
# set attribute value
if ($n->nodeType == XML_ATTRIBUTE_NODE) {
if ($nodeval) {
- $$error = "Tried to replace '$xp_target_s' Atribute node with complex data";
+ $$error = "Tried to replace '$xp_target_s' Attribute node with complex data";
return 0;
}
$n->setValue(NFC($value));
diff --git a/lib/Biber/Input/file/bibtex.pm b/lib/Biber/Input/file/bibtex.pm
index 3f462f988..afbde436c 100644
--- a/lib/Biber/Input/file/bibtex.pm
+++ b/lib/Biber/Input/file/bibtex.pm
@@ -152,7 +152,7 @@ sub extract_entries {
}
# Text::BibTeX can't be controlled by Log4perl so we have to do something clumsy
- # We can't redirect STDERR to a variable as libbtparse doesnt' use PerlIO, just stdio
+ # We can't redirect STDERR to a variable as libbtparse doesn't use PerlIO, just stdio
# so it doesn't understand this. It does understand normal file redirection though as
# that's standard stdio.
# The Log4Perl setup outputs only to STDOUT so redirecting all STDERR like this is
@@ -1924,7 +1924,7 @@ sub parsename_x {
# Generate any stripped information
(my $s, $namec{$np}) = remove_outer($namec{$np});
- # Protect spaces inside {} when splitting to produce intials
+ # Protect spaces inside {} when splitting to produce initials
my $part = $namec{$np};
if ($s) {
$part = $namec{$np} =~ s/\s+/_/gr;
diff --git a/lib/Biber/Internals.pm b/lib/Biber/Internals.pm
index 08b3fe019..d96e83cce 100644
--- a/lib/Biber/Internals.pm
+++ b/lib/Biber/Internals.pm
@@ -772,7 +772,7 @@ sub _process_label_attributes {
}
# Now set a new global index for the name part index which is the maximum of those
- # occuring above a certain threshold
+ # occurring above a certain threshold
foreach my $s (keys %$lcache) {
foreach my $ind (keys %$is) {
next unless $indices{$s} == $ind;
@@ -1322,7 +1322,7 @@ sub _sort_citeorder {
return $ko || $biborder;
}
}
- # otherwise, we need to take account of citations with simulataneous order like
+ # otherwise, we need to take account of citations with simultaneous order like
# \cite{key1, key2} so this tied sorting order can be further sorted with other fields
# Note the fallback of '' - this is for auto-generated entries which are not cited
# and so never have a keyorder entry
@@ -1731,7 +1731,7 @@ sub _liststring {
# These should be symbols which can't appear in lists and which sort before all alphanum
# so that "Alan Smith" sorts after "Al Smith". This means, symbols which normalise_string_sort()
- # strips out. Unfortuately, this means using punctuation and these are by default variable
+ # strips out. Unfortunately, this means using punctuation and these are by default variable
# weight and ignorable in DUCET so we have to redefine these these symbols after loading DUCET
# when sorting so that they are non-ignorable (see Biber.pm)
my $lsi = '!'; # list separator, internal
diff --git a/lib/Biber/LaTeX/Recode.pm b/lib/Biber/LaTeX/Recode.pm
index d9fe2b231..84714e0d4 100644
--- a/lib/Biber/LaTeX/Recode.pm
+++ b/lib/Biber/LaTeX/Recode.pm
@@ -249,7 +249,7 @@ sub latex_decode {
# Hacky - specially protect {\X} which is a simple protection as in
# TITLE = {Part {I}}
- # Can't do this using the seperators above as these are stripping around \X
+ # Can't do this using the separators above as these are stripping around \X
# later to avoid breaking capitliastion/kerning with spurious introduced/retained
# braces
# Using the VLB method from the link below, this is equivalent to:
diff --git a/lib/Biber/Output/base.pm b/lib/Biber/Output/base.pm
index 989ab95b3..be8b3eccb 100644
--- a/lib/Biber/Output/base.pm
+++ b/lib/Biber/Output/base.pm
@@ -362,7 +362,7 @@ sub create_output_section {
my $secnum = $Biber::MASTER->get_current_section;
my $section = $Biber::MASTER->sections->get_section($secnum);
- # We rely on the order of this array for the order of the ouput
+ # We rely on the order of this array for the order of the output
foreach my $k ($section->get_citekeys) {
# Regular entry
my $be = $section->bibentry($k) or biber_error("Cannot find entry with key '$k' to output");
diff --git a/lib/Biber/Utils.pm b/lib/Biber/Utils.pm
index 7b0d4f6dd..adc3c7678 100644
--- a/lib/Biber/Utils.pm
+++ b/lib/Biber/Utils.pm
@@ -1019,7 +1019,7 @@ sub inits {
# The map {} is there to remove broken hyphenated initials returned from btparse
# For example, in the, admittedly strange 'al- Hassan, John', we want the 'al-'
# interpreted as a prefix (because of the following space) but because of the
- # hypen, this is intialised as "a-" by btparse. So we correct such edge cases here by
+ # hyphen, this is initialised as "a-" by btparse. So we correct such edge cases here by
# removing any trailing dashes in initials
return [ map {s/\p{Pd}$//r} split(/(?get_output_obj;
eq_or_diff($out->get_output_entry('murray', $main), $murray2, 'bbl with > maxcitenames, empty alphaothers');
-# Make sure namehash and fullhash are seperately generated
+# Make sure namehash and fullhash are separately generated
eq_or_diff( $out->get_output_entry('anon1', $main), $anon1, 'namehash/fullhash 1' ) ;
eq_or_diff( $out->get_output_entry('anon2', $main), $anon2, 'namehash/fullhash 2' ) ;
diff --git a/t/crossrefs.t b/t/crossrefs.t
index 183f821c9..900015b93 100644
--- a/t/crossrefs.t
+++ b/t/crossrefs.t
@@ -408,7 +408,7 @@ my $cr7 = q| \entry{cr7}{inbook}{}{}
\endentry
|;
-# Default inheritance supressed except for specified
+# Default inheritance suppressed except for specified
my $cr8 = q| \entry{cr8}{incollection}{}{}
\name{author}{1}{}{%
{{hash=3d449e56eb3ca1ae80dc99a18d689795}{%
diff --git a/t/datalists.t b/t/datalists.t
index 272e8a7ff..9c8536a17 100644
--- a/t/datalists.t
+++ b/t/datalists.t
@@ -43,7 +43,7 @@ my $main = $biber->datalists->get_lists_by_attrs(section => 0,
# relying on here for tests
Biber::Config->setoption('bcf', 'datalists.bcf');
-# (re)generate informtion based on option settings
+# (re)generate information based on option settings
$biber->prepare;
my $section = $biber->sections->get_section(0);
my $out = $biber->get_output_obj;
diff --git a/t/maps.t b/t/maps.t
index 166e53523..ac77e2a0e 100644
--- a/t/maps.t
+++ b/t/maps.t
@@ -38,7 +38,7 @@ my $out = $biber->get_output_obj;
my $section = $biber->sections->get_section(0);
my $bibentries = $section->bibentries;
-# Explictly cited ARTICLE, not deleted by map
+# Explicitly cited ARTICLE, not deleted by map
ok(defined($bibentries->entry('maps1')), 'Maps test - 1' );
# \nocite{*} ARTICLE, deleted by map
ok(is_undef($bibentries->entry('maps2')), 'Maps test - 2' );
diff --git a/t/tdata/crossrefs.bib b/t/tdata/crossrefs.bib
index efa65bf57..e347f59b2 100644
--- a/t/tdata/crossrefs.bib
+++ b/t/tdata/crossrefs.bib
@@ -108,7 +108,7 @@ @INBOOK{cr7
YEAR = {2010}
}
-% Testing supression of default inheritance
+% Testing suppression of default inheritance
@COLLECTION{cr8i,
EDITOR = {Brian Editor},
TITLE = {Book Title},
@@ -291,7 +291,7 @@ @BOOK{s2
TITLE = {Title}
}
-% Test of blocking all datepart inhertance when child has any datepart
+% Test of blocking all datepart inheritance when child has any datepart
@INBOOK{b1,
DATE = {2004-03-03},
ORIGDATE = {2004-03},
diff --git a/t/tdata/full-dot.bib b/t/tdata/full-dot.bib
index 57e8de413..7ec3ac4e3 100644
--- a/t/tdata/full-dot.bib
+++ b/t/tdata/full-dot.bib
@@ -108,7 +108,7 @@ @INBOOK{cr7
YEAR = {2010}
}
-% Testing supression of default inheritance
+% Testing suppression of default inheritance
@COLLECTION{cr8i,
EDITOR = {Brian Editor},
TITLE = {Book Title},
|