Memory-based lexical acquisition and processing
Lecture notes in computer sciencePublished 1 January 1995
Walter Daelemans
Citations29
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A particular performance-oriented approach to Natural Language Processing based on automatic memory-based learning of linguistic (lexical) tasks is proposed, and the consequences of the approach for computational lexicology are discussed.
Abstract
Current approaches to computational lexicology in language technology are knowledge-based (competence-oriented) and try to abstract away from specific formalisms, domains, and applications. This results in severe complexity, acquisition and reusability bottlenecks. As an alternative, we propose a particular performance-oriented approach to Natural Language Processing based on automatic memory-based learning of linguistic (lexical) tasks. The consequences of the approach for computational lexicology are discussed, and the application of the approach on a number of lexical acquisition and disambiguation tasks in phonology, morphology and syntax is described.
Keywords
Computer Science
Machine LearningInduction of Decision Trees
14,815 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
Cambridge University Press eBooksCase-Based Reasoning
4,254 Citations2005Janet L. Kolodner
It is argued that CBR systems are easy to assess, develop, and deploy and can be evaluated in terms of their cost benefits and argued that CBR systems are easy to assess, develop, and deploy.
Machine LearningInstance-Based Learning Algorithms
4,117 Citations1991David W. Aha, Dennis Kibler +1 more
This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
Elsevier eBooksA Practical Approach to Feature Selection
2,954 Citations1992Kenji Kira, Larry Rendell
Comparison with other feature selection algorithms shows Relief's advantages in terms of learning time and the accuracy of the learned concept, suggesting Relief's practicality.
ACM Transactions on Mathematical SoftwareAn Algorithm for Finding Best Matches in Logarithmic Expected Time
2,765 Citations1977Jerome H. Friedman, Jon Bentley +1 more
Parallel Networks that Learn to Pronounce English Text
1,556 Citations1989Terrence J. Sejnowski
IGI Global eBooksEncyclopedia of Artificial Intelligence
1,400 Citations2009Rabuñal Dopico, Juan Ramón 1973-
Communications of the ACMToward memory-based reasoning
1,232 Citations1986Craig Stanfill, David L. Waltz
The intensive use of memory to recall specific episodes from the past—rather than rules—should be the foundation of machine reasoning.
Machine LearningA Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features
663 Citations1993Scott Cost, Steven L. Salzberg
A nearest neighbor algorithm for learning in domains with symbolic features, which produces excellent classification accuracy on three problems that have been studied by machine learning researchers: predicting protein secondary structure, identifying DNA promoter sequences, and pronouncing English text.
Machine LearningA Nearest Hyperrectangle Learning Method
348 Citations1991Steven L. Salzberg
The results in these domains support the claim that NGE theory can be used to create compact representations with excellent predictive accuracy.
Cambridge University Press eBooksInheritance, Defaults and the Lexicon
137 Citations1994Ted Briscoe Valeria, Valeria de Paiva +2 more
The ACQUILEX LKB: an introduction Ann Copestake, Antonio Sanfilippo, Ted Briscoe and Valeria de Paiva, types and constraints in the LKB, and Defaults in lexical representation.
The acquisition of stress: a data-oriented approach
105 Citations1994Walter Daelemans, Steven Gillis +1 more
A data-oriented (empiricist) alternative to the currently pervasive (nativist) Principles and Parameters approach to the acquisition of stress assignment is investigated and a similarity-based algorithm is used to learn the system of main stress assignment in Dutch.
Generalization performance of backpropagation learning on a syllabification task
99 Citations1992Walter Daelemans, Antal van den Bosch
The results indicate that the generalization performance of backpropagation learning for this task is not better than that of the best symbolic pattern matching approaches, and of exemplar-based generalization.
Data-oriented methods for grapheme-to-phoneme conversion
82 Citations1993Antal van den Bosch, Walter Daelemans
It is shown that using supervised learning techniques, based on a corpus of transcribed words, the same and even better performance can be achieved, without explicit modeling of linguistic knowledge.
Journal of Artificial Intelligence ResearchLearning the Past Tense of English Verbs: The Symbolic Pattern Associator vs. Connectionist Models
40 Citations1994Charles X. Ling
This paper presents a general-purpose Symbolic Pattern Associator (SPA) based upon the decision-tree learning algorithm ID3 and concludes that the SPA generalizes the past tense of unseen verbs better than ANN models by a wide margin.
International Joint Conference on Artificial IntelligenceChallenges of massive parallelism
37 Citations1993Hiroaki Kitano
This Computers and Thought Award lecture will argue that massively parallel artificial intelligence will add new dimensions to the ways that the AI goals are pursued, and demonstrate that massively Parallel artificial intelligence is where AI meets the real world.
The acquisition and use of context-dependent grammars for English
31 Citations1992Robert F. Simmons, Yeong-Ho Yu
It is concluded that CDG is a computationally and conceptually tractable approach for the construction of sentence grammar for large subsets of natural language text.
Learnability and markedness in data-driven acquisition of stress
18 Citations1993Walter Daelemans, Steven Gillis +2 more
Elsevier eBooksA Neural Network for Hyphenation
14 Citations1992Walter Daelemans, Antal van den Bosch
It is shown that although a neural net trained with backprop learning is able to achieve reasonable generalization performance on a hard linguistic pattern recognition problem, it remains inferior in performance to symbolic pattern matching algorithms, and even to a simple table-lookup approach.
Proceedings of the Annual Meeting of the Berkeley Linguistics SocietyReal-Time Morphology: Symbolic Rules or Analogical Networks?
13 Citations1989Bruce L. Derwing, Royal Skousen
This paper presents a meta-analyses of the corpus linguistics Foundations of Speech and Language Foundations (CBLS) dating back to the 1970s and its development as a discipline in the 1980s and 1990s.