Word.ws English Dictionary

Schensted algorithm

Schensted algorithm proper noun: the simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.

Proper noun

Schensted algorithm

  1. The simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.

Questions about Schensted algorithm

What does Schensted algorithm mean?
Schensted algorithm means the simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.
What part of speech is Schensted algorithm?
Schensted algorithm is a proper noun.

Words near Schensted algorithm in the dictionary

  1. Schenkerian
  2. Schenkerians
  3. Schenkers
  4. Schenks
  5. Schensted
  6. Schensted algorithm
  7. Schensted insertion
  8. Schensted insertions
  9. schepel
  10. schepels
  11. schepen

Source and license

Adapted from Wiktionary: Schensted algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Schensted algorithm.” Word.ws, https://word.ws/schensted_algorithm. Based on Wiktionary, CC BY-SA 4.0.