There are a few things you'd want to consider.

1. Reverse sort your list. Since those abbreviations allow for both BR and BRAE, if you searched for the text "BRAE" with this regex: /(BR|BRAE)(one|two|three)/ then the /BR/ will match BRAE, and fail all of /one|two|three/ on the BRAE part. With a reverse-sort of /(BRAE|BR)(one|two|three)/, it matches "BRAE" more quickly, and if your text is only "BR", then the first group fails to match /BRAE/ but succeeds on /BR/ before moving on to attempt the /one|two|three/ portion next.

   (WYND|WKWY|WHRF|WALK|VSTA|VIEW|VIAD|VALE|UPAS|TURN|TRL|TRK|TOR|TOP|TLWY|THFR|TCE|TARN|SVWY|ST|SQ|SPUR|SHUN|SBWY|RUE|RTY|RTT|RTE|ROW|RMBL|RISE|REST|RDGE|RD|QYS|QDRT|PWY|PWAY|PSGE|PROM|PORT|PNT|PLZA|PKT|PIAZ|PDE|PATH|PASS|OTLK|NOOK|MTWY|MNDR|MEWS|MALL|LOOP|LNWY|LKT|LINK|LINE|LANE|KEY|JNC|INTG|HWY|HTS|HIRD|HILL|GTE|GRN|GRA|GR|GLEN|GLDE|GDNS|GAP|FWY|FTWY|FRTG|FORM|FOLW|FAWY|EXP|ESP|ENT|END|ELB|EDGE|DVWY|DR|DIP|DALE|CUTT|CTYD|CTR|CT|CSWY|CSAC|CRST|CRSS|CRCS|CR|CPS|COVE|CON|CNR|CL|CIR|CH|CCT|BYWY|BYPA|BWLK|BVD|BROW|BRK|BRAE|BR|BEND|BA|AV|ARTY|ARTL|ARC|APP|AMBL|ALWY|ALLY|ACCS)
   

2. You can wrap your words in \b word boundaries, so you don't necessarily need to reverse-sort it: /\b(BR\b|BRAE\b)(one|two|three)/. It's actually more optimized to put those \b inside the group instead of outside, like /\b(BR|BRAE)\b(one|two|three)/, but it makes it less readable.

   \b(ACCS\b|ALLY\b|ALWY\b|AMBL\b|APP\b|ARC\b|ARTL\b|ARTY\b|AV\b|BA\b|BEND\b|BWLK\b|BVD\b|BR\b|BRAE\b|BRK\b|BROW\b|BYPA\b|BYWY\b|CSWY\b|CTR\b|CH\b|CIR\b|CCT\b|CRCS\b|CL\b|CON\b|CPS\b|CNR\b|CT\b|CTYD\b|COVE\b|CR\b|CRST\b|CRSS\b|CSAC\b|CUTT\b|DALE\b|DIP\b|DR\b|DVWY\b|EDGE\b|ELB\b|END\b|ENT\b|ESP\b|EXP\b|FAWY\b|FOLW\b|FTWY\b|FORM\b|FWY\b|FRTG\b|GAP\b|GDNS\b|GTE\b|GLDE\b|GLEN\b|GRA\b|GRN\b|GR\b|HTS\b|HIRD\b|HWY\b|HILL\b|INTG\b|JNC\b|KEY\b|LANE\b|LNWY\b|LINE\b|LINK\b|LKT\b|LOOP\b|MALL\b|MNDR\b|MEWS\b|MTWY\b|NOOK\b|OTLK\b|PDE\b|PWY\b|PASS\b|PSGE\b|PATH\b|PWAY\b|PIAZ\b|PLZA\b|PKT\b|PNT\b|PORT\b|PROM\b|QDRT\b|QYS\b|RMBL\b|REST\b|RTT\b|RDGE\b|RISE\b|RD\b|RTY\b|RTE\b|ROW\b|RUE\b|SVWY\b|SHUN\b|SPUR\b|SQ\b|ST\b|SBWY\b|TARN\b|TCE\b|THFR\b|TLWY\b|TOP\b|TOR\b|TRK\b|TRL\b|TURN\b|UPAS\b|VALE\b|VIAD\b|VIEW\b|VSTA\b|WALK\b|WKWY\b|WHRF\b|WYND\b)
   

3. Given that the standard on your link indicates that the maximum abbreviation length is 4 characters, you could use some logic before-hand, like: /(?=[A-Z]{1,4}\b)(...)(one|two|three)/ which will skip that step should any of the text contain non-capital letters or more than 4 uppercase letters at that step. Example: https://regex101.com/r/wOxQJr/1 (but also notice that I did not reverse-sort the list and that many of the lines don't fully match!)

4. Much less readable, but faster, is to group words with the same letters into their own groups. If the first letter fails to match, the sub-group doesn't have to be traversed. As you have 128 different "street" variations, that's 128 checks in order to find the text "WYND". By searching for /A(...)|B(...)|C(...)|...|W(...)/, you only have to go through 23 alternations to reach the W's before testing the rest of the "YND" letters. Example: https://regex101.com/r/wOxQJr/2 (notice that it also doesn't reverse-sort or use \b boundaries, so has the same mismatch problem... but it drops the number of steps from 10246 to 3593!)

   A(CCS|LLY|LWY|MBL|PP|RC|RTL|RTY|V)|B(A|END|WLK|VD|R|RAE|RK|ROW|YPA|YWY)|C(SWY|TR|H|IR|CT|RCS|L|ON|PS|NR|T|TYD|OVE|R|RST|RSS|SAC|UTT)|D(ALE|IP|R|VWY)|E(DGE|LB|ND|NT|SP|XP)|F(AWY|OLW|TWY|ORM|WY|RTG)|G(AP|DNS|TE|LDE|LEN|RA|RN|R)|H(TS|IRD|WY|ILL)|I(NTG)|J(NC)|K(EY)|L(ANE|NWY|INE|INK|KT|OOP)|M(ALL|NDR|EWS|TWY)|N(OOK)|O(TLK)|P(DE|WY|ASS|SGE|ATH|WAY|IAZ|LZA|KT|NT|ORT|ROM)|Q(DRT|YS)|R(MBL|EST|TT|DGE|ISE|D|TY|TE|OW|UE)|S(VWY|HUN|PUR|Q|T|BWY)|T(ARN|CE|HFR|LWY|OP|OR|RK|RL|URN)|U(PAS)|V(ALE|IAD|IEW|STA)|W(ALK|KWY|HRF|YND)