/usr/include/hfst/HfstXeroxRules.h is in libhfst42-dev 3.9.0~r4595-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 | // This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, version 3 of the License.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//#include "HfstDataTypes.h"
//#include "HfstSymbolDefs.h"
#include "HfstTransducer.h"
/** @file HfstXeroxRules.h
\brief Declarations of HFST-XFST replace functions and data types. */
namespace hfst
{
/** \brief A namespace for HFST xeroxRules functions and data types. */
namespace xeroxRules
{
enum ReplaceType {REPL_UP, REPL_DOWN, REPL_RIGHT, REPL_LEFT};
// this enum is used in xre_parse.yy for the regex2pfst tool
// it is not in the xre_parse.yy file because we couldn't make it work there
enum ReplaceArrow { E_REPLACE_RIGHT,
E_OPTIONAL_REPLACE_RIGHT,
E_REPLACE_LEFT,
E_OPTIONAL_REPLACE_LEFT,
E_REPLACE_RIGHT_MARKUP,
E_RTL_LONGEST_MATCH,
E_RTL_SHORTEST_MATCH,
E_LTR_LONGEST_MATCH,
E_LTR_SHORTEST_MATCH
};
/**
* \brief A rule that contains mapping and context and replace type (if any).
* If rule is A -> B || L _ R , than mapping is cross product of transducers A and B,
* context is pair of transducers L and R, and replType is enum REPL_UP.
*/
class Rule
{
/* cross product of mapping transducers */
HfstTransducerPairVector mapping;
/* context */
HfstTransducerPairVector context;
/* if there is a context, it needs to have a direction (up, left, down or right) */
ReplaceType replType;
public:
Rule ( const HfstTransducerPairVector& );
Rule ( const HfstTransducerPairVector&, const HfstTransducerPairVector&, ReplaceType );
//copy
Rule ( const Rule& );
HfstTransducerPairVector get_mapping() const;
HfstTransducerPairVector get_context() const;
ReplaceType get_replType() const;
void encodeFlags();
friend std::ostream& operator<<(std::ostream &out, const Rule &r);
};
/**
* \brief In the transducer \tr, change all flag diacritics to "non-special" multichar symbols
* It means that @ sign will be changed to $ sign
* ie. @P.FOO.BAR@ will be changed into $P.FOO.BAR$
* */
HfstTransducer encodeFlagDiacritics( const HfstTransducer &tr );
/**
* \brief In the transducer \tr, change back all "non-special" flag diacritics to normal,
* functional flag diacritics
* It means that $ sign will be changed to @ sign
* ie. $P.FOO.BAR$ will be changed into @P.FOO.BAR@
* */
HfstTransducer decodeFlagDiacritics( const HfstTransducer &tr );
// Disjunct all transducers from TransducerVector
HfstTransducer disjunctVectorMembers( const HfstTransducerVector &trVector );
/**
* \brief Remove makers used in replace functions from a \a tr.
* Additionally, decode flag diacritics.
* */
HfstTransducer removeMarkers( const HfstTransducer &tr );
//Used in changing weights to zero (in constraintComposition function)
float zero_weight(float f);
/** \brief Generalized Lenient Composition (by Anssi Yli-Jyr�) of a \a t and a \a Constraint.
* More about this composition can be found in:
* http://www.ling.helsinki.fi/users/aylijyra/all/YliJyra-2008b:trafropar:inp.pdf
*/
HfstTransducer constraintComposition( const HfstTransducer &t, const HfstTransducer &Constraint );
/** \brief If \a optional is false, the function freely inserts in \a t @_LM_@ and @_RM_@.
* If it is true, it also inserts @_LM2_@ and @_RM2_@
*/
void insertFreelyAllTheBrackets( HfstTransducer &t, bool optional );
/** \brief It is used in bracketedReplace, when the replace expression has context.
* Cr' = (Rc .*) << Markers (<,>,|) .o. [I:I | <a:b>]*
* Cr = Cr | Cr'
* (same for left context, (.* Cl))
*/
HfstTransducer expandContextsWithMapping (const HfstTransducerPairVector &ContextVector,
const HfstTransducer &mappingWithBracketsAndTmpBoundary,
const HfstTransducer &identityExpanded,
ReplaceType replType,
bool optional);
/** \brief
* Unconditional replace, in multiple contexts
* first: (.* T<a:b>T .*) - [( .* L1 T<a:b>T R1 .*) u (.* L2 T<a:b>T R2 .*)...],
* where .* = [I:I (+ {tmpMarker (T), <,>} in alphabet) | <a:b>]*
* then: remove tmpMarker from transducer and alphabet, and do negation:
* .* - result from upper operations
*
* Also note that context is expanded in this way:
* Cr' = (Rc .*) << Markers (<,>,|) .o. [I:I | <a:b>]*
* Cr = Cr | Cr'
* (same for left context, (.* Cl))
*/
HfstTransducer bracketedReplace( const Rule &rule, bool optional);
/** \brief Bracketed replace for parallel rules */
HfstTransducer parallelBracketedReplace( const std::vector<Rule> &ruleVector, bool optional);
//---------------------------------
// CONSTRAINTS
//---------------------------------
// (help function)
// returns: [ B:0 | 0:B | ?-B ]*
// which is used in some constraints
HfstTransducer constraintsRightPart( ImplementationType type );
// .#. ?* <:0 0:> ?* .#.
// filters out empty string
HfstTransducer oneBetterthanNoneConstraint( const HfstTransducer &uncondidtionalTr );
// ?* <:0 [B:0]* [I-B] [ B:0 | 0:B | ?-B ]*
HfstTransducer leftMostConstraint( const HfstTransducer &uncondidtionalTr );
// [ B:0 | 0:B | ?-B ]* [I-B]+ >:0 [ ?-B ]*
HfstTransducer rightMostConstraint( const HfstTransducer &uncondidtionalTr );
// Longest match
// it should be composed to left most transducer........
// ?* < [?-B]+ 0:> [ ? | 0:< | <:0 | 0:> | B ] [ B:0 | 0:B | ?-B ]*
HfstTransducer longestMatchLeftMostConstraint( const HfstTransducer &uncondidtionalTr );
// Longest match RIGHT most
HfstTransducer longestMatchRightMostConstraint(const HfstTransducer &uncondidtionalTr );
// Shortest match
// it should be composed to left most transducer........
// ?* < [?-B]+ >:0
// [?-B] or [ ? | 0:< | <:0 | >:0 | B ][?-B]+
// [ B:0 | 0:B | ?-B ]*
HfstTransducer shortestMatchLeftMostConstraint( const HfstTransducer &uncondidtionalTr );
// Shortest match
// it should be composed to left most transducer........
//[ B:0 | 0:B | ?-B ]*
// [?-B] or [?-B]+ [ ? | 0:> | >:0 | <:0 | B ]
// <:0 [?-B]+ > ?*
HfstTransducer shortestMatchRightMostConstraint( const HfstTransducer &uncondidtionalTr );
// ?* [ BL:0 (?-B)+ BR:0 ?* ]+
HfstTransducer mostBracketsPlusConstraint( const HfstTransducer &uncondidtionalTr );
// ?* [ BL:0 (?-B)* BR:0 ?* ]+
HfstTransducer mostBracketsStarConstraint( const HfstTransducer &uncondidtionalTr );
// ?* B2 ?*
HfstTransducer removeB2Constraint( const HfstTransducer &t );
// to avoid repetition in empty replace rule
HfstTransducer noRepetitionConstraint( const HfstTransducer &t );
/** \brief
* It applies boundary marker from contexts (.#.) to \a t
*
* [0:.#. | ? - .#.]*
* .o.
* tr., ie. a -> b || .#. _ ;
* .o.
* .#. (? - .#.)* .#.
* .o.
* [.#.:0 | ? - .#.]*
*/
HfstTransducer applyBoundaryMark( const HfstTransducer &t );
//---------------------------------
// INTERFACE HELPING FUNCTIONS
//---------------------------------
//used by hfst-regexp parser
HfstTransducerPair create_mapping_for_mark_up_replace( const HfstTransducerPair &mappingPair,
const HfstTransducerPair &marks );
// HfstTransducerPairVector create_mapping_for_mark_up_replace( const HfstTransducerPairVector &mappingPairVector,
// const StringPair &marks );
// HfstTransducerPairVector create_mapping_for_mark_up_replace( const HfstTransducerPairVector &mappingPairVector,
// const HfstTransducerPair &marks );
//---------------------------------
// REPLACE FUNCTIONS - INTERFACE
//---------------------------------
// replace up, left, right, down
HfstTransducer replace( const Rule &rule, bool optional);
// for parallel rules
HfstTransducer replace( const std::vector<Rule> &ruleVector, bool optional);
// replace up, left, right, down
HfstTransducer replace_left( const Rule &rule, bool optional);
// for parallel rules
HfstTransducer replace_left( const std::vector<Rule> &ruleVector, bool optional);
// left to right
HfstTransducer replace_leftmost_longest_match( const Rule &rule );
// left to right
HfstTransducer replace_leftmost_longest_match( const std::vector<Rule> &ruleVector );
// right to left
HfstTransducer replace_rightmost_longest_match( const Rule &rule );
// right to left
HfstTransducer replace_rightmost_longest_match( const std::vector<Rule> &ruleVector );
HfstTransducer replace_leftmost_shortest_match( const Rule &rule);
HfstTransducer replace_leftmost_shortest_match(const std::vector<Rule> &ruleVector );
HfstTransducer replace_rightmost_shortest_match( const Rule &rule );
HfstTransducer replace_rightmost_shortest_match( const std::vector<Rule> &ruleVector );
// the problem is that the mark-up rules can be mixed with ordinary rules
// ie a -> b ... c , a -> d ;
// this is why each markup mapping should be accessed seperratly
// HfstTransducer mark_up_replace( const Rule &rule,
// const StringPair &marks,
// bool optional);
// HfstTransducer mark_up_replace(const Rule &rule,
// const HfstTransducerPair &marks,
// bool optional);
// HfstTransducer mark_up_replace( const std::vector<MarkUpRule> &markUpRuleVector,
// bool optional);
// replace up, left, right, down
HfstTransducer replace_epenthesis( const Rule &rule, bool optional);
// replace up, left, right, down
HfstTransducer replace_epenthesis( const std::vector<Rule> &ruleVector, bool optional);
//---------------------------------
// RESTRICTION FUNCTIONS
//---------------------------------
// create marks for given i
//static StringPair restrictionMarks( int i);
/*
* define AA1a [ [. 0 .] -> LEFT_MARK || _ center ];
* define AA1b [ [. 0 .] -> RIGHT_MARK || center _ ];
* retval = AA1 .o. AA2
*/
//static HfstTransducer surroundCenterWithBrackets( const HfstTransducer ¢er,
// const HfstTransducer &leftMark,
// const HfstTransducer &rightMark);
// Contexts
// define NOS1 [ %[ -> 0 || b / B _ ];
// define NOF1 [ %] -> 0 || _ c / B ];
static HfstTransducer removeBracketsInContext( const HfstTransducerPairVector &context,
const HfstTransducer &leftMark,
const HfstTransducer &rightMark,
int i);
// Restriction function "=>"
HfstTransducer restriction( const HfstTransducer &automata, const HfstTransducerPairVector &context);
HfstTransducer before( const HfstTransducer &left, const HfstTransducer &right);
HfstTransducer after( const HfstTransducer &left, const HfstTransducer &right);
}
}
|