Sort Words

Sort Words lets you sort Unicode word tokens using English collation. Enter your own values or load the worked example.

Method and calculation

Sort Unicode word tokens using English collation.

Inputs and settings

Sort Words accepts Input text.

Worked example

Sort Words example — Input text: "Hello world\nA second line\nHello world". Computed output: A Hello Hello line second world world

Output and limitations

Alphabetical ordering is useful for reviewing a glossary before publication. English collation determines where accented forms appear. Duplicate words remain present, making this different from vocabulary deduplication; use Unique Words first when a set rather than a sorted list is needed.

Technical references: JavaScript Unicode normalization

Sort Words FAQs

Sort Words applies the following rule to your input: Sort Unicode word tokens using English collation. The worked example on this page uses the same processor as the result button.
Sort Words has these boundaries: Input is treated as plain text; it is never executed. Start by checking the input text field against the units or format shown.
Sort Words provides this sample: A Hello Hello line second world world. Use the sample button to reproduce it, then replace the inputs with your own values.