Navigation: Reverse Home Try Analyzer Reverse Flowchart Stem Tester Documentation Home

ACE — Reverse Analyzer (Concept & Stub)

This page describes the reverse analyzer idea: starting from a full surface form (Arabic or Latin), we try to reason backwards to discover:

Try a Sample Word (Future Implementation)
Relation to the Forward Flowchart

The Reverse Analyzer essentially walks the forward flowchart backwards:

  1. Start from a full surface form (Arabic or Latin).
  2. Peel off attached pronouns based on known endings.
  3. Peel off verbal / nominal suffixes and identify candidate tense/pronoun.
  4. Try to match remaining string to a known stem pattern produced by build_combined_token().
  5. Infer root letters and Form (I–X) from the matched pattern.
  6. Try to detect conjunctions and particles (24–44) at the beginning.
  7. Summarize: root, form, tense, pronoun, particles, article, attached pronoun.

Once we are satisfied with the forward engine, we can implement this reverse logic by reusing the same pattern library and suffix tables used in the Stem Tester.