Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Line: 103 to 103  
Function Supporting Substring Variables  
Changed:  
< <  These functions are implemented in a latter stage. These are currently moved to HfstAPIGeneralizedRestrictionLayer2 in order to prioritize the work.  
> >  These functions are implemented in a latter stage. These are currently moved to HfstAPIGeneralizedRestrictionLayer2OLD in order to prioritize the work.  
References  
Line: 139 to 139  
>  AnssiYliJyra  06 Oct 2008  
Changed:  
< < 
 
> > 

Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Line: 94 to 94  
 
Changed:  
< < 
 
> > 
 
 
Changed:  
< < 
 
> > 
 
Function Supporting Substring Variables 
Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Line: 17 to 17  
Basic Notions
Auxiliary Marker Symbols  
Changed:  
< < 
 
> > 
Overt FSTs keep track of the set of the known auxiliary markers (or their keys).
All auxiliary symbol are neither used to mark things in similar ways and they are not used to mark similar things.
The total set of possible pairs have to be defined somehow when a complement of an overt FST is computed.
 
Nondeterministic Letter TransducersOften letter transducers are kept as deterministic and minimal. However, in the case of overt FSTs, we may want to avoid determinization of intermediate results.  
Changed:  
< <  Operations, Functions and Related Layers
 
> >  Overview of this Layer  
Changed:  
< <  Data Types  
> >  Excepting the harmonization and carrying the auxiliary symbol alphabet, most of the functionalities of this layer is based on normal FST operations provided by the TransducerLayer. Accordingly, the large number of operations in the current layer does not imply much programming.  
 
Line: 42 to 59  
 
Changed:  
< <  Function PrimitivesDefinition of Substring Variables and other Diamond Symbols  
> >  The current layer contains a few sets of functions:
Functions Supporting Joiner Variables
Creating New Joiner Variables  
 
Changed:  
< < 
 
> > 
 
 
Changed:  
< <  Functions That Relate Substring Variables to VariableFree Conditions
Functions That Compare or Rename Substring Variables  
> >  Functions That Relate Joiner Variables to FSTs  
 
Changed:  
< < 
 
> > 
 
Functions That Implement Logical Connectors and Quantifiers
 
Changed:  
< < 
 
> > 
 
Changed:  
< <  Functions That Construct, Combine and Compile GR Rules  
> >  Function Supporting Substring Variables  
Changed:  
< < 
Derived Functions
Functions That Compile Constraints using GR Rules
In the following,
GRBased Engines for Grammar SystemsThe GR Calculus makes is easy to define some complete rule systems with rule application modes and conflict resolutions. The interfaces to the following systems will be added here:
 
> >  These functions are implemented in a latter stage. These are currently moved to HfstAPIGeneralizedRestrictionLayer2 in order to prioritize the work.  
References 
Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Added:  
> >  IntroductionPurpose of the layer  
This extension to the basic HFST API provides support for new letterFST operations that are useful for compilation of
 
Changed:  
< <  
> >  Prior references  
The current definitions are based on the convergence of two streams of work:
 
Changed:  
< <  The basic and common notion in both streams is the notion of an auxiliary symbol that is used to indicate a boundary of a substring. This symbol has two names: a diamond ◊ and variable symbol () . More such symbols can be numbered or named according to letters using different notational conventions: ◊_{1}, ◊_{2},..., <x>, <y>, ... (x), (y),..., x, y, ... . These auxiliary symbols occur in strings of markeraugmented FSTs that we call below over FSTs (implemented through OvertFstHandle ). The data type of an uncompiled generalized restriction is OvertFstPair .  
> >  Basic Notions
Auxiliary Marker Symbols
Nondeterministic Letter TransducersOften letter transducers are kept as deterministic and minimal. However, in the case of overt FSTs, we may want to avoid determinization of intermediate results.
Operations, Functions and Related Layers
 
Data Types  
Line: 24 to 42  
 
Changed:  
< <  Definition of Substring Variables and other Diamond Symbols  
> >  Function PrimitivesDefinition of Substring Variables and other Diamond Symbols  
 
Line: 36 to 55  
 
Changed:  
< <  Functions That Relate Substring Variables to VariableFree Conditions  
> >  Functions That Relate Substring Variables to VariableFree Conditions  
 
Line: 48 to 67  
 
Changed:  
< <  Functions That Compare or Rename Substring Variables  
> >  Functions That Compare or Rename Substring Variables  
 
Line: 64 to 83  
 
Changed:  
< <  Functions That Implement Logical Connectors and Quantifiers  
> >  Functions That Implement Logical Connectors and Quantifiers  
 
Changed:  
< < 
 
> > 
 
 
Changed:  
< <  Functions That Construct, Combine and Compile GR Rules  
> >  Functions That Construct, Combine and Compile GR Rules  
 
Line: 87 to 107  
 
