Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area…
"A Bradford book.""The Turing Test is part of the vocabulary of popular culture - it has appeared in works ranging from the Broadway play Breaking the Code to the comic strip "Robotman." The writings collected for this book examine the profound philosophical issues surrounding the Turing Test as a criterion for intelligence. Alan Turing's idea, originally expressed in a 1950 paper titled "Compu…
These notes discuss a particular approach to encoding linguistic information, both syntactic and semantic, which has been called “unification-based” or “complex-feature-based.” The term “unification-based grammar formalism” covers quite a variety of formal devices, which have been developed along historically different paths. The fact that they are regarded as a group is due per…