Contents

• Introduction
  • How to Read this Manual
  • Function and Content of the Package
• Getting Started
  • Main User Functions
• FDs, Unification and Linearization
  • What is an FD?
  • A Simple Example of Unification
  • Linearization
• Writing and Modifying Grammars
• Precise Characterization of FDs
  • Generalities: Features, Syntax, Paths and Equations
  • FDs as Graphs
  • Functional Descriptions vs. First-order Terms
  • Disjunctions: The ALT and RALT Keywords
  • Optional Features: the OPT Keyword
  • Control of the Ordering: the PATTERN Keyword
  • Explicit Specification of Sub-constituents: the CSET Keyword
    • Implicit and Incremental CSET Specification
    • Unification of Incremental CSET Specifications
  • The Special Value NONE
  • The Special Value ANY - The Determination Stage
  • The Special Value GIVEN
  • The Special Attribute CAT: General Outline of a Grammar
• Modular Organization of Grammars: Def-alt and Def-conj
  • Modular Definition of FDs
  • Drawing the Map of a Grammar
• Defining Input for Regression Testing: The Test Facility
• Using Lists in FDs
  • Encoding Lists as FDs
  • When to Use Lists: an Example
  • Typical List Traversal in FUF
  • Path Notations for Lists: ~ ^~ and ~n
• Types in Unification
  • Why Types?
    • Typed features
    • Typed Constituents: The FSET Construct
    • Procedural Types
  • Typed Features: define-feature-type
    • Type Definition
    • The under Family of Constructs
    • Drawing Type Hierarchies
  • Typed Constituents: the FSET Construct
  • Procedural Types
• EXTERNAL and Unification Macros
• Morphology and Linearization
  • Lexical Categories are not Unified
  • CATegories Accepted by the Morphology Module
  • Accepted Features for VERB, NOUN, PRONOUN, DET, ORDINAL, CARDINAL and PUNCTUATION
  • Possible Values for Features NUMBER, PERSON, TENSE, ENDING, BEFORE, AFTER, CASE, GENDER, PERSON, DISTANCE, PRONOUN-TYPE, A-AN, DIGIT and VALUE
  • The Dictionary
  • Linearization and Punctuation
• Control in FUF
  • Complexity
  • Indexing
  • Dependency-directed Backtracking and BK-CLASS
  • Lazy Evaluation and Freeze with wait
    • Wait and Constituent Traversal
  • Conditional-Evaluation with Ignore
• Tracing and Debugging
  • What it Means to Debug a FUF Program
  • Checking the Validity of FDs and Grammars
  • Fine Tuning Tracing: Overview of FUF Tracing Functions
  • Identifying Possible Bugs: Trace-bp
  • Levels of Tracing
  • Tracing of Alternatives and Options
  • Local tracing with boundaries
    • Special Flags %trace-on% and %trace-off%
    • The Special Tracing Flag %break%
  • The trace-enable and trace-disable Family of Functions
  • The :demo directive
  • Tracing of Specific Stages of the Unification
    • Trace-determine
    • Trace-Category and Hyper-trace-category
    • Trace-Cset
    • Trace-BK-Class
    • Trace-Wait
    • Trace-Alts
  • Some Advice on FUF Debugging
    • Syntax Errors
    • Semantic Errors
    • Expression of Negative Constraints
    • Control
• Manipulation of FDs as Data-structures
  • FD Accessors
  • FD Relocation
  • FD Normalization
  • Lists of FDs
• Reference Manual
  • Unification functions
    • *lexical-categories*
    • *u-grammar*
    • *cat-attribute*
    • u
    • u-disjunctions
    • uni
    • uni-string
    • uni-fd
    • unif
    • u-exhaust
    • u-exhaust-top
    • uni-num
  • Checking
    • fd-p
    • grammar-p
    • get-error-pair
    • normalize-fd
  • Tracing
    • *all-trace-off*
    • *all-trace-on*
    • *trace-determine*
    • *trace-marker*
    • *top*
    • all-tracing-flags
    • internal-trace-off
    • internal-trace-on
    • trace-disable
    • trace-disable-all
    • trace-disable-match
    • trace-enable
    • trace-enable-all
    • trace-enable-match
    • trace-off
    • trace-on
    • trace-determine
    • trace-bk-class
    • trace-category
  • Complexity
    • avg-complexity
    • complexity
  • Manipulation of the Dictionary
    • *dictionary*
    • lexfetch
    • lexstore
  • Linearization and Morphology
    • call-linearizer
    • gap
    • morphology-help
  • Manipulation of FDs as Data-structures
    • fd-intersection
    • fd-member
    • top-fd-to-list
    • gdp
    • gdpp
    • top-gdp
    • top-gdpp
    • alt-gdp
    • list-to-fd
  • fine tuning of the unifier
    • *any-at-unification*
    • *use-given*
    • *use-any*
    • *keep-cset*
    • *keep-none*
    • *agenda-policy*
  • Finding the Files
  • Porting to a New Machine
  • Packages
  • Advanced Uses of Patterns
  • Advanced uses of CSET
  • Long Distance Dependencies and the GAP feature
  • Specifying Complex Constraints: the TEST and CONTROL Keywords
  • Copying vs Conflation: The #{} notation
  • Dealing with Lists: The Member/Append Example
  • Representing Lists as FDs
    • NIL and variables
    • The `~' notation
  • Environment and Variable Names vs. FD and Path
  • Procedures vs. Categories, Arguments vs. Constituents
  • The total FD Includes the Stack of all Computation
  • Analogy with PROLOG programs
  • Use of Set Values in Linguistic Applications
  • Typed Features
  • The FSET Special Attribute and Typed Constituents
  • User-defined Types
  • Limits on Disjunction in Input
  • Mergeable Constituents in Patterns
  • Indexing of Alternation
  • Test and Control
  • GIVEN and UNDER
  • EXTERNAL Specifications and Macros
  • User-defined CAT Parameter
  • Resource Limited Processing
  • BK-CLASS Control Specification
  • WAIT Control Specification
  • IGNORE Control Specifications
  • New Features and Modifications in Version 3
  • New Features and Modification in Version 4
  • New Features and Modification in Version 5
• Contents
• List of Figures
• List of Tables