It is not quite clear to me which kind of assistance you want/need.
Could you perhaps develop the question further?
As to your notation, if "A,B,..X" is your list, a conventional way of
expressing your patterns would be
A|B|..|X for oneof (the "or-bar"
A? for rep01 (0 or one A)
A* for rep0n
A+ for rep1n
A very good introduction to regular expressions is written by Lauri
Karttunen.
Have a look at
http://www.xrce.xerox.com/research/mltt/fst/
Cheers,
Ole
On Fri, 02 Apr 1999 13:32:31 -0500, Ken Litkowski wrote:
>I am using regular expressions to recognize defining patterns in
>annotated parse trees and I would like to be clear in characterizing
>it. I am using the notation "oneof" (select from a list), rep01 (0 or 1
>time), rep0n (0 to n times), and rep1n (1 to n times), and can include
>literals, parts of speech, annotations on the parse tree, and
>selectional restriction specifications in writing a defining pattern. I
>will start from the lowest level and ask the question whether each is
>still just a regular expression:
>
>1. Combination of literals:
> "a manner"
>2. Addition of parts of speech:
> "det rep0n(adj) manner"
>3. Addition of annotations:
> "adj(pres-p) noun" (pres-p == present participle)
>4. Addition of selectional restrictions:
> "det rep0n(adj) noun(+state)" (a noun defined as a state)
>
>Thanks for any assistance.
>
> Ken
>--
>Ken Litkowski TEL.: 301-482-0237
>CL Research EMAIL: ken@clres.com
>9208 Gue Road
>Damascus, MD 20872-1025 USA Home Page: http://www.clres.com
>
>
==============================
Ole Norling-Christensen, M.Sc.
Reykjaviksgade 5, 4.th.
DK-2300 København S, Danmark
e-mail Norling@ddf.dk
Tel. (+45) 3254 6915
Fax: (+45) 3254 6916
==============================