},
        "dutch_keywords": {
          "type":       "keyword_marker",
          "keywords": ["hallo", "wereld", "zoeken"]
        },
        "dutch_stemmer": {

    //     fgha[c]|[b]de -> fgha[b]|[c]de. Because these two blocks are the same size, we are done.
    // The Dolphin algorithm is attractive because it does the fewest array reads and writes: each
    // array slot is read and written exactly once. However, it can have very poor memory locality:
    // benchmarking shows it can take 7 times longer than the other two in some cases. The other two