Skip to content

Commit 2b7ef71

Browse files
[CodeStyle][Typos][T-[6-10]] Fix typo('Ture',''traget,''tempory,'tenosr','thier') (#7583)
* Fix-c-1-5 * fix-t1-t5 * fix_HOT_1 * del_typos * test * . * debug * world-debug * fix-t6-t7
1 parent a9812f5 commit 2b7ef71

File tree

5 files changed

+4
-8
lines changed

5 files changed

+4
-8
lines changed

_typos.toml

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -53,7 +53,6 @@ Similarily = "Similarily"
5353
Simle = "Simle"
5454
Sovler = "Sovler"
5555
Successed = "Successed"
56-
Ture = "Ture"
5756
accordding = "accordding"
5857
accoustic = "accoustic"
5958
accpetance = "accpetance"
@@ -190,9 +189,6 @@ sucess = "sucess"
190189
sucessor = "sucessor"
191190
sucessors = "sucessors"
192191
szie = "szie"
193-
tempory = "tempory"
194-
thier = "thier"
195-
traget = "traget"
196192
traing = "traing"
197193
trainning = "trainning"
198194
transfered = "transfered"

docs/api/paddle/combinations_cn.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ combinations
66
.. py:function:: paddle.combinations(x, r=2, with_replacement=False, name=None)
77
88
对输入 Tensor 计算长度为 r 的情况下的所有组合,当 `with_replacement` 设为 False,可类比 python 内置 API `itertools.combinations` 。
9-
当 `with_replacement` 设为 True,可类比 python 内置 API `itertools.combinations_with_replacement(with_replacement=Ture)`。
9+
当 `with_replacement` 设为 True,可类比 python 内置 API `itertools.combinations_with_replacement(with_replacement=True)`。
1010

1111
参数
1212
::::::::::

docs/design/memory/memory_optimization.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -49,7 +49,7 @@ It's not enough to only have some basic strategies. The pre-requisite of memory
4949

5050
In our design, the neural network topology is defined as a program. Luckily, [live variable analysis](https://en.wikipedia.org/wiki/Live_variable_analysis) is a classic problem in compilers which can be used in many stages, such as register allocation.
5151

52-
In compilers, the front end of the compiler translates programs into an intermediate language with an unbounded number of temporary variables. This program must run on a machine with a bounded number of registers. Two temporary variables a and b can fit into the same register, if a and b are never "in use" at the same time. Thus, many temporary variables can fit in few registers; if they don't all fit, the excess tempory variables can be kept in memory.
52+
In compilers, the front end of the compiler translates programs into an intermediate language with an unbounded number of temporary variables. This program must run on a machine with a bounded number of registers. Two temporary variables a and b can fit into the same register, if a and b are never "in use" at the same time. Thus, many temporary variables can fit in few registers; if they don't all fit, the excess temporary variables can be kept in memory.
5353

5454
Therefore, the compiler needs to analyze the intermediate-representation program to determine which temporary variables are in use at the same time. We say a variable is "live" if it holds a value that may be needed in the future, so this analysis is called liveness analysis.
5555

docs/design/modules/prune.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -45,7 +45,7 @@ If an operator needs to be run, it must fall into one of the following cases:
4545
1. It is the target.
4646
2. It is depended by some other ops, meaning its output is some other op's input.
4747

48-
The first case can be checked by `op_desc.is_traget()` . The second case can be implement as
48+
The first case can be checked by `op_desc.is_target()` . The second case can be implement as
4949

5050
```c++
5151
bool HasDependentVar(const OpDesc& op_desc, const std::set<string>& dependent_vars) {

docs/guides/advanced/layer_and_model_en.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ In this guide, you will learn how to define and make use of models in Paddle, an
1111

1212
In Paddle, most models consist of a series of layers. Layer serves as the foundamental logical unit of a model, composed of two parts: the variable that participates in the computation and the operator(s) that actually perform the execution.
1313

14-
Constructing a model from scratch could be painful, with tons of nested codes to write and maintain. To make life easier, Paddle provides foundamental data structure ``paddle.nn.Layer`` to simplify the contruction of layer or model. One may easily inherit from ``paddle.nn.Layer`` to define thier custom layers or models. In addition, since both model and layer are essentially inherited from ``paddle.nn.Layer``, model is nothing but a special layer in Paddle.
14+
Constructing a model from scratch could be painful, with tons of nested codes to write and maintain. To make life easier, Paddle provides foundamental data structure ``paddle.nn.Layer`` to simplify the contruction of layer or model. One may easily inherit from ``paddle.nn.Layer`` to define their custom layers or models. In addition, since both model and layer are essentially inherited from ``paddle.nn.Layer``, model is nothing but a special layer in Paddle.
1515

1616
Now let us construct a model using ``paddle.nn.Layer``:
1717

0 commit comments

Comments
 (0)