Unnumbered source etymology
Original entry ↗To apply the FOIL algorithm to.
An acronym for the algorithm for multiplying two binomials.
Acronym of first outer inner last or similar.
Inspect preserved source fields
Raw extraction fields are retained for auditing. Their order does not establish ancestry.
{
"templates": [
{
"name": "acronym",
"args": {
"1": "en",
"2": "first outer inner last"
},
"expansion": "Acronym of first outer inner last"
}
],
"links": [
[
"first",
"first#English"
],
[
"outer",
"outer#English"
],
[
"inner",
"inner#English"
],
[
"last",
"last#English"
]
],
"references": [],
"descendants": [],
"lexical": [
{
"pos": "verb",
"glosses": [
"To apply the FOIL algorithm to."
],
"tags": [
"transitive"
],
"recordId": "4d87a48c9034db25175f01ca24bc2f8c63083afad5e7c40080331d7482a0dd5e",
"rawRecordSha256": "e6621987ffe757901f74f47a7ca8604d7515eba3f1252692c98011e3eb15150d",
"sourceRecordOrdinal": 115140
},
{
"pos": "name",
"glosses": [
"An acronym for the algorithm for multiplying two binomials."
],
"tags": [
"mnemonic"
],
"recordId": "5a007cda7e9d5a70e437a7aef2228f5333e6c5addfd74b2c5f5f862a9aabc156",
"rawRecordSha256": "4380a04583b676794957bec18a5218ee6a5cf4d0e46eeb301130bbf2972440c0",
"sourceRecordOrdinal": 115139
}
],
"omittedAuxiliaryFields": {
"templates": 0,
"links": 0,
"references": 0,
"descendants": 0,
"lexicalRecords": 0,
"lexicalSenses": 0,
"glosses": 0
}
}