Computer Science – Computation and Language
Scientific paper
1994-09-06
7th Australian Joint Conference on AI, 1994
Computer Science
Computation and Language
9 pages, uuencoded compressed postscript, please ignore any undefined command error at end
Scientific paper
Compound nouns such as example noun compound are becoming more common in natural language and pose a number of difficult problems for NLP systems, notably increasing the complexity of parsing. In this paper we develop a probabilistic model for syntactically analysing such compounds. The model predicts compound noun structures based on knowledge of affinities between nouns, which can be acquired from a corpus. Problems inherent in this corpus-based approach are addressed: data sparseness is overcome by the use of semantically motivated word classes and sense ambiguity is explicitly handled in the model. An implementation based on this model is described in Lauer (1994) and correctly parses 77% of the test set.
Dras Mark
Lauer Mark
No associations
LandOfFree
A Probabilistic Model of Compound Nouns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Probabilistic Model of Compound Nouns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Probabilistic Model of Compound Nouns will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-339177