Add configuration for LTeX
This commit is contained in:
parent
504606ec06
commit
4b007951a5
37
.vscode/ltex.dictionary.en-GB.txt
vendored
Normal file
37
.vscode/ltex.dictionary.en-GB.txt
vendored
Normal file
@ -0,0 +1,37 @@
|
||||
Prolog
|
||||
MiniZinc
|
||||
equisatisfiable
|
||||
Gurobi
|
||||
Kleene
|
||||
Booleanization
|
||||
MiniSearch
|
||||
MicroZinc
|
||||
OpenWBO
|
||||
unsatisfiable
|
||||
undefinedness
|
||||
Choco
|
||||
DPLL
|
||||
MiniSAT
|
||||
Kissat
|
||||
AMPL
|
||||
subtours
|
||||
Zemlin
|
||||
makespan
|
||||
simpagation
|
||||
memoization
|
||||
FlatZinc
|
||||
Gecode
|
||||
CPLEX
|
||||
antitone
|
||||
QCP-max
|
||||
Booleanized
|
||||
unsatisfiability
|
||||
Jip
|
||||
Uppsala
|
||||
Radboud
|
||||
NanoZinc
|
||||
Ackermann
|
||||
nullary
|
||||
GBAC
|
||||
RCPSP
|
||||
Reifications
|
||||
1
.vscode/ltex.disabledRules.en-GB.txt
vendored
Normal file
1
.vscode/ltex.disabledRules.en-GB.txt
vendored
Normal file
@ -0,0 +1 @@
|
||||
ARROWS
|
||||
179
.vscode/ltex.hiddenFalsePositives.en-GB.txt
vendored
Normal file
179
.vscode/ltex.hiddenFalsePositives.en-GB.txt
vendored
Normal file
@ -0,0 +1,179 @@
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QOnce given a complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the Dummies, the forms an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAs an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, our goal is to find a schedule that minimises the finishing time of the last task.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAs an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, our goal is to find a schedule that minimizes the finishing time of the last task.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Q\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q shows an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model for the open shop problem.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTo create an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the problem, the user provides the number of jobs and machines that are considered, and the duration of each task.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model of the open shop problem\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAdditionally, the process to encode an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q all happens “behind the scenes”.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QOnce given a complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the Dummies, the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q forms an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QUsing the same mechanism, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q defines how an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is encoded for a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qsupport incremental usage of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThen, we describe a technique to optimize the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q process for incremental changes to an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qavar name=auxiliary variable, description= A \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q not explicitly defined in a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, but rather introduced in the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qbyte-code name=byte-code, description=A set of instructions designed to be efficiently executed by an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTogether with a complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q forms an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Qgls-api name=Application Programming Interface (API), description= A particular set of rules and specifications that a software program can follow to access and make use of the services and resources provided by another particular software program that implements that API ,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qcvar name=control variable, description= A special form of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q where the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q represent the result of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q ,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QA \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q formed with an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model is then rewritten into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qincremental-rewriting name=incremental-rewriting, description=The \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that is continuously changed,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qint-sol name=intermediate solution, description=A \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that is not (yet) proven to be the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qmodel name=constraint model, description= A formalization of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q or an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIt is defined in terms of formalized decision, Dummies of different kinds (e.g. Boolean, integers, or even sets), and Dummies, Boolean logic formulas which are forced to hold in any \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, and, in case of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe combination of a constraint model and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Qs for its Dummies is said to be an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the constraint model ,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qnanozinc name=NanoZinc, description=A language to represent the current state of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q during \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor such a problem, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q with the highest quality ,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qopt-sol name=optimal solution, description=A \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for which it has been proven that no other \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q exist of higher quality,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qsol name=solution, description=A complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q such that all Dummies are satisfied,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QSimilarly, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is said to be partial when it maps only a subset of the Dummies and Dummies in a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThey can be used as immutable data used to define Dummies or provide structural information about an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor example, a problem parameter can influence the number of Dummies in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q ,\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Qrewriting name=rewriting, description= The process of transforming a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q into an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is referred to as rewriting.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qaggregation name=constraint aggregation, description=A technique that combines many smaller Dummies into a one or, by exception, a few larger Dummies,\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Qgls-ampl name=AMPL: A Mathematical Programming Language, description=AMPL is a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q originally designed to serve as a common input language for mathematical Dummies (e.g. \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q).\\E$"}
|
||||
{"rule":"COMMA_PARENTHESIS_WHITESPACE","sentence":"^\\Qgls-api name=Application Programming Interface (API), description= A particular set of rules and specifications that a software program can follow to access and make use of the services and resources provided by another particular software program that implements that API ,\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Qdblp computer science bibliography, https://dblp.org\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QA specific problem is captured by an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, the combination of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q with a complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q (i.e. a mapping from all Dummies to values).\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QA specific problem is captured by an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, the combination of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q with a complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q (i.e. a mapping from all Dummies to a value).\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QMany Dummies also support the modelling of Dummies, where a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is augmented with an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_GB_SIMPLE_REPLACE","sentence":"^\\QThe following set of equations describes this “knapsack” problem as an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q:\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe following set of equations describes this “knapsack” problem as an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q:\\E$"}
|
||||
{"rule":"EN_GB_SIMPLE_REPLACE","sentence":"^\\QA \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model describing a 0-1 knapsack problem\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Q[\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the Dummies that satisfies the Dummies, [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the Dummies that satisfies the Dummies and minimises the value of the expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, or [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to similarly maximise the value of the expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Q[\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the Dummies that satisfies the Dummies, [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the Dummies that satisfies the Dummies and minimizes the value of the expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, or [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to similarly maximise the value of the expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Q[\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the Dummies that satisfies the Dummies, [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the Dummies that satisfies the Dummies and minimizes the value of the expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, or [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] to similarly maximize the value of the expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe other two types of goals are used when the model describes an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_GB_SIMPLE_REPLACE","sentence":"^\\QThis \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expresses the knapsack relation, with the following arguments: \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q are the weights of the items, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q are the profits for each item, the Dummies in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q represent how many of each item are present in the knapsack, and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, respectively, represent the weight and profit of the knapsack\\E$"}
|
||||
{"rule":"EN_GB_SIMPLE_REPLACE","sentence":"^\\QThis has the additional benefit that the knapsack structure of the problem is then known.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QInstead, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is created and a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is added to ensure that it takes the correct value.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor the selection of an element from an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q language uses an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q access syntax similar to most other computer languages.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe selection of an element from an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is in many way similar to the choice in a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expression.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe selection of an element from an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is in many ways similar to the choice in a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expression.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIf the expression is a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, then the expression is rewritten to an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe following example constructs an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that contains the tripled even values of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QSince we then cannot decide during \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q if an element is present in the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, the elements are made of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q type.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor example, the following function returns an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that is constrained to be the multiplication of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q by the relational multiplication \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAlthough \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q does not typically prescribe a way to find the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, it provides the modeller with a way to give “hints” to the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThrough the use of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q on the solving goal item, the modeller can express an order in which they think values should be tried for an arrangement of Dummies in the model.\\E$"}
|
||||
{"rule":"I_LOWERCASE","sentence":"^\\QSuppose the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q a has index set \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, but i takes the value seven.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QWhen given an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, one may wonder how to find a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTherefore, a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for one \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q looks very different from an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for a different \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor many \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q Dummies this model is close to a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, since integer Dummies and an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q are common.\\E$"}
|
||||
{"rule":"CD_NN","sentence":"^\\Q\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q visualizes the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q after placing a queen on the d3 square of an eight by eight chessboard.\\E$"}
|
||||
{"rule":"ENGLISH_WORD_REPEAT_BEGINNING_RULE","sentence":"^\\QPropagate the downward diagonal.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QHowever, when it finds a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, it does not yet know if this \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIt is an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qmaximize \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q subject to \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor problems that are in the form of a linear program, there are proven methods to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QWe do this by treating the mixed integer program as a linear program and find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIf the Dummies happen to take integer values in the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, then we have found an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the mixed integer program.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTo solve an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, it can be rewritten into a mixed integer program.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qgiven \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q maximise \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q subject to \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qgiven \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q maximize \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q subject to \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe problem asks if there is an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for the Dummies of a given Boolean formula, such that the formula is \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTo solve the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q problem, the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q has to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for the Dummies where at least one literal is true in every clause.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qgiven \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q find \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Qtrue \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q,false \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Qsubject to \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe goal in the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q problem is then to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for Boolean Dummies that maximizes the cumulative weights of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q clauses.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q problem is analogous to an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QLike an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, the aim of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is to find the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the problem.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIt is, again, possible to rewrite a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q with an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q as a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q problem.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor many problems the use of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q Dummies offers a very successful method to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to a problem.\\E$"}
|
||||
{"rule":"THE_SUPERLATIVE","sentence":"^\\QThe goal of the problem is to find a shortest path that visits all the cities exactly once and returns to its origin.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model describing the \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
|
||||
{"rule":"A_NNS","sentence":"^\\QFrom these cities it declares a set Paths that contains all possible paths between the different cities.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model describing the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model describing the job shop problem, abstracting from \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q declarations.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QDummies of this type are influenced by the ScheduleHorizon \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q defined on \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the model.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe makespan \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q represents the time spanned by all tasks.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QOn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q a UnaryResource is declared for every machine.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QA UnaryResource can be used by at most one activity at a time.\\E$"}
|
||||
{"rule":"PREPOSITION_VERB","sentence":"^\\QThe \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q uses the requires operator to bind an activity to a resource.\\E$"}
|
||||
{"rule":"PREPOSITION_VERB","sentence":"^\\QIt first states the resource objects and then merely has to use the requires keyword to force tasks on the same machine to be mutually exclusive.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model describing the social golfer problem\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model is unable to use a set of partitions and instead uses an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of sets.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFirst, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model is transformed into \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThen, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model forms an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, and is subsequently rewritten into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model can be rewritten by Saville Row into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for a variety of Dummies, including \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q Dummies.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIn the frontend, a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model is combined with its data into an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe instance is parsed into an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe goal of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q process is to arrive at a flat \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q: an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that only contains Dummies that consist of a singular calls, all arguments to calls are \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q literals or \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q identifiers, and using only Dummies and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q types that are \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the target \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QInstead, an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q must be created to represent the value of the sub-expression, and it must be constrained to take the value corresponding to the expression.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QUsing a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q the function body explicitly creates an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, constrains it to take to correct value, and then returns it.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIt can rewrite (and propagate) an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q multiple times, remembering information about the earlier iteration(s).\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QHow is an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q transformed into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q?\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q required to translate an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q was negligible.\\E$"}
|
||||
{"rule":"IT_IS","sentence":"^\\QWe design and evaluate an architecture for Dummies that can accommodate its the modern uses.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe machine operates using an Intel Xeon 8260 \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, which has 24 non-hyperthreaded cores, and has access to 268.55 GB of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qis an open source \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qis an open source \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q solver \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qis a proprietary \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qis a open source \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Qaccap amaze city-position community-detection depot-placement freepizza groupsplitter kidney-exchange multi-knapsack nonogram nside rcpsp-wet road-cons roster stack-cuttingstock steelmillslab triangular\\E$"}
|
||||
{"rule":"ENGLISH_WORD_REPEAT_BEGINNING_RULE","sentence":"^\\QIt presents an analysis technique to reason about in what (\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q) form Dummies should be considered.\\E$"}
|
||||
{"rule":"ENGLISH_WORD_REPEAT_BEGINNING_RULE","sentence":"^\\QIt presents a design and implementation of techniques to automatically introduce \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of Dummies in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"ENGLISH_WORD_REPEAT_BEGINNING_RULE","sentence":"^\\QIt develops a technique to simplify Dummies by efficiently eliminating Dummies.\\E$"}
|
||||
{"rule":"ENGLISH_WORD_REPEAT_BEGINNING_RULE","sentence":"^\\QIt proposes two novel methods to reduce the overhead of using Dummies in incremental techniques: \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of changing Dummies.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe first rule, (Ident), is unique in the sense that the context of an identifier does not directly affect other expressions.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QInstead, we introduce the functions “pushCtx” and “collectCtx”.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QAs an input to the inference process, a “argCtx” function is used to give the context of the arguments of a function, given the function itself and the context of the call.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QAlthough a standard definition for the “argCtx” function may cover the most common cases, it does not cover user-defined functions.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QDefinition of the “argCtx” function for operators.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QFinally, the (Compr) and (Arr) rules show simple inference rules for \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q construction expressions.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QAs previously discussed, the contexts in which the identifier was used can be retrieved using the “collectCtx” function.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qjoin A table showing the result of joining two contexts.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Q(TupC) and (TupD) handle the context inference during the construction and destructuring of tuples respectively.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QFinally, the (Decl) and (Item0) rules describe two base cases in the inference.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QDifferent from the rules described, when an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q access or \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expression is found in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q context, it often makes sense to evaluate its sub-expression in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q context as well.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTo detect the situation where the sub-expression are only used in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q access or \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expression we introduce the context.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qjoin The join context operation extended with .\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTo detect the situation where the sub-expression are only used in an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q access or \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expression we introduce the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q context.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qjoin The join context operation extended with \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qthe disjunction itself is in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q context, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q are in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q context, and the rest are in \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q context.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qafter which b2 can be removed from the model.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QConsider for example the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q operator on integers, which \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q represents as an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q call.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe mapping ensures that the context is correctly transformed when accessing the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q table for an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q call.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe context may depend on data that is only known at an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q level.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model for this problem contains an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q lookup \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, where the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is larger than the index set of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QA single \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, however, is negatively impacted by the change; an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for this \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is no longer found.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q process of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q then consists of two steps: the translation of \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model transformations into \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, implemented by a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q; and the iterative \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q using these \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q transformations to arrive at a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, implemented using an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qa \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that translates \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q models to a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, and a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that produces a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QA modeller can repeatedly add Dummies and Dummies to an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and, crucially, the additions to the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q can be retracted in reverse order through the use of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QSolver Unsatisfiable Optimal Solution Satisfied Unk.\\E$"}
|
||||
{"rule":"WHITESPACE_RULE","sentence":"^\\Q[main]\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Q[label=ownpubs]assets/bibliography/dekker_publications.bib\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qcontinuously updating \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q Dummies, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for known Dummies, specialised Dummies when variables get \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, common sub-expression elimination, and removing Dummies and Dummies that are no longer required.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qcontinuously updating \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q Dummies, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for known Dummies, specialized Dummies when variables get \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, common sub-expression elimination, and removing Dummies and Dummies that are no longer required.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QTogether, the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and a complete \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q form an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q that can be executed by the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThe translation to \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q turns all expressions into function calls, replaces the special generator syntax in the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q with an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, and creates the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q function.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, we can then create a simple \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q program that calls \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QThese are said to be the “root-context” Dummies of the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, i.e. those that have to hold globally and are not just used to define an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (CallBuiltin) rule applies to “built-in” functions that can be evaluated directly, such as arithmetic and Boolean operations on fixed values.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (CallNative) rule applies to calls to \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q functions, that describe relations, that have been marked as Dummies \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QDummies that follow from the evaluation of the let expression, by the (ItemC) rule, are collected in the third component, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q , of the evaluation arguments.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QDummies that follow from the evaluation of the let expression, by the (ItemC) rule, are collected in the third component, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, of the evaluation arguments.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (ItemT) rule handles introduction of new Dummies by adding them to the context.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (ItemTE) rule handles introduction of new Dummies with a defining equation by evaluating them in the current context and substituting the name of the new \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q by the result of evaluation in the entire scope of the variable.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe rules (ItemTupC) and (ItemTupD) are for the construction and deconstruction of tuple objects.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (Ident) rule looks up a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q in the environment and returns the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q itself to be used in any Dummies.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (Const) rule simply returns the constant.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (Acess) rule evaluates the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q expression \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and the index \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (WhereT) rule evaluates the guard of a where \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and if true returns the resulting expression in a list.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (WhereF) rule evaluates the guard and when false returns an empty list.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QThe (ListG) rule evaluates the iteration set \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q to get its value \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, which must be fixed.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIt can read Dummies from a file or via an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QIn this thesis we will follow the same naming standard as \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, where a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q has the same name as the original \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q with reif appended.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qthe variable \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q variables \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q multiplication Dummies.\\E$"}
|
||||
{"rule":"EN_GB_SIMPLE_REPLACE","sentence":"^\\QThe removal of unused identifiers is taken care of by garbage collection in the interpreter.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QAny annotated \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is handled by the (CallNative) rule rather than the (Call) rule, which means that it is simply added as a call into the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q code, without evaluating its body.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q is continuously updated with new data, such as newly available jobs to be scheduled or customer requests to be processed.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qallow us to express important aspects of the meta-optimization algorithm in a more convenient way, and enable a simple \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q scheme that requires no additional communication with and only small, simple extensions of the target \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\Q[\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] there has been no \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q yet; [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of the last \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q was \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q; [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] the last \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q found a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q; [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] the last \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q found and proved an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q in its \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q; [\\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q] the last \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q did not find a solution, but did not exhaust its \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIf any \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q was found, it is declared an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QInitially, the search is in stage one: it tries to find an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for the first \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QCalls to the random number functions have been renamed by appending slv, so that they are not simply evaluates directly.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QA universal approach to the incremental usage of Dummies, and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, is to allow incremental changes to an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QIn this section we extend our architecture with an incremental constraint modelling interface that allows the modeller to change an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qthe addition or removal of new Dummies or Dummies, changes made to the Dummies of Dummies, additions to the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q table, and substitutions made due to equality \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QFor this comparison compare the time that is required to (repeatedly) rewrite an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and the time required by the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\QWe ran experiments for three models from the MiniZinc Challenge \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q (gbac, steelmillslab, and rcpsp-wet).\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QWe compare our methods against a naive system that repeatedly programmatically changes an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, rewrites the full Dummies, and starts a new \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q instance.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QWe compare the time that is required to (repeatedly) rewrite an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q and the time taken by the \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
83
.vscode/settings.json
vendored
Normal file
83
.vscode/settings.json
vendored
Normal file
@ -0,0 +1,83 @@
|
||||
{
|
||||
"ltex.additionalRules.motherTongue": "nl",
|
||||
"ltex.language": "en-GB",
|
||||
"ltex.latex.commands": {
|
||||
"\\solver{}": "dummy",
|
||||
"\\variable{}": "dummy",
|
||||
"\\variables{}": "pluralDummy",
|
||||
"\\solvers{}": "pluralDummy",
|
||||
"\\prbpars{}": "pluralDummy",
|
||||
"\\prbpar{}": "dummy",
|
||||
"\\instance{}": "dummy",
|
||||
"\\instances{}": "pluralDummy",
|
||||
"\\constraints{}": "pluralDummy",
|
||||
"\\constraint{}": "dummy",
|
||||
"\\cml{}": "dummy",
|
||||
"\\cmls{}": "pluralDummy",
|
||||
"\\Cmls{}": "pluralDummy",
|
||||
"\\Cml{}": "dummy",
|
||||
"\\minizinc{}": "dummy",
|
||||
"\\flatzinc{}": "dummy",
|
||||
"\\gls{}": "dummy",
|
||||
"\\glspl{}": "pluralDummy",
|
||||
"\\glsxtrshort{}": "dummy",
|
||||
"\\Constraint{}": "dummy",
|
||||
"\\Constraints{}": "pluralDummy",
|
||||
"\\lrefrange{}{}": "pluralDummy",
|
||||
"\\Lrefrange{}{}": "pluralDummy",
|
||||
"\\lref{}": "dummy",
|
||||
"\\Lref{}": "dummy",
|
||||
"\\amplfile{}": "ignore",
|
||||
"\\mznfile{}": "ignore",
|
||||
"\\plainfile{}": "ignore",
|
||||
"\\cmodel{}": "dummy",
|
||||
"\\cmodels{}": "pluralDummy",
|
||||
"\\mzninline{}": "dummy",
|
||||
"\\compiler{}": "dummy",
|
||||
"\\nanozinc{}": "dummy",
|
||||
"\\microzinc{}": "dummy",
|
||||
"\\newglossaryentry{}{}": "default",
|
||||
"\\parameters{}": "pluralDummy",
|
||||
"\\parameter{}": "dummy",
|
||||
"\\Solver{}": "dummy",
|
||||
"\\Solvers{}": "pluralDummy",
|
||||
"\\glsreset{}": "ignore",
|
||||
"\\Variables{}": "pluralDummy",
|
||||
"\\Variable{}": "dummy",
|
||||
"\\domains{}": "pluralDummy",
|
||||
"\\domain{}": "dummy",
|
||||
"\\posc{}": "dummy",
|
||||
"\\negc{}": "dummy",
|
||||
"\\rootc{}": "dummy",
|
||||
"\\mixc{}": "dummy",
|
||||
"\\glsadd{}": "ignore",
|
||||
"\\ctxeval{}{}": "dummy",
|
||||
"\\changepos{}": "dummy",
|
||||
"\\changeneg{}": "dummy",
|
||||
"\\Switch{}{}": "ignore",
|
||||
"\\ctxfunc{}{}": "dummy",
|
||||
"\\mayberootc{}": "dummy",
|
||||
"\\interpreter{}": "dummy",
|
||||
"\\setchessboard{}": "ignore",
|
||||
"\\chessboard[]": "ignore",
|
||||
"\\pgfplotsset{}": "ignore",
|
||||
"\\pgfplotstableread[]{}": "ignore",
|
||||
"\\KOMAoption{}{}": "ignore",
|
||||
"\\newfontfamily{}{}[]": "ignore",
|
||||
"\\setmonofont{}[]": "ignore",
|
||||
"\\usemintedstyle{}": "ignore",
|
||||
"\\newtcolorbox{}[][]{}": "ignore",
|
||||
"\\BeforeBeginEnvironment{}{}": "ignore",
|
||||
"\\AfterEndEnvironment{}{}": "ignore",
|
||||
"\\syntax{}": "dummy",
|
||||
"\\minisearch": "dummy"
|
||||
},
|
||||
"ltex.latex.environments": {
|
||||
"mzn": "ignore",
|
||||
"grammar": "ignore",
|
||||
"plain": "ignore",
|
||||
"minted": "ignore",
|
||||
"nzn": "ignore",
|
||||
"prooftree": "ignore"
|
||||
},
|
||||
}
|
||||
Reference in New Issue
Block a user