Word Search is "too complex" Question

[George Lee]

"The Find What text contains a Pattern Match expression which is too complex."

What is the rule for being too complex? I can't determine the rule just by
playing with it. It's not character limited (other than 255), and it doesn't
seem to be "item" limited (like no more than ten []{} pairing).

 

[Fumei2 via OfficeKB.com]

Can you post what the pattern is?

"The Find What text contains a Pattern Match expression which is too complex."

What is the rule for being too complex? I can't determine the rule just by
playing with it. It's not character limited (other than 255), and it doesn't
seem to be "item" limited (like no more than ten []{} pairing).

 

[George Lee]

Simple cases:
[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘ OK
[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ ‘OK
[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘too long

From these it looks like seven brackets are the maximum. Is there
confirmation of this somewhere? Is this the only condition?

Can you post what the pattern is?

"The Find What text contains a Pattern Match expression which is too complex."

What is the rule for being too complex? I can't determine the rule just by
playing with it. It's not character limited (other than 255), and it doesn't
seem to be "item" limited (like no more than ten []{} pairing).

--
Gerry

Message posted via OfficeKB.com
http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1

.

 

[Doug Robbins - Word MVP]

Instead of constructions such as:

[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ,

Use

[0-9]{#}

where # is the number of digits that you are seeking. or {#,} where you are
seeking at least # digits, {#,##} where you are seeking between # and ##
digits.

--
Hope this helps.

Please reply to the newsgroup unless you wish to avail yourself of my
services on a paid consulting basis.

Doug Robbins - Word MVP, originally posted via msnews.microsoft.com

Simple cases:
[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘ OK
[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ ‘OK
[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘too long

From these it looks like seven brackets are the maximum. Is there
confirmation of this somewhere? Is this the only condition?

Can you post what the pattern is?

"The Find What text contains a Pattern Match expression which is too
complex."

What is the rule for being too complex? I can't determine the rule just
by
playing with it. It's not character limited (other than 255), and it
doesn't
seem to be "item" limited (like no more than ten []{} pairing).

--
Gerry

Message posted via OfficeKB.com
http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1

.

 

[George Lee]

Thanks. I know these examples were contrived and I have workarounds. I was
asking more what the conditions of a "too complex" of a pattern were.
Microsoft doesn't seem to publish those.

Instead of constructions such as:

[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ,

Use

[0-9]{#}

where # is the number of digits that you are seeking. or {#,} where you are
seeking at least # digits, {#,##} where you are seeking between # and ##
digits.

--
Hope this helps.

Please reply to the newsgroup unless you wish to avail yourself of my
services on a paid consulting basis.

Doug Robbins - Word MVP, originally posted via msnews.microsoft.com

Simple cases:
[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘ OK
[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ ‘OK
[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘too long

From these it looks like seven brackets are the maximum. Is there
confirmation of this somewhere? Is this the only condition?

Can you post what the pattern is?

George Lee wrote:
"The Find What text contains a Pattern Match expression which is too
complex."

What is the rule for being too complex? I can't determine the rule just
by
playing with it. It's not character limited (other than 255), and it
doesn't
seem to be "item" limited (like no more than ten []{} pairing).

--
Gerry

Message posted via OfficeKB.com
http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1

.

 

[Tony Jollans]

Word's F&R pattern matching is one of a kind. I have never seen any
documentation that even suggests the notion that an expression can be too
complex. Come to think of it I have rarely seen documentation that
definitevely states anything. All you can really do is experiment. On
occasion I have been surprised to find what I thought quite simple proved
too complex for Microsoft; on other occasions, it has sailed with ease
through things I thought might prove difficult. I have wondered whether 'too
complex' might depend on external factors like memory, but your example
fails for me too, so maybe you have a concrete rule - if you find any more,
do let us know!

--
Enjoy,
Tony

www.WordArticles.com

Thanks. I know these examples were contrived and I have workarounds. I was
asking more what the conditions of a "too complex" of a pattern were.
Microsoft doesn't seem to publish those.

Instead of constructions such as:

[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ,

Use

[0-9]{#}

where # is the number of digits that you are seeking. or {#,} where you
are
seeking at least # digits, {#,##} where you are seeking between # and ##
digits.

--
Hope this helps.

Please reply to the newsgroup unless you wish to avail yourself of my
services on a paid consulting basis.

Doug Robbins - Word MVP, originally posted via msnews.microsoft.com

Simple cases:
[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘ OK
[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ ‘OK
[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ‘too long

From these it looks like seven brackets are the maximum. Is there
confirmation of this somewhere? Is this the only condition?

:

Can you post what the pattern is?

George Lee wrote:
"The Find What text contains a Pattern Match expression which is too
complex."

What is the rule for being too complex? I can't determine the rule
just
by
playing with it. It's not character limited (other than 255), and it
doesn't
seem to be "item" limited (like no more than ten []{} pairing).

--
Gerry

Message posted via OfficeKB.com
http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1

.

 

[Thiers Halliwell]

I've been asking myself the same question a lot lately. Have you come up with any definitive answers yet? It's just trial and error for me, and would be good to know if there are some general principles to follow.



George Lee wrote:

Thanks. I know these examples were contrived and I have workarounds.
18-Mar-10

Thanks. I know these examples were contrived and I have workarounds. I was
asking more what the conditions of a "too complex" of a pattern were.
Microsoft does not seem to publish those.

:

Previous Posts In This Thread:

Word Search is "too complex" Question
"The Find What text contains a Pattern Match expression which is too complex."

What is the rule for being too complex? I cannot determine the rule just by
playing with it. it is not character limited (other than 255), and it does not
seem to be "item" limited (like no more than ten []{} pairing).

Can you post what the pattern is?
Can you post what the pattern is?

George Lee wrote:

--
Gerry

Message posted via OfficeKB.com
http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1

Simple cases:[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ???
Simple cases:
[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ??? OK
[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ ???OK
[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ???too long

From these it looks like seven brackets are the maximum. Is there
confirmation of this somewhere? Is this the only condition?

:

Instead of constructions such as:[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9]
Instead of constructions such as:

[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ,

Use

[0-9]{#}

where # is the number of digits that you are seeking. or {#,} where you are
seeking at least # digits, {#,##} where you are seeking between # and ##
digits.

--
Hope this helps.

Please reply to the newsgroup unless you wish to avail yourself of my
services on a paid consulting basis.

Doug Robbins - Word MVP, originally posted via msnews.microsoft.com

Thanks. I know these examples were contrived and I have workarounds.
Thanks. I know these examples were contrived and I have workarounds. I was
asking more what the conditions of a "too complex" of a pattern were.
Microsoft does not seem to publish those.

:


Submitted via EggHeadCafe - Software Developer Portal of Choice
Get Silverlight 4 Installed: Tips and Tricks
http://www.eggheadcafe.com/tutorial...b-f54c56a64ed9/get-silverlight-4-install.aspx

 

[Graham Mayor]

See http://www.gmayor.com/replace_using_wildcards.htm

--
<>>< ><<> ><<> <>>< ><<> <>>< <>><<>
Graham Mayor - Word MVP


<>>< ><<> ><<> <>>< ><<> <>>< <>><<>

I've been asking myself the same question a lot lately. Have you come up
with any definitive answers yet? It's just trial and error for me, and
would be good to know if there are some general principles to follow.



George Lee wrote:

Thanks. I know these examples were contrived and I have workarounds.
18-Mar-10

Thanks. I know these examples were contrived and I have workarounds. I was
asking more what the conditions of a "too complex" of a pattern were.
Microsoft does not seem to publish those.

:

Previous Posts In This Thread:

Word Search is "too complex" Question
"The Find What text contains a Pattern Match expression which is too
complex."

What is the rule for being too complex? I cannot determine the rule just
by
playing with it. it is not character limited (other than 255), and it does
not
seem to be "item" limited (like no more than ten []{} pairing).

Can you post what the pattern is?
Can you post what the pattern is?

George Lee wrote:

--
Gerry

Message posted via OfficeKB.com
http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1

Simple cases:[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ???
Simple cases:
[0-9][0-9][0-9][0-9][0-9][0-9][0-9] ??? OK
[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ ???OK
[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ???too long

From these it looks like seven brackets are the maximum. Is there
confirmation of this somewhere? Is this the only condition?

:

Instead of constructions such as:[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9]
Instead of constructions such as:

[0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] ,

Use

[0-9]{#}

where # is the number of digits that you are seeking. or {#,} where you
are
seeking at least # digits, {#,##} where you are seeking between # and ##
digits.

--
Hope this helps.

Please reply to the newsgroup unless you wish to avail yourself of my
services on a paid consulting basis.

Doug Robbins - Word MVP, originally posted via msnews.microsoft.com

Thanks. I know these examples were contrived and I have workarounds.
Thanks. I know these examples were contrived and I have workarounds. I was
asking more what the conditions of a "too complex" of a pattern were.
Microsoft does not seem to publish those.

:


Submitted via EggHeadCafe - Software Developer Portal of Choice
Get Silverlight 4 Installed: Tips and Tricks
http://www.eggheadcafe.com/tutorial...b-f54c56a64ed9/get-silverlight-4-install.aspx