Changed:  
< <  Functions That Compile Constraints using GR Rules  
> >  Derived Functions
Functions That Compile Constraints using GR Rules  
In the following, c is an overt FST for contexts.  
Line: 110 to 132  
 
Changed:  
< <  GRBased Engines for Grammar Systems  
> >  GRBased Engines for Grammar Systems  
The GR Calculus makes is easy to define some complete rule systems with rule application modes and conflict resolutions. The interfaces to the following systems will be added here:

Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Line: 12 to 12  
 
Changed:  
< <  The basic and common notion in both streams is the notion of an auxiliary symbol that is used to indicate a boundary of a substring. This symbol has two names: a diamond ◊ and variable symbol () . More such symbols can be numbered or named according to letters using different notational conventions: ◊_{1}, ◊_{2},..., <x>, <y>, ... (x), (y),..., x, y, ... . These auxiliary symbols occur in strings of FSTs that are referred by LamdaFstHandles.  
> >  The basic and common notion in both streams is the notion of an auxiliary symbol that is used to indicate a boundary of a substring. This symbol has two names: a diamond ◊ and variable symbol () . More such symbols can be numbered or named according to letters using different notational conventions: ◊_{1}, ◊_{2},..., <x>, <y>, ... (x), (y),..., x, y, ... . These auxiliary symbols occur in strings of markeraugmented FSTs that we call below over FSTs (implemented through OvertFstHandle ). The data type of an uncompiled generalized restriction is OvertFstPair .  
Data Types  
Line: 20 to 20  
 
Changed:  
< < 
 
> > 
 
Definition of Substring Variables and other Diamond Symbols  
Line: 40 to 40  
 
Changed:  
< < 
 
> > 
 
(this table is subject to minor changes)
Functions That Compare or Rename Substring Variables
 
Changed:  
< < 
 
> > 
 
Functions That Implement Logical Connectors and Quantifiers
 
Changed:  
< < 
 
> > 
 
Functions That Construct, Combine and Compile GR Rules
 
Changed:  
< < 
 
> > 
 
Functions That Compile Constraints using GR Rules  
Changed:  
< <  In the following, c is a lambda FST for contexts.  
> >  In the following, c is an overt FST for contexts.  
 
Changed:  
< < 
 
> > 
 
GRBased Engines for Grammar Systems 
Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Line: 12 to 12  
 
Changed:  
< <  The basic and common notion in both streams is the notion of an auxiliary symbol that is used to indicate a boundary of a substring. This symbol has two names: a diamond ◊ and variable symbol () . More such symbols can be numbered or named according to letters using different notational conventions: ◊_{1}, ◊_{2},..., <x>, <y>, ... (x), (y),..., x, y, ... . These auxiliary symbols occur in strings of FSTs that are referred by LamdaExpHandles.  
> >  The basic and common notion in both streams is the notion of an auxiliary symbol that is used to indicate a boundary of a substring. This symbol has two names: a diamond ◊ and variable symbol () . More such symbols can be numbered or named according to letters using different notational conventions: ◊_{1}, ◊_{2},..., <x>, <y>, ... (x), (y),..., x, y, ... . These auxiliary symbols occur in strings of FSTs that are referred by LamdaFstHandles.  
Data Types 
Line: 1 to 1  

HFST: API for Generalized Restriction (GR) and Predicate Logic in FST Calculus  
Line: 10 to 10  
The current definitions are based on the convergence of two streams of work:
 
Changed:  
< <  The more general background goes to the work of Buchi (1960), Elgot (1961), etc. See Section References below.  
> >  The more general discussion on FST related arithmetics goes back to the work of Buchi (1960), Elgot (1961), etc. See Section References below.  
The basic and common notion in both streams is the notion of an auxiliary symbol that is used to indicate a boundary of a substring. This symbol has two names: a diamond ◊ and variable symbol () . More such symbols can be numbered or named according to letters using different notational conventions: ◊_{1}, ◊_{2},..., <x>, <y>, ... (x), (y),..., x, y, ... . These auxiliary symbols occur in strings of FSTs that are referred by LamdaExpHandles.  
Line: 42 to 42  
 
Changed:  
< < 
 
> > 
 
 
Added:  
> >  (this table is subject to minor changes)  
Functions That Compare or Rename Substring Variables  
Line: 99 to 101  
 
Changed:  
< < 
 
> > 
 
 
Changed:  
< < 
 
> > 
 
 
Changed:  
< <  References  
> >  GRBased Engines for Grammar SystemsThe GR Calculus makes is easy to define some complete rule systems with rule application modes and conflict resolutions. The interfaces to the following systems will be added here:
 
Changed:  
< <  (to be added)  
> >  References  
Added:  
> > 
 
Revision 320081006  AnssiYliJyra
Revision 220081006  AnssiYliJyra
Revision 120081006  AnssiYliJyra
View topic  History: r11 < r10 < r9 < r8  More topic actions... Copyright © 20082019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors. Ideas, requests, problems regarding TWiki? Send feedback 