Spoonerism Maker
CallerphonologicallysegmentedonsetexchangeSpoonerism,not inferphonemeonsetsfrom spelling. Offline bounded explicit text/rule convention,not natural-language validity,personaltrait inference or security.
Description
A spoonerism exchanges the starting sounds of two words.
A spoonerism exchanges the starting sounds of two words.1
This implementation requires you to supply the onset and rime segments because spelling alone does not determine phonological segmentation.
When to use Spoonerism Maker
Use this tool to apply the stated spoonerism maker operation with an explicit input and unit basis.
How to use Spoonerism Maker and how it works
- Establish the text or game convention described above.
- Enter actualFirstOnset, actualFirstRime, actualSecondOnset, actualSecondRime and run the tool.
- Read result.spoonerizedWords using the output meanings below.
- If input is rejected, correct the stated type, range, ordering or alignment issue and rerun; review successful results under the declared convention.
| Input field | Meaning | Value type | Requirement |
|---|---|---|---|
| actualFirstOnset | First onset, on the basis specified in the algorithm. | string | required; further conditions in the algorithm |
| actualFirstRime | First rime, on the basis specified in the algorithm. | string | required; further conditions in the algorithm |
| actualSecondOnset | Second onset, on the basis specified in the algorithm. | string | required; further conditions in the algorithm |
| actualSecondRime | Second rime, on the basis specified in the algorithm. | string | required; further conditions in the algorithm |
Require four nonblank strings. Combine the second onset with the first rime and the first onset with the second rime; return both constructed words.
words = [onset₂+rime₁, onset₁+rime₂] Apply the declared units, ordering and branch conditions.
| Output field | Meaning | Value type |
|---|---|---|
| result | Object containing the declared output fields. | object |
| result.spoonerizedWords | Two onset-exchanged constructions in original word order. | array |
{
"input": {
"actualFirstOnset": "b",
"actualFirstRime": "old",
"actualSecondOnset": "c",
"actualSecondRime": "at"
},
"output": {
"result": {
"spoonerizedWords": [
"cold",
"bat"
]
}
}
} Limitations and assumptions
The output applies the declared operation to the values you supply. Establish the measurement basis, units, coefficients and any caller-selected rules before interpreting it. The tool does not independently collect or verify observations or decide whether a model or reference applies.
Supply explicit required fields with the documented types and dense aligned arrays. Unknown fields, wrong types and nonfinite numbers are rejected. Branch-specific constraints are explained above. A successful false boolean, negative signed difference, empty slice or unresolved tie is distinct from an input error. Very large inputs or outputs may be rejected by shared resource limits.
Alternative or Complementary methods
For a related operation, use Ubbi Dubbi Converter. Ubbi Dubbi is a playful word transformation with multiple possible spoken conventions.
For a related operation, use Pig Latin Converter. Pig Latin can be implemented under a declared written-vowel convention.
References
-
Spoonerism Maker — tool.io
Similar or alternative tools
- Ubbi Dubbi Converter
Ubbi Dubbi is a playful word transformation with multiple possible spoken conventions.
- Pig Latin Converter
Pig Latin can be implemented under a declared written-vowel convention.