mirror of
https://github.com/tesseract-ocr/tesseract.git
synced 2024-11-27 20:59:36 +08:00
Fix some typos in comments (most of them found by codespell)
Signed-off-by: Stefan Weil <sw@weilnetz.de>
This commit is contained in:
parent
14c6e38723
commit
56df8e6e19
@ -39,7 +39,7 @@ class TessBaseAPI;
|
||||
* formats. This interface is then used to inject the renderer class into
|
||||
* tesseract when processing images.
|
||||
*
|
||||
* For simplicity implementing this with tesesract version 3.01,
|
||||
* For simplicity implementing this with tesseract version 3.01,
|
||||
* the renderer contains document state that is cleared from document
|
||||
* to document just as the TessBaseAPI is. This way the base API can just
|
||||
* delegate its rendering functionality to injected renderers, and the
|
||||
|
@ -76,7 +76,7 @@ class DENORM {
|
||||
// A DENORM may point to a predecessor DENORM, which is actually the earlier
|
||||
// normalization, so the full normalization sequence involves executing all
|
||||
// predecessors first and then the transform in "this".
|
||||
// Let x be image co-ordinates and that we have normalization classes A, B, C
|
||||
// Let x be image coordinates and that we have normalization classes A, B, C
|
||||
// where we first apply A then B then C to get normalized x':
|
||||
// x' = CBAx
|
||||
// Then the backwards (to original coordinates) would be:
|
||||
|
@ -25,7 +25,7 @@
|
||||
enum TessErrorLogCode {
|
||||
DBG = -1, /*log without alert */
|
||||
TESSLOG = 0, /*alert user */
|
||||
TESSEXIT = 1, /*exit after erro */
|
||||
TESSEXIT = 1, /*exit after error */
|
||||
ABORT = 2 /*abort after error */
|
||||
};
|
||||
|
||||
|
@ -140,7 +140,7 @@ void free_adapted_class(ADAPT_CLASS adapt_class) {
|
||||
/*---------------------------------------------------------------------------*/
|
||||
namespace tesseract {
|
||||
/**
|
||||
* Allocates memory for adapted tempates.
|
||||
* Allocates memory for adapted templates.
|
||||
* each char in unicharset to the newly created templates
|
||||
*
|
||||
* @param InitFromUnicharset if true, add an empty class for
|
||||
|
@ -41,7 +41,7 @@ const double kAdamEpsilon = 1e-8;
|
||||
// W.dim1() - skip_bias_back.
|
||||
// If add_bias_fwd, u is imagined to have an extra element at the end with value
|
||||
// 1, to implement the bias, weight.
|
||||
// If skip_bias_back, we are actullay performing the backwards product on a
|
||||
// If skip_bias_back, we are actually performing the backwards product on a
|
||||
// transposed matrix, so we need to drop the v output corresponding to the last
|
||||
// element in dim1.
|
||||
static inline void MatrixDotVectorInternal(const GENERIC_2D_ARRAY<double>& w,
|
||||
|
@ -384,7 +384,7 @@ BLOBNBOX* AlignedBlob::FindAlignedBlob(const AlignedBlobParams& p,
|
||||
// Compute skew tolerance.
|
||||
int skew_tolerance = p.max_v_gap / kMaxSkewFactor;
|
||||
// Calculate xmin and xmax of the search box so that it contains
|
||||
// all possibly relevant boxes up to p.max_v_gap above or below accoording
|
||||
// all possibly relevant boxes up to p.max_v_gap above or below according
|
||||
// to top_to_bottom.
|
||||
// Start with a notion of vertical with the current estimate.
|
||||
int x2 = (p.max_v_gap * p.vertical.x() + p.vertical.y()/2) / p.vertical.y();
|
||||
|
@ -145,7 +145,7 @@ Pix* ImageFind::FindImages(Pix* pix, DebugPixa* pixa_debug) {
|
||||
}
|
||||
|
||||
// Generates a Boxa, Pixa pair from the input binary (image mask) pix,
|
||||
// analgous to pixConnComp, except that connected components which are nearly
|
||||
// analogous to pixConnComp, except that connected components which are nearly
|
||||
// rectangular are replaced with solid rectangles.
|
||||
// The returned boxa, pixa may be nullptr, meaning no images found.
|
||||
// If not nullptr, they must be destroyed by the caller.
|
||||
|
@ -50,7 +50,7 @@ class ImageFind {
|
||||
static Pix* FindImages(Pix* pix, DebugPixa* pixa_debug);
|
||||
|
||||
// Generates a Boxa, Pixa pair from the input binary (image mask) pix,
|
||||
// analgous to pixConnComp, except that connected components which are nearly
|
||||
// analogous to pixConnComp, except that connected components which are nearly
|
||||
// rectangular are replaced with solid rectangles.
|
||||
// The returned boxa, pixa may be nullptr, meaning no images found.
|
||||
// If not nullptr, they must be destroyed by the caller.
|
||||
|
@ -324,7 +324,7 @@ void TableFinder::LocateTables(ColPartitionGrid* grid,
|
||||
GridMergeTableRegions();
|
||||
|
||||
if (textord_tablefind_recognize_tables) {
|
||||
// Remove false alarms consiting of a single column
|
||||
// Remove false alarms consisting of a single column
|
||||
DeleteSingleColumnTables();
|
||||
|
||||
#ifndef GRAPHICS_DISABLED
|
||||
@ -350,7 +350,7 @@ void TableFinder::LocateTables(ColPartitionGrid* grid,
|
||||
}
|
||||
#endif // GRAPHICS_DISABLED
|
||||
} else {
|
||||
// Remove false alarms consiting of a single column
|
||||
// Remove false alarms consisting of a single column
|
||||
// TODO(nbeato): verify this is a NOP after structured table rejection.
|
||||
// Right now it isn't. If the recognize function is doing what it is
|
||||
// supposed to do, this function is obsolete.
|
||||
@ -1696,7 +1696,7 @@ void TableFinder::IncludeLeftOutColumnHeaders(TBOX* table_box) {
|
||||
}
|
||||
}
|
||||
|
||||
// Remove false alarms consiting of a single column based on their
|
||||
// Remove false alarms consisting of a single column based on their
|
||||
// projection on the x-axis. Projection of a real table on the x-axis
|
||||
// should have at least one zero-valley larger than the global median
|
||||
// x-height of the page.
|
||||
|
@ -350,7 +350,7 @@ class TableFinder {
|
||||
// include them in the table
|
||||
void IncludeLeftOutColumnHeaders(TBOX* table_box);
|
||||
|
||||
// Remove false alarms consiting of a single column
|
||||
// Remove false alarms consisting of a single column
|
||||
void DeleteSingleColumnTables();
|
||||
|
||||
// Return true if at least one gap larger than the global x-height
|
||||
|
Loading…
Reference in New Issue
Block a user