Regex: How to turn more words in the line as if they were seen in the mirror?
-
Hello @robin-cruise and All,
I’ve got a solution ;-)) My regex S/R uses the
free-spacingmode, for the Search part :From these sites :
https://i.redd.it/vhv1j2pu2p5z.png
https://arxiv.org/ftp/arxiv/papers/1207/1207.2334.pdf ( See table
7page20)I’ve only considered words containing from
2to30letters
So, the SEARCH part is :
(?x)
(?|
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w)(\w) |
(\w)(\w)(\w)(\w) |
(\w)(\w)(\w) |
(\w)(\w)
)and the REPLACE part is :
$30$29$28$27$26$25$24$23$22$21$20$19$18$17$16$15$14$13$12$11$10$9$8$7$6$5$4$3$2$1Note that the
(?|•••••|•••••|.......|•••••|•••••)syntax is called a non-capturing branch reset group. See further information on :https://www.boost.org/doc/libs/1_70_0/libs/regex/doc/html/boost_regex/syntax/perl_syntax.html
Now, follow carefully each step, below :
-
Select all the text between
(?x)and) \b -
Hit the
Ctrl + Cshortcut -
Back to N++, open a new tab (
Ctrl + N) -
Paste the clipboard contents (
Ctrl + V) -
Re-select all this multi-lines text, with
Ctrl + A( IMPORTANT ) -
Open the Replace dialog (
Ctrl + H)
=> The multi-lines Search regex is automatically inserted in the
Find what:zone-
Insert the Replace regex in the
Replace withzone -
Tick or untick the
Wrap aroundoption -
Untick the
Backward direction,Match whole word onlyandIn selectionoptions, if necessary ! -
Now, as all this dialog is preset, just click on the N++ tab where you want to apply this S/R against
-
Put again the Replace dialog in the foreground
-
Click once on the
Replace Allbutton or several times on theReplacebutton
Et voilà ! ( In French ! )
So, from this INPUT text :
A AB ABC ABCD ABCDE ABCDEF ABCDEFG ABCDEFGH ABCDEFGHI ABCDEFGHIJ ABCDEFGHIJK ABCDEFGHIJKL ABCDEFGHIJKLM ABCDEFGHIJKLMN ABCDEFGHIJKLMNO ABCDEFGHIJKLMNOP ABCDEFGHIJKLMNOPQ ABCDEFGHIJKLMNOPQR ABCDEFGHIJKLMNOPQRS ABCDEFGHIJKLMNOPQRST ABCDEFGHIJKLMNOPQRSTU ABCDEFGHIJKLMNOPQRSTUV ABCDEFGHIJKLMNOPQRSTUVW ABCDEFGHIJKLMNOPQRSTUVWX ABCDEFGHIJKLMNOPQRSTUVWXY ABCDEFGHIJKLMNOPQRSTUVWXYZ ABCDEFGHIJKLMNOPQRSTUVWXYZ1 ABCDEFGHIJKLMNOPQRSTUVWXYZ12 ABCDEFGHIJKLMNOPQRSTUVWXYZ123 ABCDEFGHIJKLMNOPQRSTUVWXYZ1234You should get the expected OUTPUT text :
A BA CBA DCBA EDCBA FEDCBA GFEDCBA HGFEDCBA IHGFEDCBA JIHGFEDCBA KJIHGFEDCBA LKJIHGFEDCBA MLKJIHGFEDCBA NMLKJIHGFEDCBA ONMLKJIHGFEDCBA PONMLKJIHGFEDCBA QPONMLKJIHGFEDCBA RQPONMLKJIHGFEDCBA SRQPONMLKJIHGFEDCBA TSRQPONMLKJIHGFEDCBA UTSRQPONMLKJIHGFEDCBA VUTSRQPONMLKJIHGFEDCBA WVUTSRQPONMLKJIHGFEDCBA XWVUTSRQPONMLKJIHGFEDCBA YXWVUTSRQPONMLKJIHGFEDCBA ZYXWVUTSRQPONMLKJIHGFEDCBA 1ZYXWVUTSRQPONMLKJIHGFEDCBA 21ZYXWVUTSRQPONMLKJIHGFEDCBA 321ZYXWVUTSRQPONMLKJIHGFEDCBA 4321ZYXWVUTSRQPONMLKJIHGFEDCBABest Regards,
guy038
P. S. :
-
As a test, copy the
license.txtcontents in a new tab and run this regex S/R :1second later, you’ll get all your mirrored text !! -
If I had not used the
Branch Resetgroup feature, we would have had464groups ! :n × ( n + 1 ) - 1 = 30 × 31 - 1 = 464
-
-
very long Regex, hard to work…
but there are many simple solutions in Python, just run it with any IDLE. For example:
def revwordSentence(Sentence): return ' '.join(word[::-1] for word in Sentence.split(" ")) Sentence = "Your sentence here that will be change" print(revwordSentence(Sentence))OR
def reverseword(str): word = str.split(" ") newWord = [words[::-1] for words in word] new = " ".join(newWord) return new str = "Python Guides is good for beginners" print(reverseword(str))You can find any other Python code examples on internet.
-
@Hellena-Crainicu said in Regex: How to turn more words in the line as if they were seen in the mirror?:
very long Regex, hard to work…
Copy-paste is “hard to work”?
but there are many simple solutions in Python,
Yes, but in general, we don’t care.
There’s also solutions in Java, C, C++, V, etc.
But again, we don’t care.This is a forum about Notepad++, so we concentrate on solutions provided within Notepad++.
We prefer native solutions, like the one @guy038 provided, but when those aren’t available, plugin solutions are valid.Sure, you could’ve turned your suggestion into a PythonScript plugin based one, and that would have been “OK”, but even that is not great because there are so many non-coders that use Notepad++ that are intimidated by a code solution.
Best to take the native solution and run with it, in this particular case.
-
thank you @guy038 I don’t know how can I use your regex, just copy-paste and Replace doesn’t work. Seems that it is a code too large.
@Hellena-Crainicu thanks for your Python Code, I will install Python and I will test those scripts.
@Alan-Kilborn I am using only notepad++, and it is my favorite editor. But if a solution cannot be find in notepad++, I am sure that another solution in other programs will be welcome.
-
@Robin-Cruise said in Regex: How to turn more words in the line as if they were seen in the mirror?:
But if a solution cannot be find in notepad++, I am sure that another solution in other programs will be welcome.
Sure it can be mentioned, but as it is “off-topic” for this forum, it should be just a mention and not an exposition into other tools.
I don’t know how can I use your regex, just copy-paste and Replace doesn’t work.
So one of the things people do when they get answers on this (or any) forum, is that they immediately go off and do their own thinking, without trying exactly what is suggested first.
Suggest you try following the instructions in this section of @guy038 's posting, as exactly written, and I think you’ll find it works just fine:
Now, follow carefully each step, below
-
Hi, @robin-cruise, @alan-kilborn, @hellena-crainicu and all,
First, @robin-cruise, as suggested by @alan-kilborn, just execute each step, one after another and the replacement will occur ;-))
Now, let’s suppose that we want to consider expressions like
middle-agedorI'morJohn'sas single words ! So, we must include the dash (-), the apostrophe (') and the right single quotation mark (’) as word charactersSo each single character to find can be expressed with the character class
[\w'’-]Now, in order to look for the consecutive letters of a word, we’ll use the general syntax
([\w'’-])((?1))((?1))•••••((?1))where(?1)is a subroutine call to group1, so[\w'’-]and the outer parentheses, of each(?1), stores the corresponding character as groups2,3, and so on …So, here is, below, a regex S/R, which deals with expressions from
2to24letters, only. It’s our best solution as the overall regex cannot exceed2,048characters !SEARCH :
(?x)
(?|
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1))((?1)) |
([\w'’-])((?1))((?1))((?1)) |
([\w'’-])((?1))((?1)) |
([\w'’-])((?1))
)REPLACE :
$24$23$22$21$20$19$18$17$16$15$14$13$12$11$10$9$8$7$6$5$4$3$2$1
So this INPUT text :
Mary's brother is a middle-aged personwill be changed as :
s'yraM rehtorb si a dega-elddim nosrepWith the regex S/R, provided in my previous post, we would have obtained, instead :
yraM's rehtorb si a elddim-dega nosrepCheers,
guy038
P.S. :
You’ll need to search for words containing
25or more letters, by yourself, with the regex[\w'’-]{25,}and, then, change these words manually. Not a big task, anyway ! -
@Robin-Cruise said in Regex: How to turn more words in the line as if they were seen in the mirror?:
Mirrors Actually Flip the Letters in a Word? Or, how to turn more words in the line as if they were seen in the mirror?
For example:
At the Olympics you run not only for yourself, but for all people.
After using a regex formula, the output should be:
Ta eht scipmylO uoy nur ton ylno rof flesruoy, tub rof lla elpoep.Using the examples provided (by OP and @guy038) the following regex would do the job. It is much shorter than the second regex provided by @guy038, although I should add that my regex will (currently) work with a word of between 2 to 39 characters long.
The regex could be extended much further as not anywhere approaching the 2048 character limit. A calculation suggests a word of 79 characters could be accomodated as
([\w'’-])?(?(19)([\w'’-]))is 26 characters long. Divided into 2048 we have 78 with 20 to spare. 20 together with the #1-#9 groups saving another 9 characters allows for 1 additional word character. I am not going to write a regex that long even if I can cheat by using a number of Notepad++ functions to create that regex.So using the Replace With function we have:
Find What:\b([\w'’-])([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?(?(19)([\w'’-]))(?(18)([\w'’-]))(?(17)([\w'’-]))(?(16)([\w'’-]))(?(15)([\w'’-]))(?(14)([\w'’-]))(?(13)([\w'’-]))(?(12)([\w'’-]))(?(11)([\w'’-]))(?(10)([\w'’-]))(?(9)([\w'’-]))(?(8)([\w'’-]))(?(7)([\w'’-]))(?(6)([\w'’-]))(?(5)([\w'’-]))(?(4)([\w'’-]))(?(3)([\w'’-]))(?(2)([\w'’-]))([\w'’-])\b
Replace With:${39}${38}${37}${36}${35}${34}${33}${32}${31}${30}${29}${28}${27}${26}${25}${24}${23}${22}${21}${20}${19}${18}${17}${16}${15}${14}${13}${12}${11}${10}${9}${8}${7}${6}${5}${4}${3}${2}${1}What follows is how I reached the solution and need not be read unless you want an in-depth foundation on how it works.
What is occuring is that it has to capture a minimum of 2 word characters (plus additional characters)
[\w'’-], and that is the first and last capture groups in the regex. There are 39 capture groups with pairs of #2 & #38, #3 & #37, #4 & #36 etc linked together. That is to say if capture group #2 does capture a character then capture group #38 MUST also capture a character. Since these work as pairs and I already have the first and last capture groups which also MUST capture a character each I needed to include another capture group which operates alone, allowing for an odd numbered length word, this is the one immediately before(?(19)([\w'’-])).Of course the replacement field just needs to write these capture groups back in reverse order. If a capture group never stored a character it doesn’t write anything back.
Terry
-
@Terry-R your Regex works fine, except that no more than 74 words ( 462 characters) can be change.But, important is that is working fine
@guy038 I have a little problem. I copy and find with your regex. The search works. Just like in your first regex. Good.
But the replacement doesn’t work. Says that all occurrences were replaced in entire file, but actually nothing is change.
-
@Robin-Cruise said in Regex: How to turn more words in the line as if they were seen in the mirror?:
your Regex works fine, except that no more than 74 words ( 462 characters) can be change.
I don’t understand what you mean by 74 words. Currently any word of 39 characters or less will be “mirrored”. So if you have a document of many words, all shorter than 40 characters they will ALL reverse. If you have a problem, then possibly the next word (75th) is longer or has some other issue.
Maybe you need to provide an example around the area my regex fails, or even better a link to download the file you are testing with.
Terry
-
@Terry-R your regex is very good, except it cannot replace more than 74 words (aprox.)
For example, try yourself to replace this text, you will see that you have to shorten it:
I hear the echo of my mind on the mist of the summer wind. And, most importantly, when you listen to something soothing, it is because your soul is there, in the sun, by the sea, by the sand, barely looking for that special something that will not consume you, a sparkle, a beautiful word, a contoured idea of a thought that crosses your mind and that you can only share with yourself. It all starts with a thought that appears in the field of your consciousness. The heat of the summer wind is still there. -
@Robin-Cruise said in Regex: How to turn more words in the line as if they were seen in the mirror?:
For example, try yourself to replace this text, you will see that you have to shorten it:
Nope, did not need to shorten it, changed all the 2 (or more) letter words. Here is the result:
So that was 90 changes made.
I recall from previous posts finding solutions for you forum members have often had problems getting you to understand the need for accuracy in copying the expressions we supply. And also issues with getting you to actually supply examples where issues occur. I can only reiterate those sentiments, you do need to be accurate and provide good examples when you find issues. The above example you provided was not a problem when I tested it.
Terry
-
Hi, @robin-cruise, @alan-kilborn, @hellena-crainicu, @terry-r and all,
Sorry, Terry, that I have not commented on your solution yet, but I was busy sorting out a lot of photos, and reducing their size by lowering their
JPEGquality factor !And, indeed, your solution, with conditional expressions, is really impressive ! Where I use brute force, you use a very subtle method ;-))
I did some additional tests with the
license.txtfile. I tested if the two\bassertions are necessary in my and your solutions ! And it happens that the only difference is about words ending with an apostrophe, as in this beginning of sentence :For both users' and authors' sake, ...-
With the
\bassertions the text becomesroF htob sresu' dna srohtua' ekas, ... -
Without the
\bassertions the text becomesroF htob 'sresu dna 'srohtua ekas, ...
Omitting the
\bassertions seems more logical as we consider the apostrophe as a word char itself. So the ending'must becomes a starting', after replacement !
So, your search regex can be expressed, in free-spacing mode, as :
(?x) ([\w'’-]) # Group 01 FIRST char of a 'word' ([\w'’-])? # Group 02 ([\w'’-])? # Group 03 ([\w'’-])? # Group 04 ([\w'’-])? # Group 05 ([\w'’-])? # Group 06 ([\w'’-])? # Group 07 ([\w'’-])? # Group 08 ([\w'’-])? # Group 09 ([\w'’-])? # Group 10 ([\w'’-])? # Group 11 ([\w'’-])? # Group 12 ([\w'’-])? # Group 13 ([\w'’-])? # Group 14 ([\w'’-])? # Group 15 ([\w'’-])? # Group 16 ([\w'’-])? # Group 17 ([\w'’-])? # Group 18 ([\w'’-])? # Group 19 ([\w'’-])? # Group 20 CENTRAL char when 'word' with an ODD number of letters (?(19) ([\w'’-])) # Group 21 (?(18) ([\w'’-])) # Group 22 (?(17) ([\w'’-])) # Group 23 (?(16) ([\w'’-])) # Group 24 (?(15) ([\w'’-])) # Group 25 (?(14) ([\w'’-])) # Group 26 (?(13) ([\w'’-])) # Group 27 (?(12) ([\w'’-])) # Group 28 (?(11) ([\w'’-])) # Group 29 (?(10) ([\w'’-])) # Group 30 (?(9) ([\w'’-])) # Group 31 (?(8) ([\w'’-])) # Group 32 (?(7) ([\w'’-])) # Group 33 (?(6) ([\w'’-])) # Group 34 (?(5) ([\w'’-])) # Group 35 (?(4) ([\w'’-])) # Group 36 (?(3) ([\w'’-])) # Group 37 (?(2) ([\w'’-])) # Group 38 ([\w'’-]) # Group 39 LAST char of a 'word'And the replacement part is the single line :
$39$38$37$36$35$34$33$32$31$30$29$28$27$26$25$24$23$22$21$20$19$18$17$16$15$14$13$12$11$10$9$8$7$6$5$4$3$2$1
And, we have the general template :
- For words containing 1 WORD char => NOT processed - For words containing 2 WORD chars => The groups 1 and 39 are DEFINED - For words containing 3 WORD chars => The groups 1, 20, and 39 are DEFINED - For words containing 4 WORD chars => The groups 1, 2, 38 and 39 are DEFINED - For words containing 5 WORD chars => The groups 1, 2, 20, 38 and 39 are DEFINED - For words containing 6 WORD chars => The groups 1, 2, 3, 37, 38 and 39 are DEFINED - For words containing 7 WORD chars => The groups 1, 2, 3, 20, 37, 38 and 39 are DEFINED ... ...Again, a very nice and clever solution !
Best Regards,
guy038
-
-
@guy038 said in Regex: How to turn more words in the line as if they were seen in the mirror?:
Omitting the \b assertions seems more logical as we consider the apostrophe as a word char itself. So the ending ’ must becomes a starting ', after replacement !
Thanks @guy038 for your background research. Whilst removing the
\bworks, it seemed to me to be illogical to do so, yet the facts seem to prove it. I would not have considered that option.What I have been doing though is to do some additional research on my solution, see if it’s possible to include other features. One which I was successful with, is to also work on single letter words. You may ask why, however often a single letter word (I, A) are at the start of a sentence, or at least capitalised. I figured that the result might be to not only reverse the letters but to make ALL letters lowercase.
So the latest version including your removal of
\band incorporating single letter words is (this regex works on a maximum of 25 letter words, more on that later).Find What:
([\w'’-])([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?([\w'’-])?(?(12)([\w'’-]))(?(11)([\w'’-]))(?(10)([\w'’-]))(?(9)([\w'’-]))(?(8)([\w'’-]))(?(7)([\w'’-]))(?(6)([\w'’-]))(?(5)([\w'’-]))(?(4)([\w'’-]))(?(3)([\w'’-]))(?(2)([\w'’-]))([\w'’-])|(\w)
Replace With:\L${26}${25}${24}${23}${22}${21}${20}${19}${18}${17}${16}${15}${14}${13}${12}${11}${10}${9}${8}${7}${6}${5}${4}${3}${2}${1}The reason for working to a maximum of 25 letters (similar to your 24 letter word max) was to look at the number of steps taken to process and indirectly time to process. I used the OP’s initial example and used the regex101.com website to show stats.
My regex took 20892 steps and a time of 6.1ms. Your regex took (for the same example) 5506 steps and a time of 0.9ms. So my regex takes almost 4 times as many steps to process a file as yours, but more importantly it takes over 6 times longer to process that file.
I’d mentioned some time ago about making regex efficient and whilst for normal use it doesn’t cause any issues not being totally efficient I wondered if in this case the process time might be significant enough for users who are otherwise unfamiliar with potential lag in processing time.
I ran my (revised) regex on the LICENSE.TXT file (for Notepad++) and it completed in about 1 second for just over 5800 words. So the conclusion seems to be that whilst my regex will take 6 times longer than yours to process, the “wait to complete” time will be minimal.
Cheers
Terry -
@Terry-R very good solution.
-
Hello, @robin-cruise, @alan-kilborn, @hellena-crainicu, @terry-r and all,
@terry-R, yes, I suppose that a limit of
24/25characters, for length of English words, seems sensible, anyway !In this article :
https://en.wikipedia.org/wiki/Longest_word_in_English#Major_dictionaries
it is said :
Ross Eckler has noted that most of the longest English words are not likely to occur in general text, meaning non-technical present-day text seen by casual readers, in which the author did not specifically intend to use an unusually long word. According to Eckler, the longest words likely to be encountered, in general text, are
deinstitutionalizationandcounterrevolutionaries, with22letters each.
Note also this curiosity, in your country :
https://en.wikipedia.org/wiki/Longest_word_in_English#Place_names
BR
guy038
-
I thought of a much simpler solution, maybe you can help me a little bit.
SEARCH:
([A-Za-z0-9\-\'])+REPLACE BY:
\1The only inconvenience, is that after S/R, I get only the last letter from each word. I don’t know where the other letters were lost…
Maybe some of you will update a little bit my regex, as to find a simple solution.
of cours, I can obtain many letters, if I double the regex as:
SEARCH:
([A-Za-z0-9\-\'])+([A-Za-z0-9\-\'])+([A-Za-z0-9\-\'])+([A-Za-z0-9\-\'])+REPLACE BY:
\4\3\2\1 -
@Hellena-Crainicu said in Regex: How to turn more words in the line as if they were seen in the mirror?:
I thought of a much simpler solution, maybe you can help me a little bit.
Your idea is actually just a rehash of the ones provided by @guy038 and myself. You have a lot to learn yet about regex, but don’t worry, this is a good way to learn. By trying something, realising it didn’t work, you at least have opportunity to dissect it and understand yet more about regex.
I use the website rexegg.com as a good source of information. Just be aware that it refers to the many different flavours of regular expressions, not all examples will work in Notepad++. There are also other good sources of regex information available through the FAQ section of the forum.
In your regex the
[A-Za-z0-9\-\']is almost identical to the\wthat we used. You also ask where the other letters went to, in finding only the last letter was returned by using\1when your find expression had the+at the end. The reason is that at the point the capture group saved any characters the+was outside of the(). So the expression captured a single character, then as the+was processed, it AGAIN captured a character, but in doing so the capture group\1was overwritten with the latest character. Had you put the+inside of the()you will get all characters returned, but they will be in the original order.At the moment I think @guy038 and my solutions are as good as it gets within a regex world. Whilst we have shown it is possible with a regular expression to “mirror” (reverse) a word it does take quite a bit of coding to do so. Python (and other) language solutions work far more efficiently as they will often have higher level functions to take care of most of the hard work. In regex everything must be completed simply.
Terry
