PHP: Text Spinner Class - Nested spinning supported.

spintax.php

<?PHP
/**
 * Spintax - A helper class to process Spintax strings.
 * @name Spintax
 * @author Jason Davis - https://www.codedevelopr.com/
 * Tutorial: https://www.codedevelopr.com/articles/php-spintax-class/
 */
class Spintax
{
    public function process($text)
    {
        return preg_replace_callback(
            '/\{(((?>[^\{\}]+)|(?R))*)\}/x',
            array($this, 'replace'),
            $text
        );
    }

    public function replace($text)
    {
        $text = $this->process($text[1]);
        $parts = explode('|', $text);
        return $parts[array_rand($parts)];
    }
}


/* EXAMPLE USAGE */
$spintax = new Spintax();
$string = '{Hello|Howdy|Hola} to you, {Mr.|Mrs.|Ms.} {Smith|Williams|Davis}!';
echo $spintax->process($string);

/* NESTED SPINNING EXAMPLE */
echo $spintax->process('{Hello|Howdy|Hola} to you, {Mr.|Mrs.|Ms.} {{Jason|Malina|Sara}|Williams|Davis}');

it's pretty cool .. many thanks

it's pretty cool .. many thanks

Interesting, thank you

Interesting, thank you

Nice short code! Can you help explain the regex pattern: /{(((?>[^{}]+)|(?R))*)}/x
I'm trying to rewrite in Powershell/.NET. Especially, what is the ?R

Nice short code! Can you help explain the regex pattern: /{(((?>[^{}]+)|(?R))*)}/x
I'm trying to rewrite in Powershell/.NET. Especially, what is the ?R

@NealWalters here you go:

/
  \{                    # opening curly ({) bracket
  (                     # group $1
    (                   # group $2
      (?>               # group $3
                        # Atomic group - Matches the longest possible substring in the group and doesn't allow later backtracking to reevaluate the group.
        [^\{\}]+        # one or more characters which are not "{" or "}"
      )
      |                 # or
      (?R)              # recursive match on the pattern itself - next nesting level of {}
    )*                  # zero or more times
  )
  \}                    # ended with curly (}) bracket
/x                      # PCRE_EXTENDED - whitespaces are ignored, # means comments

@NealWalters here you go:

/
  \{                    # opening curly ({) bracket
  (                     # group $1
    (                   # group $2
      (?>               # group $3
                        # Atomic group - Matches the longest possible substring in the group and doesn't allow later backtracking to reevaluate the group.
        [^\{\}]+        # one or more characters which are not "{" or "}"
      )
      |                 # or
      (?R)              # recursive match on the pattern itself - next nesting level of {}
    )*                  # zero or more times
  )
  \}                    # ended with curly (}) bracket
/x                      # PCRE_EXTENDED - whitespaces are ignored, # means comments

thank you, anyway is it possible for making this spin work if only for first opening file and not working after it has been refresh ?

thank you, anyway is it possible for making this spin work if only for first opening file and not working after it has been refresh ?

Perfectly working. Thank you so much for the explanation about the regexp.
Regexp are really cool, but not so easy to understand/explain, also has a really HUGE syntax :)

Perfectly working. Thank you so much for the explanation about the regexp.
Regexp are really cool, but not so easy to understand/explain, also has a really HUGE syntax :)

Simple but powerful :)

Thanks

Simple but powerful :)

Thanks

[ask] it is possible to spin the title also ?

[ask] it is possible to spin the title also ?

If you want to use the [square|brackets|syntax] use this line in the process function:

'/\[(((?>[^\[\]]+)|(?R))*)\]/x',

thanks @lury

If you want to use the [square|brackets|syntax] use this line in the process function:

'/\[(((?>[^\[\]]+)|(?R))*)\]/x',

thanks @lury

Thank for very helpful code.
How can I use PHP to find match text in data then replace
example my content:
$content = 'The speedy black wolf bounded over the lazy hound';
$patten = array('{the|a|}',{black|red|yellow}....);

Expect result after replace : $content = '{the|a|} speedy {black|red|yellow} wolf bounded over the lazy hound';
they will find 1 of some word in {} and if 1 of some word by | match, they will replace to the content.

Thank for very helpful code.
How can I use PHP to find match text in data then replace
example my content:
$content = 'The speedy black wolf bounded over the lazy hound';
$patten = array('{the|a|}',{black|red|yellow}....);

Expect result after replace : $content = '{the|a|} speedy {black|red|yellow} wolf bounded over the lazy hound';
they will find 1 of some word in {} and if 1 of some word by | match, they will replace to the content.

thank you for this

thank you for this

Is there way to ignore spin for "first capital alphabet word" (e,g. names, country, etc.)?

Is there way to ignore spin for "first capital alphabet word" (e,g. names, country, etc.)?

hi
i love this scripts. is any ideas on how can it be implement with mysql data? like storing the synonyms in a database

more power

hi
i love this scripts. is any ideas on how can it be implement with mysql data? like storing the synonyms in a database

more power

hi, if i want to calculate maximum number of my spintax combination can generate unique article how to do that?

hi, if i want to calculate maximum number of my spintax combination can generate unique article how to do that?

Is there a way I could show all the possible variations?

Is there a way I could show all the possible variations?

The problem with this kind of spinners is that spuns do not have the same probability to be chosen.
For example, something like '{A|{B|C|D|E|F}}' will have 50% of 'A'.
I've coded another one with Python where every possible spuns have the same probability to be chosen, also you can retrieve the number of every possible spuns that can be generated from a spintax string.
You can have a look here : https://gist.github.com/fbparis/738c52e253639edb3cb41f90ea0b490c

The problem with this kind of spinners is that spuns do not have the same probability to be chosen.
For example, something like '{A|{B|C|D|E|F}}' will have 50% of 'A'.
I've coded another one with Python where every possible spuns have the same probability to be chosen, also you can retrieve the number of every possible spuns that can be generated from a spintax string.
You can have a look here : https://gist.github.com/fbparis/738c52e253639edb3cb41f90ea0b490c

Very interesting. Pretty cool. As it is very slim in size and heavy in working.

Very interesting. Pretty cool. As it is very slim in size and heavy in working.