aboutsummaryrefslogtreecommitdiff
path: root/mlir/docs/Canonicalization.md
diff options
context:
space:
mode:
Diffstat (limited to 'mlir/docs/Canonicalization.md')
-rw-r--r--mlir/docs/Canonicalization.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/mlir/docs/Canonicalization.md b/mlir/docs/Canonicalization.md
index 686e500..2622c08 100644
--- a/mlir/docs/Canonicalization.md
+++ b/mlir/docs/Canonicalization.md
@@ -55,7 +55,7 @@ Some important things to think about w.r.t. canonicalization patterns:
* It is always good to eliminate operations entirely when possible, e.g. by
folding known identities (like "x + 0 = x").
-* Pattens with expensive running time (i.e. have O(n) complexity) or
+* Patterns with expensive running time (i.e. have O(n) complexity) or
complicated cost models don't belong to canonicalization: since the
algorithm is executed iteratively until fixed-point we want patterns that
execute quickly (in particular their matching phase).