Phonex Constructs

A summary of all possible phonex constructs.

Table 1. Phone matchers
Construct Matches
x The phone x. Matches regardless of diacritics.
x_y The compound phone consisting of phones matched by x and y.
\unnnn The phone with unicode value nnnn as a hexadecimal number.
\* The * cover symbol.
\. The . syllable boundary marker.
\+ The + compound word marker.
\^ The ^ intra-word pause maker.
's' The phone with text that matches the regular expression s
{f0, f1..., fn} The phone with features f0 ... fn
Table 2. Grouping
Construct Matches
(X) X, as a capturing group
(X|Y) X or Y, as a capturing group
(?=X) X, as a non-capturing group
(name=X) X, as a named, capturing group. name may consist of letters and numbers, but must start with a letter.
\n The content matched by group n
(?<X) Look behind and match X as a non-capturing group
(?>X) Look ahead and match X as a non-capturing group
Table 3. Phone classes
Construct Matches
[xyz] x, y, or z
[^xyz] Not x, y, or z
Table 4. Predefined phone classes
Construct Matches
. Anything
\c Any consonant
\g Any glide
\v Any vowel
\p Any intra-word pause (i.e., ^)
\P Any inter-word pause (e.g., (.), (..), …)
\w Any consonant or vowel.
\W Any non-word character (i.e., any character not matched by \w, e.g., same as [^\w])
\s Any stress marker
Table 5. Boundary matchers
Construct Matches
^ Beginning of input
$ End of input
\b A word boundary including beginning of input, end of input, and whitespace.
\S A syllable boundary including 'forced' syllable boundaries such as beginning of input, end of input, and whitespace; and, if syllable constituent types are available, 'soft' syllable boundaries detected at syllable edges.
Table 6. Plug-ins
Construct Matches
x:plugin('s') x if, and only if, the plug-in matcher identified by plugin matches with expression s
x&y x if, and only if, a diacritic attached to x matches the expression y. (e.g., h&{aspirated}will match all 'h's with aspirated diacritics.)
xː Same as x&{long}.
x!s x if, and only if, the syllable stress of the phone matches s.
Table 7. Quantifiers (greedy)
Construct Matches
X? X, once or not at all
X* X, zero or more times
X+ X, one or more times
X<n> X, exactly n times
X<n,> X, at least n times
X<,n> X, zero to n times
X<n,m> X, at least n but not more than m times
Table 8. Quantifiers (reluctant)
Construct Matches
X?? X, once or not at all
X*? X, zero or more times
X+? X, one or more times
X<n>? X, exactly n times
X<n,>? X, at least n times
X<,n>? X, zero to n times
X<n,m>? X, at least n but not more than m times
Table 9. Quantifiers (possessive)
Construct Matches
X?+ X, once or not at all
X*+ X, zero or more times
X++ X, one or more times
X<n>+ X, exactly n times
X<n,>+ X, at least n times
X<,n>+ X, zero to n times
X<n,m>+ X, at least n but not more than m times