An attractive, but never very central idea in modern semantics has been to regard linguistic expressions as denoting certain ‘procedures’ performed within models for the language. For instance, truth tables for propositional connectives may be viewed as computational instructions for finding truth values. Another example is the proposal in Suppes (1982) to correlate certain adjectives with procedures for locating an individual in some underlying comparative order. And finally, the frequent proposals in a more computer-oriented setting for translating from natural language into programming languages are congenial too. In this chapter, this perspective will be applied to determiners, or more in particular, quantifier expressions.
KeywordsFinite State Machine Regular Language Finite State Automaton Procedural Semantic Machine Graph
Unable to display preview. Download preview PDF.