NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 9 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Roll, Mikael; Frid, Johan; Horne, Merle – Language and Speech, 2007
Hesitation disfluencies after phonetically prominent stranded function words are thought to reflect the cognitive coding of complex structures. Speech fragments following the Swedish function word "att" "that" were analyzed syntactically, and divided into two groups: one with "att" in disfluent contexts, and the other with "att" in fluent…
Descriptors: Form Classes (Languages), Componential Analysis, Swedish, Computational Linguistics
Hayes-Roth, Frederick; McDermott, John – 1976
The learning machine described in this paper acquires concepts representable as conjunctive forms of the predicate calculus and behaviors representable as productions (antecedent-consequent pairs of such conjunctive forms): these concepts and behavior rules are inferred from sequentially presented pairs of examples by an algorithm that is probably…
Descriptors: Algorithms, Cognitive Processes, Componential Analysis, Computational Linguistics
Pepinsky, Harold B. – 1978
A Computer-Assisted Language Analysis System (CALAS) was developed as a syntactic and semantic analyzer of machine readable text in English. CALAS includes a set of computer programs, an algorithm for implementation, and human editors who assist the computer and its programmer in the processing of data. Data analysis is accomplished in three…
Descriptors: Case (Grammar), Componential Analysis, Computational Linguistics, Computer Programs
Wright, James R. – 1977
Noam Chomsky's transformational-generative grammar model may effectively be translated into an equivalent computer model. Phrase-structure rules and transformations are tested as to their validity and ordering by the computer via the process of random lexical substitution. Errors appearing in the grammar are detected and rectified, and formal…
Descriptors: Componential Analysis, Computational Linguistics, Computer Programs, Computers
Peer reviewed Peer reviewed
Das-Gupta, Padmini – Journal of the American Society for Information Science, 1987
Presents an algorithm for use in natural language document retrieval systems which automatically determines if the conjunction "and" in a statement representing an information need should be translated into a Boolean "and" or "or." The results of an experiment that used the algorithm are reported, and further research is suggested. (CLB)
Descriptors: Algorithms, Componential Analysis, Computational Linguistics, Conjunctions
Peer reviewed Peer reviewed
Lowe, David; Matthews, Robert – Computers and the Humanities, 1995
Illustrates how Radial Basis Function (RBF) network techniques can be used to explore questions concerning authorship of historic documents. Demonstrates the utility and potential for using quantitative techniques to assist in the decision-making process in relatively subjective disciplines. Compares RBF neural network techniques with more…
Descriptors: Authors, Componential Analysis, Computational Linguistics, Computer Uses in Education
Peer reviewed Peer reviewed
Vleduts-Stokolov, Natasha – Journal of the American Society for Information Science, 1987
Describes a system developed for the automatic recognition of biological concepts in titles of scientific articles; reports results of several pilot experiments which tested the system's performance; analyzes typical ambiguity problems encountered by the system; describes a disambiguation technique that was developed; and discusses future plans…
Descriptors: Automatic Indexing, Biological Sciences, Componential Analysis, Computational Linguistics
Maddalena, Sean Romano – 2001
Could corpus analysis be used to solve some of the problems surrounding non-native speakers' understanding of seemingly synonymous words? This research is needed because there is no single universal unified lexical theory that can be applied to the study of semantics or of language as a whole. Instead, there are a variety of views than can be…
Descriptors: Active Learning, Componential Analysis, Computational Linguistics, Databases
Peer reviewed Peer reviewed
Martindale, Colin; McKenzie, Dean – Computers and the Humanities, 1995
Compares the success of lexical statistics, content analysis, and function words in determining the true author of "The Federalist." The function word approach proved most successful in attributing the papers to James Madison. Lexical statistics contributed nothing, while content analytic measures resulted in some success. (MJP)
Descriptors: Componential Analysis, Computational Linguistics, Computer Oriented Programs, Computer Software