aboutsummaryrefslogtreecommitdiffstats
path: root/tools
diff options
context:
space:
mode:
authorMartin Mathieson <martin.mathieson@keysight.com>2021-04-10 18:45:50 +0100
committerWireshark GitLab Utility <gerald+gitlab-utility@wireshark.org>2021-04-10 22:50:52 +0000
commitd06287ec2e1e54dff3572d426252eaeab4876b10 (patch)
tree2511a5f15ccd8de04092a41362af840cf5fe4504 /tools
parent4bd5830cdaa615a95245e9873f3bae1c42b38dc9 (diff)
Some more spelling fixes.
Changed script to allow recursive search for multi-words.
Diffstat (limited to 'tools')
-rwxr-xr-xtools/check_spelling.py31
1 files changed, 21 insertions, 10 deletions
diff --git a/tools/check_spelling.py b/tools/check_spelling.py
index 65e7f5778e..19f5e011f8 100755
--- a/tools/check_spelling.py
+++ b/tools/check_spelling.py
@@ -99,6 +99,7 @@ class File:
return False
# Try splitting into 2 words recognised at various points.
+ # Allow 3-letter words.
length = len(word)
for idx in range(3, length-3):
word1 = word[0:idx]
@@ -107,18 +108,28 @@ class File:
if not spell.unknown([word1, word2]):
return True
- # Run through, looking for any number of separate words.
- next_word_start = 0
- for idx in range(1, length+1):
- w = word[next_word_start:idx]
- # N.B. allowing shorter words ends in gibberish being accepted.
- if len(w) >= 4 and not spell.unknown([w]):
- next_word_start = idx
- if next_word_start == length:
- return True
+ return self.checkMultiWordsRecursive(word)
- return False
+ def checkMultiWordsRecursive(self, word):
+ length = len(word)
+ #print('word=', word)
+ if length < 4:
+ return False
+
+ for idx in range(4, length+1):
+ w = word[0:idx]
+ #print('considering', w)
+ if not spell.unknown([w]):
+ #print('Recognised!')
+ if idx == len(word):
+ #print('Was end of word, so TRUEE!!!!')
+ return True
+ else:
+ #print('More to go..')
+ if self.checkMultiWordsRecursive(word[idx:]):
+ return True
+ return False
# Check the spelling of all the words we have found
def spellCheck(self):