lancejpollard

Source

This is a somewhat belated summary to the query I made about a month ago. The original query goes as follows:

James McCawley (1992) has suggested that there be no such category as >Adjective in Mandarin Chinese after failing to distinguish adjectives >from verbs with a list of universal properties. I like to know if >there are indeed languages without adjectives. Japanese and some >Sino-Tibetan languages can employ 'adjectives' as predicate without a >copula, just like Chinese. I wonder if there is any difficulty in >identifying adjectives in these languages. I will post a summary if >there is interest. > >Reference: >James McCawley (1992) Justifying part-of-speech assignments in > Mandarin Chinese. Journal of Chinese Linguistics 20, 2, > 211-46.

I received seven replies from the respondents below. Languages they cited are given along with the respondents' names according to the order their notes reached me. Many thanks to their responses.

John E. Koontz

lancejpollard

const { uniq, omit } = require('lodash')
const serialization = require('./serialization')
const knex = require('../../knex')
const toneText = require('../../../../../../drumwork/deck/tone')
const callText = require('../../../../../../drumwork/deck/call')

let objectKeyToIdMap
let objectIdToKeyMap
let languageMap

lancejpollard

lancejpollard

// http://web.mnstate.edu/goytadam/talks/DBS.pdf
const SIZE = 8

const vertices = getEveryBitPermutation(SIZE).reduce((m, x) => {
  m.set(x.toString(2).padStart(SIZE, 0), new Array)
  return m
}, new Map)

for (let [v, edges] of vertices) {

lancejpollard

class Iterator {
  constructor(k, n) {
    this.k = k // alphabetSize
    this.n = n // wordSize
    this.power = new Uint32Array(n + 1)
    this.power[0] = 1;
    for (let i = 1; i <= n; i++) {
      this.power[i] = k * this.power[i - 1];
    }

lancejpollard

// ported from C from http://debruijnsequence.org/db/home

const MAX = 100

function isZeroes(a, n) {
  for (let i = 1; i <= n; i++) {
    if (a[i] === 1) {
      return false;
    }
  }

lancejpollard

// from https://www.klittlepage.com/2013/12/21/twelve-days-2013-de-bruijn-sequences/
import java.util.Random;

/**
* @author Kelly Littlepage
*/
public class DeBruijn {

    /***
    * Generate a De Bruijn Sequence using the recursive FKM algorithm as given

lancejpollard

#include <Frigo/all>
#include <Frigo/all.cpp>
  
// from https://stackoverflow.com/questions/7365562/de-bruijn-like-sequence-for-2n-1-how-is-it-constructed/7369288#7369288

using namespace Frigo::Lang;
using namespace std;

class MagicNumberGenerator
{

lancejpollard

const BINARY_LEADING_ZERO_TABLE = makeLeadingZeroTable()
const BINARY_TRAILING_ZERO_CONSTANT = 0x077cb531
const BINARY_TRAILING_ZERO_TABLE = makeDeBruijnTrailingZeroTable(5, BINARY_TRAILING_ZERO_CONSTANT)

function countTrailingZeroes32(n) {
  return BINARY_TRAILING_ZERO_TABLE[((n & -n) * BINARY_TRAILING_ZERO_CONSTANT) >>> 27];
}

function countTrailingZeroes16(n) {

lancejpollard

def deBruijn(n, k):
   '''
   An implementation of the FKM algorithm for generating the de Bruijn
   sequence containing all k-ary strings of length n, as described in
   "Combinatorial Generation" by Frank Ruskey.
   '''
 
   a = [ 0 ] * (n + 1)
   
   def gen(t, p):