A Probabilistic Model of Compound Nouns
| dc.creator | Lauer, Mark | |
| dc.creator | Dras, Mark | |
| dc.date | 1994-09-06 | |
| dc.date.accessioned | 2026-07-07T09:09:31Z | |
| dc.date.available | 2026-07-07T09:09:31Z | |
| dc.description | 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. | |
| dc.description | 9 pages, uuencoded compressed postscript, please ignore any undefined command error at end | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9409003 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9409003 | |
| dc.identifier | 7th Australian Joint Conference on AI, 1994 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151062 | |
| dc.subject | Computation and Language | |
| dc.title | A Probabilistic Model of Compound Nouns | |
| dc.type | text |